Divide and Conquer: GATE CS previous year questions (Algorithms)

GATE CS 2026 Set 2NAT1 markEasy (estimate)
GATE CS 2026 Set 2, Q.32
Consider an array $A = [10, 7, 8, 19, 41, 35, 25, 31]$ . Suppose the merge sort algorithm is executed on array $A$ to sort it in increasing order. The merge sort algorithm will c...
Divide and Conquer
GATE CS 2025 Set 2MCQ2 marksMedium (estimate)
GATE CS 2025 Set 2, Q.41
An array $A$ of length $n$ with distinct elements is said to be bitonic if there is an index $1 \leq i \leq n$ such that $A [1.. i]$ is sorted in the non-decreasing order and…
Searching and Sorting Algorithms · Divide and Conquer
GATE CS 2021 Set 2MCQ1 markEasy (estimate)
GATE CS 2021 Set 2, Q.18 (CS Q.8)
What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size $n$ ?
Divide and Conquer
GATE CS 2019NAT1 markEasy (estimate)
GATE CS 2019, Q.35 (CS Q.25)
Consider a sequence of 14 elements: $A = [- 5, - 10, 6, 3, - 1, - 2, 13, 4, - 9, - 1, 4, 12, - 3, 0]$ . The subsequence sum $S (i, j) = \sum_{k = i}^{j} A [k]$ . Determine the maximum of…
Divide and Conquer
GATE CS 2019MCQ2 marksMedium (estimate)
GATE CS 2019, Q.47 (CS Q.37)
There are $n$ unsorted arrays: $A_{1}, A_{2}, \dots, A_{n}$ . Assume that $n$ is odd. Each of $A_{1}, A_{2}, \dots, A_{n}$ contains $n$ distinct elements. There are no common elements betwee...
Divide and Conquer
GATE CS 2017 Set 1MCQ1 markEasy (estimate)
GATE CS 2017 Set 1, Q.5 (CS Q.5)
Consider the following table: Algorithm Design Paradigm (P) Kruskal (i) Divide and Conquer (Q) Quicksort (ii) Greedy (R) Floyd-Warshall (iii) Dynamic Programming Match the algor...
Greedy Algorithms · Dynamic Programming · Divide and Conquer
GATE CS 2012MCQ1 markEasy (estimate)
GATE CS 2012, Q.16 (CS Q.16)
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with $n$ discs is
Divide and Conquer · Asymptotic Analysis and Time/Space Complexity

Questions

GATE CS 2026 Set 2, Q.32

GATE CS 2025 Set 2, Q.41

GATE CS 2021 Set 2, Q.18 (CS Q.8)

GATE CS 2019, Q.35 (CS Q.25)

GATE CS 2019, Q.47 (CS Q.37)

GATE CS 2017 Set 1, Q.5 (CS Q.5)

GATE CS 2012, Q.16 (CS Q.16)

Other topics of Algorithms