Gate CS-2014-2 Question Paper With Solutions

Q. 48 Suppose P, Q, R, S, T are sorted sequences having lengths 20, 24, 30, 35, 50
respectively. They are to be merged into a single sequence by merging together
two sequences at a time. The number of comparisons that will be needed in the
worst case by the optimal algorithm for doing this is ____.

(A) 358

(B) 438

(C) 568

(D) 664

Answer: (A)

Explanation:

Gate CS-2014-2 Question Paper With Solutions

Learn More:   Gate ME-2019-1 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here