Searching and Sorting Algorithms Quiz

Which of the following best describes the bubble sort algorithm?

• It repeatedly selects the smallest element and swaps it with the first unsorted element.

• It repeatedly compares adjacent elements and swaps them if they are in the wrong order.

• It divides the array into two halves, sorts them, and then merges them.

• It builds a heap from the input data and then sorts it.

In a stack, which operation is used to add an element to the top?

• Enqueue

• Dequeue

• Push

• Pop

What is the main characteristic of a queue data structure?

• Last In, First Out (LIFO)

• First In, First Out (FIFO)

• Random Access

• Hierarchical Order

Which of the following is true about the linear search algorithm?

• It requires the array to be sorted.

• It can be applied to both sorted and unsorted arrays.

• It is faster than binary search for large datasets.

• It uses a divide and conquer approach.

Which of the following operations is not applicable to a stack?

• Push

• Pop

• Peek

• Enqueue

In a queue, which operation is used to remove an element from the front?

• Push

• Pop

• Enqueue

• Dequeue

Which of the following is a disadvantage of the bubble sort algorithm?

• It is difficult to implement.

• It has a high time complexity for large datasets.

• It requires additional space for sorting.

• It cannot sort negative numbers.

What is the result of performing a pop operation on an empty stack?

• The stack remains unchanged.

• The operation returns a null value.

• An underflow error occurs.

• A new element is added to the stack.

Which data structure is used to implement recursion?

• Queue

• Stack

• Array

• Linked List

Which of the following is not a characteristic of a queue?

• It follows the FIFO principle.

• It allows insertion at the rear.

• It allows deletion from the front.

• It allows random access to elements.