Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

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)
image text in transcribed

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Inductive Databases And Constraint Based Data Mining

Authors: Saso Dzeroski ,Bart Goethals ,Pance Panov

2010th Edition

ISBN: 1489982175, 978-1489982179

More Books

Students also viewed these Databases questions

Question

love of humour, often as a device to lighten the occasion;

Answered: 1 week ago

Question

orderliness, patience and seeing a task through;

Answered: 1 week ago

Question

well defined status and roles (class distinctions);

Answered: 1 week ago