GATE CS 2014 Set 2 – Question 38

Numerical answer 2 marks Question 38 2014

Question 38

NAT 2 marks · no negative Algorithms

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

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2014 Algorithms

Source: GATE 2014 Computer Science and Information Technology, Set 2, Q38 (set and question number approximate)

All Algorithms questions