Solve the following recurrence relation using recursion tree method: T(n) = 2T(n/2) + n T(1) = O(1)
Show the following recurrence relation using Master's theorem: T(n) = 2T(n/2) + n log n
Find the number of comparisons made by the sequential search for the worst and best case.
Apply Quick sort on the array given below: 15, 31, 1, 9, 80, 12, 14, 7, 24
List various problems that can be solved using the Greedy algorithm approach.
Write Kruskal's algorithm to find MST for a given graph. Also discuss about its time complexity.
Write Dijkstra's Algorithm for the solution of single source shortest path problem.
Explain fractional Knapsack problem in detail.
What is 0/1 Knapsack problem? Is Greedy method effective to solve 0/1 Knapsack problem.
Is there anything common between dynamic programming and divide and conquer? What is the main difference between the two?
Obtain any two solutions to 4-queens problem. Establish the relationship between them.
Construct the minimum spanning tree for the given graph using Kruskal's Algorithm: (graph image with vertices 1-7 and weights)
Write an algorithm for the implementation of binary search method.
Solve the following instance of Knapsack problem by using the branch and bound technique: Items | W | P I1 | 9 | 15 I2 | 6 | 6 I3 | 7 | 5 I4 | 2 | 1 W=16
Explain the class NP-complete with example.
There are 8, 15, 13 and 14 number of nodes in 4 different trees. Which of them could have formed a Full Binary Tree?
