Scribd
Upload
111 views2 pages

Al CD 402 Analysis and Design of Algorithm Jun 2022

Uploaded by

omh4453
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
111 views2 pages

Al CD 402 Analysis and Design of Algorithm Jun 2022

Uploaded by

omh4453
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
Tal No.of Questions: 8] (Real No.of Printed Pages : 4 Roll No AL/CD-402 (GS) B.Tech. IV Semester Examination, une 2022 Grading System (GS) Analysis and Design of Algorithm Time : Three Hours “Maximum Marks : 70 Note: i) Answer any ive questions. ra le et a ear {i)_Allquestions carry equal marks, wh ea bs Sw th iif) In case of any doubt or dispute the English version ‘question shouldbe treated 35 fina ‘ef aes i ear are FR A TT Se mee sy Ser TT TT 1.) Explain the various criteria used for analyzing algorithm. 7 atten aor Recen awe & fe eT ar TES rear a1 ') What is merge sort? Explain merge sort algorithm for the list: 65, 47, 24, 83, 91, 14, 53, 12 7 sack ae wen 87 Preah 3 fe ot SE oes Maren mi 65,47, 24, 83, 91, 14, 53, 12 ‘Auicp-402 (63) 2 22 8) Write the algorithm for Stase's matrix multiplication, 7 bara Bs Aare or & fre cee Fr 1) Define Kruskal’ algoritim and also write dow the steps forthe Kruskal’ algorithm in detail 7 Keruskals eonReut a afer SAR Kruskal’s Core ap wrott at oh Para @ Pa 3, 5) Explain bow job sequencing with deadline can be solved sing deadlines. 7 acrgy fe Secret & rer ate eet at FBsoTIET BT saealir arate get FT TEL 1») Explain minimum spanaing wee using Prim‘s algorithm forthe given gaph below. 7 ‘ga ere Cee a RBS ECHL eaftn ft At aren wr 4, Explain Floyd. Warshall algorithm with suitable example. 14 wigan rhe a oH TTT BF WEL THAT 5. 8) Find optimal solution for 0/1 Knapsack problem (¥;, 3. 10, 10, 12, 18); Py, Pys Py, PQ) 4, 6,0) 7 (7 Knapsack problema & fre ¥eer ATA GH (6) =(10, 10,12, 18) Py Py PDC 6,0) and M = 15. 0 eee AcD-402 (65) on Gy oy &) Explain in detail 8-Queens problem, 7 ee a tee Fea eh 8 + Queens 6 ea FT 8 TRH 3) met ad 6. 8) Write about diferent types of bounding functions with io example 7 1) Bethe RRR same erat carry By ak A serETT TY 2 hehe ree 2) ts ate 1) Find the optimal solution using least cost branch and bound with n=4,m= 15, 7 (pW Wy = G,5,6,9}: P,P» PyPY~ CS 15,17, 23) Be eon ere arefh eaT ar UHM a UT TUT GN athe n= 4, m= 1535 are ae a 5,6, PPP 5,15,17,23) (oy Wap 0 7. Discuss in detail P, NP, NP complete and NP Hard problems ‘with examples. 14 ‘eT ar FTES P, NP, NP the NP TR 3 aR a were 8, Write short notes on any three ofthe following. 4 8) Binary search trees b) Huffman coding ©) Multistage graph 4) Hamiltonian cycle ©) Quick sor. AuicD.402 (a8) ‘AucD-402 (65) Pro,

You might also like