Quiz for algorithms

What will be the output of the following binary search function?

• 3

• 7

• 2

• -1

Binary search is only applicable when:

• 1. The list is sorted 

• The list contains only integers

• 1. The list has an odd number of elements

• 1. The elements are unique

What is the average-case time complexity of binary search?

• 1. O(n)

• 1. O(n log n)

• O(1)

• O(log n)

Which sorting algorithm is the most efficient for sorting large datasets? 

• Bubble Sort

• 1. Selection Sort

• 1. Quick Sort 

• 1. Insertion Sort

Which sorting algorithm works by selecting the smallest element and swapping it with the first unsorted element?  

• 1. Bubble Sort

• Quick Sort

• Merge Sort

• 1. Selection Sort 

What is the primary advantage of Merge Sort over Quick Sort?

• 1. Merge Sort is always faster

• 1. Merge Sort does not use recursion

• 1. Merge Sort is stable 

• 1. Merge Sort is in-place

What is the order of elements removed in a queue?

• 1. LIFO

• 1. FIFO 

• 1. Random

• 1. Sorted Order

What is the time complexity of inserting an element in a circular queue using an array?

• O(1)

• 1. O(n)

• 1. O(log n)

• 1. O(n²)

Which data structure follows the Last-In-First-Out (LIFO) principle?

• 1. Queue

• 1. Stack 

• 1. Linked List

• 1. Heap

In which scenario is linear search preferred over binary search?

• 1. When the list is large and unsorted 

• 1. When the list is sorted

• 1. When the list contains unique elements

• 1. When the list is small