Question
Use Prim's algorithm to construct a minimum spanning tree for the following graph. (use starting node A).
Discuss the relationship between class P, NP, NP complete and NP Hard problems with suitable example of each class.
Write a recursive function in C language to calculate the sum of all digits in a long integer provided as input.
Show stepwise sorting of elements using Heapsort algorithm to the following max heap
.
Use Prim's algorithm to construct a minimum spanning tree for the following graph. (use starting node A).
Define fractional Knap-Sack problem, and give a greedy algorithm to solve this problem efficiently
Solve the following recurrence equations:
(i) T(n) = 2T(n/2) + 0(n)
(ii) T(n) = T(n - 1) + 0(n)
Give an algorithm for topological sort. Obtain a topological ordering for the following graph:
IGNOU Doubts & Queries
Click to Contact Us
Call - 9199852182 Call - 9852900088 myabhasolutions@gmail.com WhatsApp - 9852900088