GATE 2025 Algorithm Evaluation Quiz 2

The time required to execute the following fragment of code is _______.

Which of the following problems cannot be solved using Dynamic Programming?

Suppose an input set of size n is applied Quick Sort and partition always produces 9 to 1 split. Find the time complexity of such organization of data.

Consider the following max-heap which is stored in the array.
55, 48, 51, 25, 18, 35, 24, 8, 19
Which of the following represent the max heap after one deletion?

In Quicksort for sorting n element, Partition algorithm 10^th smallest element selected with O(n) is selected always, what is the time complexity of that case?