23 views

Uploaded by sivabharathamurthy

qp

- Question Bank Format
- Midterm Sol
- Proofs Trees
- Decoupling IPv4 from Sensor Networks in Gigabit Switches
- Ds 1-Basic Data Structure
- QnA
- C04.AlgorithmAnalysis
- Data Structure Lecture 2
- Lect3 Sums and Loops
- Motivation
- A Smooth Tour Construction Approach for a Mobile Robot With Kinematic Constraints
- Tips for Writing Technical Papers
- Nils Schweer- Algorithms for Packing Problems
- AaDS - W01b Foundations.pdf
- GA_App
- Data Structures Final
- factoring polynomials 1 1
- Trees
- Prim Kruskal algo
- Harish Chandran, Nikhil Gopalkrishnan and John Reif- The Tile Complexity of Linear Assemblies

You are on page 1of 4

1

(Common to CSS, IT and CSE)

B.Tech II Year II Semester (R09) Regular & Supplementary Examinations, April/May 2013 DESIGN AND ANALYSIS OF ALGORITHMS Time: 3 hours Answer any FIVE questions All questions carry equal marks

*****

Max Marks: 70

Give brief description about performance measurement. Write an algorithm to implement magic square. Define collapsing rule. Write the algorithm for COLLAPSING FIND by using COLLAPSING RULE. Draw the different trees for the following sets S1 = {1, 7, 8, 9}, S2 = {2, 5, 10}, S3 = {3, 4, 6} with root nodes as 1, 5 and 3. Draw the tree calls of the function merge for the following set of elements: (5, 80, 30, 20, 50, 10, 70, 60, 40, 90). Sort the above set of elements by using merge sort. With the help of a suitable example, explain the greedy knapsack. Find the shortest path b/w all pairs of nodes in the following graph.

3 (a) (b) 4 5

6 (a) (b) 7

Explain how the solution to the backtracking problems is represented. And how it is built. Give the explicit and implicit constraints in 8-queens problem. Solve the traveling sales man problem for the following graph by using branch and bound.

*****

Code: 9A05403

2

(Common to CSS, IT and CSE)

B.Tech II Year II Semester (R09) Regular & Supplementary Examinations, April/May 2013 DESIGN AND ANALYSIS OF ALGORITHMS Time: 3 hours Answer any FIVE questions All questions carry equal marks

*****

Max Marks: 70

Explain the different areas of research where the algorithms can be applied. Explain how to identify the repeated elements. Explain the scheme to construct bi-connected graph. What is articulation point? Explain with example. Write an algorithm to sort N numbers in ascending order using merge sort. Compute the time complexity for merge sort. Present a greedy algorithm for sequencing unit time jobs with deadlines and profits. Present an optimal randomized algorithm for minimum cost spanning trees. Find the optimal sequence by using traveling sales person for the following given instance.

6 (a)

Write the implementation of the above algorithm. Write FIFOBB algorithm for the 0/1 knapsack problem. Explain the general method of branch and bound.

P Prove that if X NP y is NP-hard, then X T Y . In other words, NP-hard problems

are at least as hard as any problems in NP. Prove that any two NP-complete problems are polynomially turning equivalent.

*****

Code: 9A05403

3

(Common to CSS, IT and CSE)

B.Tech II Year II Semester (R09) Regular & Supplementary Examinations, April/May 2013 DESIGN AND ANALYSIS OF ALGORITHMS Time: 3 hours Answer any FIVE questions All questions carry equal marks

*****

Max Marks: 70

Write Miller-Rabins primality testing algorithm. Discuss the different approaches to find the time complexity of algorithm. Give the trees for the set {1, 2, 3, 4, 5, n} by using weighting rule. Give an algorithm for implementation of union instruction using linked list and explain its implementation. Derive the time complexity for strassens matrix multiplication. How many additions, multiplications and subtractions are needed for a 2 x 2 matrix multiplication? Write a detailed note on job sequencing with deadlines. Explain in detail about the optimal randomized algorithm for minimum cost spanning trees. How would you construct an optimal binary search tree for a set of n keys if all the keys are equally likely to be searched for? What will be the average number of comparisons in the tree if n = 2k? Write a pseudo code of the bottom-up dynamic programming algorithm for the knapsack problem. Generate all permutations of {1, 2, 3, 4} by backtracking. Apply backtracking to solve the 3-coloring problem for the graph of.

