FUNDAMENTALS OF ALGORITHMS - UNIT 3 MCQS

What is a priority queue and how does it differ from a regular queue?

• A priority queue serves elements in LIFO order.

• A priority queue is a type of stack that serves elements based on their size.

• A priority queue serves elements based on priority, while a regular queue serves elements in FIFO order.

• A priority queue does not have any specific order for serving elements.

Explain the structure of a binary heap.

• A binary heap is a type of graph that can have cycles.

• A binary heap is an unordered collection of elements stored in a list.

• A binary heap is a complete binary tree that satisfies the heap property, either as a max-heap or min-heap.

• A binary heap is a linear data structure that allows for efficient searching.

What is the time complexity of heap sort in the average case?

• O(log n)

• O(n log n)

• O(n)

• O(n^2)

Describe the merge sort algorithm and its time complexity.

• Merge sort requires more space than quicksort.

• The time complexity of merge sort is O(n^2).

• Merge sort is a linear sorting algorithm.

• The time complexity of merge sort is O(n log n), where n is the number of elements in the array.

How does quick sort choose a pivot element?

• Quick sort chooses a pivot element by selecting the first, last, random, or median element.

• Quick sort always picks the middle element as the pivot.

• Quick sort selects the pivot as the average of all elements.

• Quick sort chooses a pivot element based on the largest element in the array.

What is the worst-case time complexity of quick sort?

• O(log n)

• O(n log n)

• O(n)

• O(n^2)

Explain how binary search works and its time complexity.

• Binary search works by checking every element in the array sequentially.

• The time complexity of binary search is O(log n).

• The time complexity of binary search is O(n).

• Binary search can only be applied to unsorted arrays.

What are the conditions for binary search to be applicable?

• The data must be sorted and allow random access.

• The search must be performed on a single element at a time.

• The data must be in a linked list format.

• The data can be unsorted and must be accessed sequentially.

How can you find the maximum element in a binary heap?

• You can find the maximum element by traversing all nodes.

• The maximum element is located in the left subtree of the binary heap.

• The maximum element is at the root of the binary heap.

• The maximum element is at the last leaf of the binary heap.

What is the process to find the minimum element in a binary search tree?

• The minimum element is the root of the binary search tree.

• The minimum element is found at the leftmost node of the binary search tree.

• The minimum element is found at the rightmost node of the binary search tree.

• The minimum element can be found by traversing the tree in a pre-order manner.