Data Structures and Algorithms

Which of the following is true about Binary Search?

• It works only on sorted arrays.

• It works on both sorted and unsorted arrays.

• It requires an additional data structure to operate.

• It is faster than linear search for all datasets.

What is the time complexity of the worst-case scenario for Linear Search?

Which sorting algorithm is best suited for nearly sorted data?

• Bubble Sort

• Insertion Sort

• Both

• None

What does swapping two elements during Bubble Sort achieve?

• places the largest element in its correct position.

• It finds the median of the array.

• It guarantees the array is sorted.

• It splits the array into two halves.

Which of the following is true for a Queue?

• None

• Both

• It is a LILO structure.

• It is a FIFO structure.

What happens if we try to dequeue an element from an empty queue?

• It raises an error.

• It returns null.

• It proceeds with a default value.

• It returns the first element added.

Which of the following is NOT required for Binary Search?

• All elements in the array must be distinct.

• The array must be sorted.

• A middle element must be calculated.

• Recursive calls or iterations are used.

In Linear Search, what is the best-case scenario?

• Target element is at the first position.

• Target element is not in the array.

• Target element is at the last position.

• Array is empty.

What is the primary disadvantage of Bubble Sort?

What is the time complexity to insert a node at the head of a singly linked list?