The GATE Grind

GATE Algorithms: Divide-and-Conquer – Previous Year Questions

3 GATE previous year questions on Divide-and-Conquer (Algorithms, Computer Science) with answers and explanations, from every paper.

  1. GATE 2019 CS Q35 (1 mark, Numerical answer) – 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)= k=ijA[k]. Determine the maximum of S(i,j),…
  2. GATE 2026 CS (CS2) Q32 (1 mark, Numerical answer) – Consider an array A=[10,7,8,19,41,35,25,31]. Suppose merge sort is executed on A to sort it in increasing order. The algorithm will carry out a total…
  3. GATE 2021 CS Q12 (1 mark, Multiple choice) – Let P be an array containing n integers. Let t be the lowest upper bound on the number of comparisons of the array elements, required to find the…