What kind of linked list is best to answer questions like “What is the item at position n?”
a) Singly linked list
b) Doubly linked list
c) Circular linked list
d) Array implementation of linked list
Linked lists are not suitable for the implementation of…………
a) Insertion sort
b) Radix sort
c) Polynomial manipulation
d) Binary search
Explanation: It cannot be implemented using linked lists.
Linked list is considered as an example of……..type of memory allocation.
a) Dynamic
b) Static
c) Compile time
d) Heap
In Linked List implementation, a node carries information regarding………
a) Data
b) Link
c) Data and Link
d) Node
Linked list data structure offers considerable saving in……….
a) Computational Time
b) Space Utilization
c) Space Utilization and Computational Time
d) Speed Utilization
Explanation: Linked lists saves both space and time.
What is the time complexity of inserting at the end in dynamic arrays?
a) O(1)
b) O(n)
c) O(logn)
d) Either O(1) or O(n)
