GATE CS 2019 (Forenoon) — Question 35

AlgorithmsDivide-and-Conquer DesignsNAT1 markHard

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 \le i \le j < 14 \). (Divide and conquer approach may be used.)
Practise the full 2019-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
Practise more on Divide-and-Conquer DesignsTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group