Linked list

What is the space complexity needed to store a linked list of n nodes?

• o(1)

• o(n)

• o(n2)

• None of the aboce

What is the time complexity to insert an element to the front of a LinkedList(head pointer given)?

• o(1)

• o(n)

• o(log n)

• None of the above

Which of the following algorithms is not feasible to implement in a linked list?

• Linear Search

• Merge Sort

• Insertion Sort

• Binary Search

Which of the following information is stored in a doubly-linked list’s nodes?

• value

• address of the next node

• address of the previous node

• all the above

Which of the following statements are true?

• Random access of elements at a linked list is not possible.

• Arrays have better cache locality than linked list.

• The size of linked list is dynamic and can be changed as needed.

• All of the above

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element will be?

• O(log n)

• O(n)

• O(1)

• None of the above

In which scenario is the Linked List an excellent data structure? 

• When you need to insert elements at the end of the list 

• When you need to insert elements in the middle of the list 

• When you need to access elements in sequential order 

• When you need quick access to elements by index 

What is a disadvantage of a circular linked list? 

• It consumes more memory than a simple linked list 

• It is complex to implement 

• A simple loop through the list will never end 

• All of the above 

A Linked List in which none of the nodes contain a NULL pointer is referred to? 

• Single Linked List 

• Doubly Linked List 

• Circular Linked List

• None of the above 

Which of the following is true about linked list implementation of stack?

• In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.

• In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.

• Both of the above

• None of the above