Question: Find the topological sorting problem for the given graph A and B. B (2 Mark) F E H Q2. Apply Merge sort and Quick

 Find the topological sorting problem for the given graph A and B.   

Find the topological sorting problem for the given graph A and B. B (2 Mark) F E H Q2. Apply Merge sort and Quick to sort the list, K, E, Y, B, O, A,R,D in alphabetical order. (2 Mark) Q3. Explain Master Theorem .Using Master Theorem solved the following recurrence. relation (2 Mark) a) T(n) 9T(3n/4)+ n b) T(n) 4T(n/16)+1 Q4. Write the Recursive algorithm for Binary search .Consruct the recurrence relation for recursive algorithm and solve using bachward Subtution. (2 Mark) Q5. Evaluate the polynomial f(x) = 100x5 + 30x4-2x3 +3x+4x- 10, for x=-4, using Horner Rule. (2 Mark)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!