1. Dijkstra's Algorithm is used to solve a) All pair shortest path b) Single source shortest path c) Network flow d) Sorting

2. For merging two sorted lists of sizes m and n, into a sorted list of size m+n, the number of comparisons required is:

a. (log m + log n)

b. (m)

c. (m+n)

b. O(n)

Sol88:

1. Dijkstra's Algorithm is used to solve the single source shortest path problem. The algorithm is designed to find the shortest path from a single source vertex to all other vertices in a weighted graph. It is a popular algorithm used in many applications such as routing protocols in computer networks, transportation networks, and maps applications.

2. The number of comparisons required to merge two sorted lists of sizes m and n into a sorted list of size m+n is O(m+n). This is because we need to compare the elements of both lists in order to determine their relative order and merge them into a single sorted list. The worst-case scenario occurs when both lists are sorted in reverse order, and in that case, the total number of comparisons required is (m+n-1). The option (c) correctly represents the time complexity of the merging process. Options (a) and (b) are incorrect because they do not take into account the size of both lists and option (d) is incorrect because it is less than the actual number of comparisons required.