Question: Q 1 . Find the topological sorting problem for the given graph A and B . Q 2 . Apply Merge sort and Quick to

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

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 Databases Questions!