adplus-dvertising
frame-decoration

Question

The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.

a.

Lists

b.

Linked Lists

c.

Trees

d.

Queues

Answer: (b).Linked Lists

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.

Similar Questions

Discover Related MCQs

Q. There is an extra element at the head of the list called a ……….

Q. Each node in a linked list has two pairs of ………….. and ……………….

Q. The disadvantage in using a circular linked list is …………………….

Q. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as

Q. Linked lists are best suited

Q. The situation when in a linked list START=NULL is

Q. Which of the following is two way list?

Q. In a circular linked list

Q. A linear collection of data elements where the linear node is given by means of pointer is called?

Q. Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?

Q. 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?

Q. A variant of linked list in which last node of the list points to the first node of the list is?

Q. In doubly linked lists, traversal can be performed?

Q. What kind of linked list is best to answer question like “What is the item at position n?”

Q. A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?

Q. A variant of the linked list in which none of the node contains NULL pointer is?

Q. In circular linked list, insertion of node requires modification of?

Q. Consider a linked list of n elements. What is the time taken to insert an element after an element pointed by some pointer?

Q. In a linked list with n nodes, the time taken to insert an element after an element pointed by some pointer is

Q. A linear collection of data elements where the linear node is given by means of pointer is called