Question
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
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Linked lists are best suited
Similar Questions
Discover Related MCQs
Q. The situation when in a linked list START=NULL is
View solution
Q. Which of the following is two way list?
View solution
Q. In a circular linked list
View solution
Q. A linear collection of data elements where the linear node is given by means of pointer is called?
View solution
Q. Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?
View solution
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?
View solution
Q. A variant of linked list in which last node of the list points to the first node of the list is?
View solution
Q. In doubly linked lists, traversal can be performed?
View solution
Q. What kind of linked list is best to answer question like “What is the item at position n?”
View solution
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?
View solution
Q. A variant of the linked list in which none of the node contains NULL pointer is?
View solution
Q. In circular linked list, insertion of node requires modification of?
View solution
Q. Consider a linked list of n elements. What is the time taken to insert an element after an element pointed by some pointer?
View solution
Q. In a linked list with n nodes, the time taken to insert an element after an element pointed by some pointer is
View solution
Q. A linear collection of data elements where the linear node is given by means of pointer is called
View solution
Q. The time required to delete a node x from a doubly linked list having n nodes is
View solution
Q. A collection of data items of similar type arranged in a sequence is termed as?
View solution
Q. A linked list is a linear collection of homogeneous elements called______.
View solution
Q. Depending on what on what can a linked list be classified into various other types?
View solution
Q. In a singly-linked list (linear linked list), how many fields does each node consists of?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
