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:______

25 | |

12 | |

29 | |

17 |

Question 1 Explanation:

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.

Match the above algorithms on the left to the corresponding design paradigm they follow.

1-i, 2-iii, 3-i, 4-v. | |

1-iii, 2-iii, 3-i, 4-v | |

1-iii, 2-ii, 3-i, 4-iv | |

1-iii, 2-ii, 3-i, 4-v. |

Question 2 Explanation:

Question 3 |

Match the following:

P-iii, Q-ii, R-iv, S-i | |

P-i, Q-ii, R-iv, S-iii | |

P-ii, Q-iii, R-iv, S-i | |

P-ii, Q-i, R-iii, S-iv |

Question 3 Explanation:

Question 4 |

The minimum number of comparisons required to find the minimum and the maximum of
100 numbers is _________________.

100 | |

99 | |

198 | |

148 |

Question 4 Explanation:

Question 5 |

If n is a power of 2, then the minimum number of multiplications needed to compute a^n is

\log_2 n | |

\sqrt n | |

n-1 | |

n |

Question 5 Explanation:

There are 5 questions to complete.

Only 5 problems from Divide and conquer?

Dear rishabh tripathi,

Actually Merge and Quick sort related problems are included in sorting topic.

https://www.practicepaper.in/gate-cse/sorting