DS Quiz 2

What is the worst case runtime of linear search(recursive) algorithm?

• O(n)

• O(logn)

• O(n²)

• O(nx)

Which of the following is not a disadvantage to the usage of array?

• Fixed size

• There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size

• Insertion based on position

• Accessing elements at specified positions

What is the time complexity to count the number of elements in the linked list?

• O(1)

• O(n)

• O(logn)

• O(n²)

Linked lists are not suitable for the implementation of ___________

• Insertion sort

• Radix sort

• Polynomial manipulation

• Binary search

Linked list is considered as an example of ___________ type of memory allocation.

• Dynamic

• Static

• Compile time

• Heap

Which of the following points is/are not true about Linked List data structure when it is compared with an array?

• Arrays have better cache locality that can make them better in terms of performance

• It is easy to insert and delete elements in Linked List

• Random access is not allowed in a typical implementation of Linked Lists

• Access of elements in linked list takes less time than compared to arrays

What would be the asymptotic time complexity to find an element in the linked list?

• O(1)

• O(n)

• O(n²)

• O(n⁴)

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 the primary advantage of a Circular Linked List over a Simple Linked List? 

• It uses less memory 

• It allows for O(1) insertions at the end of the list 

• It allows us to traverse the whole list starting from any node 

• It does not require a sentinel node 

In which of the following scenarios is a Doubly Linked List most useful? 

• When we need to frequently add new elements 

• When we need to frequently delete elements 

• When we need to frequently traverse the list in both directions 

• When we need to frequently perform a binary search