Question
Show stepwise sorting of elements using Heapsort algorithm to the following max heap
.
Solve the following recurrence equations:
(i) T(n) = 2T(n/2) + 0(n)
(ii) T(n) = T(n - 1) + 0(n)
Define ambiguity in Context-Free Grammar (CFG). Prove that the following grammar is ambiguous.
Use Prim's algorithm to construct a minimum spanning tree for the following graph. (use starting node A).
Write a Turing machine to recognize the language of all strings of even length over the alphabet {a, b}.
For a problem P, two algorithms A and B have time complexities T1(n) = 5n2 and T2 (n) = 100nlogn respectively. Find the range for n, the size of instance of the given problem P, for which A is more efficient than B.
Show stepwise sorting of elements using Heapsort algorithm to the following max heap
.
Discuss the relationship between class P, NP, NP complete and NP Hard problems with suitable example of each class.
IGNOU Doubts & Queries
Click to Contact Us
Call - 9199852182 Call - 9852900088 myabhasolutions@gmail.com WhatsApp - 9852900088