3 (a) (b)

4 (a) (b)

5 (a)

(b)

6 (a) (b)

7 (a) (b) 8

Explain how the traveling salesperson problem is solved by using LC branch and bound. Write the general algorithm for branch and bound. Give a dynamic programming solution for the subset sum problem. Analyze the asymptotic order of your solution. Explain why this solution does not put the subset sum problem in NP-hard.

*****

Code: 9A05403

4

(Common to CSS, IT and CSE)

*****

Max Marks: 70

Define an algorithm. Explain the different criteria that satisfy the algorithm. Briefly explain about asymptotic notations. Explain spanning trees and minimum cost spanning trees with suitable examples. What are the advantages of Strassens matrix multiplication over normal one? Present an algorithm for quick sort by using iterative method. Present a general method of greedy technique. Explain the greedy knap sack with suitable example. Solve the following instance of the ALL PAIRS shortest path problem.

(b) 6 7

Discuss how to compute the cost of binary search tree. Draw and explain the tree organization of the 4-queen solution space. Solve the TSP problem for the following graph using branch and bound technique.

Consider the problem DNF-DISSAT which takes a Boolean formula S in disjunctive normal form (DNF) as input and asks if S is dissatisfiable that is variable of S so that if evaluates to 0. Show that DNF-DISSAT is Np- complete.

*****

- Question Bank FormatUploaded byharsha51395
- Midterm SolUploaded byUsama Hameed
- Proofs TreesUploaded byOmar Arenas
- Decoupling IPv4 from Sensor Networks in Gigabit SwitchesUploaded byjose_anderson_5
- Ds 1-Basic Data StructureUploaded bySanjay Kumar Yadav
- QnAUploaded byprperikala9706
- C04.AlgorithmAnalysisUploaded bySameer Husain
- Data Structure Lecture 2Uploaded bySuleman Khan
- Lect3 Sums and LoopsUploaded byTetic
- MotivationUploaded bykarthickklr32
- A Smooth Tour Construction Approach for a Mobile Robot With Kinematic ConstraintsUploaded byAurel GS
- Tips for Writing Technical PapersUploaded byRogerio Santovito
- Nils Schweer- Algorithms for Packing ProblemsUploaded byMnaom
- AaDS - W01b Foundations.pdfUploaded byGustavoMCPRA
- GA_AppUploaded bynhatthang299
- Data Structures FinalUploaded byrocksplit
- factoring polynomials 1 1Uploaded byapi-327028350
- TreesUploaded bymonette
- Prim Kruskal algoUploaded bysonal
- Harish Chandran, Nikhil Gopalkrishnan and John Reif- The Tile Complexity of Linear AssembliesUploaded byGmso3
- 2005-VRPTW Part I- Route Construction and Local Search AlgorithmsUploaded byZubair Ikram
- ch02Uploaded bytheresa.painter
- demolariUploaded byLu Ma
- Lecture 43Uploaded byMian Saeed Rafique
- Metaheuristics_Overview_Blum.pdfUploaded bySamuel Victorino
- UnitIUploaded byசுதாகர் பொ.
- pseudorandomness-Aug10Uploaded bysushmapalimar
- Data Structures and File ProcessingUploaded byapi-3820001
- A Novel Algorithm for Informative Meta Similarity Clusters Using Minimum Spanning TreeUploaded byijcsis
- Bellman, Lee - Functional Equations in Dynamic ProgrammingUploaded byYermakov Vadim Ivanovich

