Which of the following are two-way lists?

Related Questions

• 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?
• 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 advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
• Linked lists are best suited
• In doubly linked lists
• In doubly linked lists, traversal can be performed?
• Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
• Which if the following is/are the levels of implementation of data structure
• Which of the following is not the part of ADT description?
• Which of the following data structure can’t store the non-homogeneous data elements?