Data Structures

1: For merging two sorted lists of sizes m and n into a sorted list of size m + n, we require comparisons of

A.	O(m)
B.	O(n)
C.	O(m+n)
D.	O(log(m) + log(n))
	Answer : C Explanation : Each comparison will append one item to the existing merge list. In the worst case one needs m + n - 1 comparisons which is of order m+n. Write your comments here: Updating your Comments.. Updating your Comments.. Report Error
	Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.

UGC NET Paper 1 UGC NET Computer Science UGC NET Exam GATE Exam Aptitude Viva Questions General Knowledge Computer Questions Online Test

Suggest an improvement