Unit V DSA Quiz

What is the time complexity of linear search in the worst case?

• O(1)

• O(log n)

• O(n)

• O(n log n)

Which search algorithm works efficiently on sorted arrays?

• Linear search

• Binary search

• Hashing

• Jump search

What is the time complexity of binary search in the worst case?

• O(n)

• O(log n)

• O(n log n)

• O(1)

What is a necessary condition for binary search to work?

• Unsorted list

• Sorted list

• Circular array

• Linked list

In linear search, the average number of comparisons is:

• n

• n/2

• log n

• 1

Which of the following is a comparison-based sorting algorithm?

• Radix sort

• Counting sort

• Bubble sort

• Bucket sort

Bubble sort repeatedly compares:

• Current element with the first

• Adjacent elements

• All elements with the last

• Even indexed elements

What is the best-case time complexity of Bubble Sort?

• O(n log n)

• O(n²)

• O(log n)

• O(n)

Selection sort selects:

• Maximum element for each pass

• Minimum element and places it at the beginning

• Random elements

• Adjacent elements

Insertion sort is efficient for:

• Large arrays

• Reverse sorted arrays

• Nearly sorted arrays

• Unsorted large datasets