Divide and Conquer


Question 1
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 S(i,j), where 0 \leq i \leq j \lt 14. (Divide and conquer approach may be used). Answer:______
A
25
B
12
C
29
D
17
GATE CSE 2019   Algorithm
Question 2
Given below are some algorithms, and some algorithm design paradigms.

Match the above algorithms on the left to the corresponding design paradigm they follow.
A
1-i, 2-iii, 3-i, 4-v.
B
1-iii, 2-iii, 3-i, 4-v
C
1-iii, 2-ii, 3-i, 4-iv
D
1-iii, 2-ii, 3-i, 4-v.
GATE CSE 2015 SET-2   Algorithm


Question 3
Match the following:
A
P-iii, Q-ii, R-iv, S-i
B
P-i, Q-ii, R-iv, S-iii
C
P-ii, Q-iii, R-iv, S-i
D
P-ii, Q-i, R-iii, S-iv
GATE CSE 2015 SET-1   Algorithm
Question 4
The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is _________________.
A
100
B
99
C
198
D
148
GATE CSE 2014 SET-1   Algorithm
Question 5
If n is a power of 2, then the minimum number of multiplications needed to compute a^n is
A
\log_2 n
B
\sqrt n
C
n-1
D
n
GATE CSE 1999   Algorithm


There are 5 questions to complete.

Leave a Comment