Data Structures and Algorithms Quiz

Which of the following is true about binary search?

• A) It works on both sorted and unsorted arrays

• B) It requires the array to be sorted

• C) It is slower than linear search for large inputs

• D) It does not use recursion

What is the best case scenario for binary search?

• A) When the target element is in the last position

• B) When the target element is in the middle position

• C) When the array is unsorted

• D) When the target element is not found

Which search algorithm works well for small and unsorted datasets?

• A) Linear Search

• B) Binary Search

• C) Both A and B

• D) None of the above

If an array has 1000 elements, how many elements does linear search check in the worst case?

• A) 10

• B) 100

• C) 500

• D) 1000

Which search algorithm can work efficiently on linked lists?

• A) Binary Search

• B) Linear Search

• C) Both A and B

• D) None of the above

Which operation is performed at the top of a stack?

• A) Push

• B) Pop

• C) Both A and B

• D) Peek

Stacks follow which order of element access?

• A) FIFO

• B) LIFO

• C) Random

• D) Circular

Which of the following is not an application of stacks?

• A) Function call management

• B) Undo operations

• C) Memory allocation

• D) CPU scheduling

Which data structure uses the concept of “First In, First Out (FIFO)”?

• A) Stack

• B) Queue

• C) Deque

• D) Tree

In a circular queue, if front = 3 and rear = 6 in a size-7 queue, where will the next insertion happen?

• A) Index 4

• B) Index 6

• C) Index 0

• D) Index 7