- R7410407 Operating SystemsUploaded bysivabharathamurthy
- 9A05707 Software Project ManagementUploaded bysivabharathamurthy
- telugu-first-language.pdfUploaded bysatya
- 07A4EC01 Environmental StudiesUploaded bysivabharathamurthy
- 9A13701 Robotics and AutomationUploaded bysivabharathamurthy
- ssc Social Textbook (AP)Uploaded bysivabharathamurthy
- R7410506 Mobile ComputingUploaded bysivabharathamurthy
- R7311306 Process ControlUploaded bysivabharathamurthy
- R7312301 Transport Phenomena in BioprocessesUploaded bysivabharathamurthy
- R7311006 Process Control InstrumentationUploaded bysivabharathamurthy
- R7311506 Operating SystemsUploaded bysivabharathamurthy
- R7311205 Distributed DatabasesUploaded bysivabharathamurthy
- R7310506 Design & Analysis of AlgorithmsUploaded bysivabharathamurthy
- R5410201 Neural Networks & Fuzzy LogicUploaded bysivabharathamurthy
- Control Systems (Cs) Notes as Per JntuaUploaded bysivabharathamurthy
- R5310204 Power ElectronicsUploaded bysivabharathamurthy
- 9A02505 Electrical Machines-IIIUploaded bysivabharathamurthy
- 9A14503 Principles of Machine DesignUploaded bysivabharathamurthy
- 9A21506 Mechanisms & Mechanical DesignUploaded bysivabharathamurthy
- 9A03505 Heat TransferUploaded bysivabharathamurthy
- 9A04504 Digital IC ApplicationsUploaded bysivabharathamurthy
- 9A23501 Heat Transfer in BioprocessesUploaded bysivabharathamurthy
- R7310306 Heat TransferUploaded bysivabharathamurthy
- R7310106 Engineering GeologyUploaded bysivabharathamurthy
- R7310406 Digital CommunicationsUploaded bysivabharathamurthy
- R5310406 Digital CommunicationsUploaded bysivabharathamurthy
- 9A05505 Operating SystemsUploaded bysivabharathamurthy
- R7310206 Linear Systems AnalysisUploaded bysivabharathamurthy
- 9A15502 Digital System DesignUploaded bysivabharathamurthy
- 9A10505 Principles of CommunicationsUploaded bysivabharathamurthy

- How to achieve speed in Maths Calculations.pdfUploaded byAnonymous 9Yv6n5qvS
- M7_soft_in_silicon.pdfUploaded bysaidi_m
- Tower of Hanoi (and Beyond)Uploaded byAisuluu Alymbekova
- papazogloump-2006-97Uploaded bySergio Guiñez
- FPP, OEM, VL Comparison Feb 07Uploaded byYudi Hartono
- Program InformationUploaded byGian Pier Materan Alvarado
- An Overview Improved Harmony Search Algorithm and Its Applications in Mechanical EngineeringUploaded byAnonymous BQrnjRa
- 12 Interesting C Interview Questions and AnswersUploaded bycarrom
- Virtual Lun MigrationUploaded byVignesh Babu
- Mathematicas en Ingenieria QuimicaUploaded byYazmin Baltazar
- AWS Compete PartnerUploaded bySergey
- Release NotesUploaded byChampion AsuraStrike
- Call Setup Failure and TCH BlockingUploaded bymmacarthur
- Client Server Interoperability Support Matrix for Different Oracle Versions (Doc ID 207303.1)Uploaded byDev Fitriady
- ANSI EIA 748 Standard White PaperUploaded byscottig
- data structures module 2Uploaded byAnonymous keT5Du
- MIS for CarrefourUploaded byNovelda
- SoMachine Configuration Software - Catalogue 2015Uploaded bykrys_79
- Vtune Manual Book Hr RevUploaded bygaiatek
- P4M8P-M7_0227CUploaded byRicardo Arteaga
- Detailed Lesson Plan in Introduction to Programming C.docxUploaded byAries Gallandez
- PM for Scientists and Engineers Chapter 1Uploaded byarjunkadya
- KOBBYUploaded byDon Maestro
- 07. Working With Images - Krita DocumentationUploaded byjationona
- ssa_oropezaUploaded bynttruong
- BerryJam – Simple I2C Protocol for Advanced Communication Between ArduinosUploaded bySigid Ariewibowo
- PHPExcel Developer DocumentationUploaded byRadi Varbanov
- Unit 1 RISK ANALYSIS AND DISASTER PLANNINGUploaded bydev chauhan
- Custom Instruction on FPGA for Viterbi AlgorithmUploaded byProject Symphony Collection
- Drawing graphs with GraphvizUploaded byJeff Pratt