Question: Q 1 . Find the topological sorting problem for the given graph A and B . Q 2 . Apply Merge sort and Quick to
Q Find the topological sorting problem for the given graph A and
Q Apply Merge sort and Quick to sort the list, in alphabetical
order.
Mark
Q Explain Master Theorem Using Master Theorem solved the following recurrence.
Mark
relation
g
h
Q Write the Recursive algorithm for Binary search Consruct the recurrence relation for
recursive algorithm and solve using bachward Subtution.
Q Evaluate the polynomial for using Horner
Rule.
Mark
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
