Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS.
ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on
an array for almost all the basic LIST operations.
iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES
on a linear array with two indices.
iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?

Related MCQs

• Which of the following statement is true? i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
• The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
• Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
• The advantage of a two-way list and a circular header list is combined into a ________.
• Which of the following application makes use of a circular linked list?
• Which of the following is false about a circular linked list?
• A circular linked list can be used for
• How do you count the number of elements in the circular linked list?
• In Circular Linked List insertion of a node involves the modification of ____ links.
• What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?