Data Structures and Algorithms - Performance Analysis of Algorithms and Recurrences
- Option : C
- Explanation : We use merge sorting and finally we get comparison O (m + n)
You must be logged in to post a comment.
- Option : B
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
- Option : B
- Explanation : Time complexty is O (nlogn) C * 64 log 64 = 30 (C = 5/14) for 6 minuts 5/64 * n log n 6 * 60 ⇒ [n = 512]
You must be logged in to post a comment.
You must be logged in to post a comment.
119. Match the pairs in the following:
| List-I | List-II | ||
| A. | Straseen's matrix multiplication algorithm | P. | Greedymethod |
| B. | Kruskal's minimum spanning tree algorithm | Q. | Dynamic programming |
| C. | Biconnected components algorithm | R. | Divide and Conquer |
| D. | Floyd's shortest path algorithm | S. | Depth first search |
- Option : A
- Explanation : A – R, B–P, C–S, D–Q
You must be logged in to post a comment.
You must be logged in to post a comment.
120. The minimum number of comparisons required to sort 5 elements is
- Option : A
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.