[Solved] Linked lists are best suited

Q.	Linked lists are best suited
A.	for relatively permanent collections of data
B.	for the size of the structure and the data in the structure are constantly changing
C.	for both of above situation
D.	for none of above situation
Answer» B. for the size of the structure and the data in the structure are constantly changing

View all MCQs in: Data Structure (DS)

Discussion

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.
In doubly linked lists
In doubly linked lists, traversal can be performed?
What differentiates a circular linked list from a normal linked list?
The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
Which of the following are two-way lists?
Each node in a linked list has two pairs of ………….. and ……………….
The disadvantage in using a circular linked list is …………………….
A circular linked list can be used for