Test Index

TCS Placement Model Test 8

© examsnet.com

Question : 39

Total: 40

Direction: Mark the best option
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_________

Your Answer:

Go to Question:

Prev Question

Next Question