Scribd
Upload
15 views2 pages

Jul 2023

Uploaded by

Arun Auto2024
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
15 views2 pages

Jul 2023

Uploaded by

Arun Auto2024
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
Save trees use e-Question Paper DOWNLOAD THIS FREE AT ww | TE | ime: 3 hrs. 20 b aoa b. Hu b. b. Je: Answer any FIVE full questions, choosing ONE full question from each m Module-1, Explain the algorithm design and analysis proves in detail Explain the asymprotie natrations with example. Explain the concept of Divide and Conquer. W search on the list of elements Apply Quick sont algorithm to sort he i x Draw the ree of tacursive calls made 4 o Develop a recursive agorithn tof gage and maximum element from the Ist Detine Topological sorting, Lust Ae GB lows sorting for he following srap han example. Go green www.vturesource.com GRCS SonaME | = © Fourth Semester B.E. Degree Examination, June/July 20: Design & Analysis of Algorithms “OC He. M (ao stasis) atari OR Eyplain the general plan of mathematical analysis of ity with example. QU Marks) Design an algorithm to search an clement in an stray tial search. Discuss the est-case, worst-case and average-case effcioncy of ih ao Marks) 1 algorithm to perform Binary (QW Marks) PLR,O.G.R, AM. MLN. G ao Mars) Ae a | %© ae) Vig. 4) ick problem where a= 4, m orithmy to find single soures shortest path for the 2 RIO a 4 go ee NO Tig. 050) BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiative Save trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.viuresource.com 2iesaz on 6 4. Constuet a Hurfinan Tre and resulting code word forthe following aa fe [> | [Protabitiy [4 fot PozTo.13TOAS Encode tie ext ABACADAD ankl Decode the text 10001011 1001010. 1. Write Ci+¥Java program to find nsinimum cost spanning tre ofa given cong using Kruskal’ algorithm. Use Union-Find algorithms in your program (a0 sta Modute-t 7a. Finds minimum-cost path from S to Ti te given multistage graph ae BQ - ° Fie Q7 0) (0 Mars) 1. Write Floyd's algorithm and apply the sare 1 trace ghe TOMyyine eraph 0 Marts 8 8. Write Horspoot’s algorithm fr lr ing, Find the pattems BARBER, tn te text JIM_SANW_ME_IN_A BARBI Ge mart Write 8 Cava programgamaaive giighhapsack problem using Dynamic programy method ‘Go Marks lodute-s 9 u. Diffreniate betweg face and Branch and Bound technique. Apply back tacking to solve the Followlytance ofthe subsct-sum prablem :S= {1.2,3,6,8).d~9 Go Mans b. Solve the follow AgsigNRr problem using branch and bound mod (oman [ob |Job 2 Job 3 [sob | ov [2 tLe a Tpesona| 7 {ot ota ‘OR 0a 1 following with examples problems (i) NP problems Gi) NP-complete problems x) _NP-lard problems se star Design and sinplement C#=/Javaprogran 10 find all Hamitonian eyeles in a const ind Bred praph G of n vertices using back tracking principle 20f2 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Vturesource Go Green initiative

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy