Gate CS-2019 Question Paper With Solutions

Q. 34 Consider a sequence of 14 elements: A = [-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]. The subsequence sum Gate CS-2019 Question Paper With Solutions. Determine the maximum of S(i,j), where 0 ≤ i ≤ j < 14. (Divide and conquer approach may be used)
Note: This was Numerical Type question.

(A) 29

(B) 19

(C) 39

(D) 09

Answer: (A)

Explanation:

Gate CS-2019 Question Paper With Solutions

Learn More:   Gate EE-2003 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here