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

GATE 2014 CSE & IT PYQ — Algorithms

GATE 2014Set 2PYQNATanswer pendingexplanation soonmedium

Algorithms · Greedy Algorithms

Concept intelligence

Jump into a concept drill from this question.

Official answer key is not available for this question yet.

Studying seriously for GATE CSE?

Keep browsing free. Pro unlocks the paid study loop: explanations, topic mastery, mistake notebook, and custom PYQ drills.

Recurring concept

Greedy Algorithms has appeared in GATE CSE & IT 4 times across 3 years (2007, 2014, 2021).