McqMate

Q. |
## The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used? |

A. | Singly linked list |

B. | Doubly linked list |

C. | Circular doubly linked list |

D. | Array implementation of list |

Answer» C. Circular doubly linked list |

887

0

Do you find this helpful?

1

View all MCQs in

Data Structures (DS)No comments yet

- 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.
- What differentiates a circular linked list from a normal linked list?
- What differentiates a circular linked list from a normal linked list?
- 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?
- A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
- 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?
- Consider a small circular linked list. How to detect the presence of cycles in this list effectively?
- A linked list whose last node points back to the list node instead of containing the null pointer________.
- The _________ for a linked list is a pointer variable that locates the beginning of the list.
- In a linked list the _________field contains the address of next element in the list.