Give an algorithm for topological sort. Obtain a topological ordering for the following graph:

Write a recursive function in C language to calculate the sum of all digits in a long integer provided as input.

Define ambiguity in Context-Free Grammar (CFG). Prove that the following grammar is ambiguous.

Show stepwise sorting of elements using Heapsort algorithm to the following max heap

.

Give an algorithm for topological sort. Obtain a topological ordering for the following graph:

Solve the following recurrence equations:
(i) T(n) = 2T(n/2) + 0(n)
(ii) T(n) = T(n - 1) + 0(n)

Define fractional Knap-Sack problem, and give a greedy algorithm to solve this problem efficiently

Use Prim's algorithm to construct a minimum spanning tree for the following graph. (use starting node A).