qp

Attribution Non-Commercial (BY-NC)

23 views

qp

Attribution Non-Commercial (BY-NC)

- Algorithms Hw 2
- Assign 2
- Foundations on Knowledge Representation and Reasoning by Lakemeyer and Nebel
- Home
- AbrishamiShirazi MSc F2011
- Technical Aptitude Questions eBook
- TA ZC142-L7
- Secure and Efficient Off-Line Digital Money
- Mathematics UPIL Catalogue
- Using Machine Translation to Convert Between Difficulties in Rhythm Games
- Dynamic Programming an Intriduction by Example
- CourieL WP2 Chapter5 Final Scheduling and routing
- Syllabus
- NP hard
- Chapter11.pdf
- 3 Absolute Center of a Graph
- 2.2-2.3 Traveling Salesman Problem
- Railway Crew Capacity Planning Problem With Connectivity
- Genetic Algorithms
- Graphs and optimization

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.

*****

- Algorithms Hw 2Uploaded byavocetave
- Assign 2Uploaded byalizeinaldeen
- Foundations on Knowledge Representation and Reasoning by Lakemeyer and NebelUploaded byNasir Danial
- HomeUploaded bycacing_957117
- AbrishamiShirazi MSc F2011Uploaded bySySekouAmadTidiane
- Technical Aptitude Questions eBookUploaded bySai Charan Sri Harsha
- TA ZC142-L7Uploaded byrajpd28
- Secure and Efficient Off-Line Digital MoneyUploaded byElias Zermane
- Mathematics UPIL CatalogueUploaded byKiran Kumar Kuppa
- Using Machine Translation to Convert Between Difficulties in Rhythm GamesUploaded byGretchen Stewart
- Dynamic Programming an Intriduction by ExampleUploaded byTian-Yu Tan
- CourieL WP2 Chapter5 Final Scheduling and routingUploaded bynidhi_26
- SyllabusUploaded byVidhu Edavana
- NP hardUploaded bytrupti.kodinariya9810
- Chapter11.pdfUploaded byAmara Bhargav
- 3 Absolute Center of a GraphUploaded byLelouch V. Britania
- 2.2-2.3 Traveling Salesman ProblemUploaded byMuhammad Fadzreen
- Railway Crew Capacity Planning Problem With ConnectivityUploaded byShubhashree Soubhagyarashmi
- Genetic AlgorithmsUploaded by1balamanian
- Graphs and optimizationUploaded byAmira Zarglayoun
- Data Structures Multiple Choice QuestionsUploaded byGm Lakshman
- MiTeThVa98Uploaded bySidney Lins
- RecurrencesUploaded byRinku Parmar
- Asgn1_5th Ce It Daa 2019Uploaded bytempmail
- paper dinamicaUploaded bytopo6666
- fd2d2b4d0a914eba5e4270be4161bcae8f81.pdfUploaded bySamuel Wilson

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

- Artikel BingUploaded bybyan
- MKT ReportUploaded byMarch Athena
- Research Design ExampleUploaded byMegha Bhayani
- DEMOGRAPHIC FACTORS FOR THE QUALITY OF WORKING LIFE OF HEALTHCARE WORKERS IN BULGARIA.Uploaded byIJAR Journal
- I-beam Structure Under Blast Loading – Eulerian MeshUploaded byagnayel
- Carl Cohen, _The Case for the Use of Animals in Biomedical Research_.pdfUploaded byFrancisco Salazar
- mechanical engUploaded byRazia Farzana
- Potentiometric Acid-Base Tit RationsUploaded byMark del Rosario
- Logistic innovation in global supply chains: an empirical test of dynamic transaction-cost theoryUploaded bylobna_qassem7176
- 164.100.47.5 Newcommittee Reports Englishcommittees Committee on Health and Family Welfare 59Uploaded byanilpharma1022
- Project ReportUploaded bysushantchauhan24
- interpreting standardized test scores book chapterUploaded byapi-301935239
- NPS CRM Special Issue on Mining HeritageUploaded byRussell Hartill
- Articulo Discourse Reflexivity MaurarenUploaded byOlaya Aramo
- Cultural Sponsorships Affect the Positive PerceptionUploaded byAntonio Ivičević
- Sheehan, Ramsay Patrick - Transcending_Boundaries, 2000Uploaded byKeisil Tsatsanitze
- Statement on nitrites in meat products - EFSA Panel on Food Additives and Nutrient Sources added to Food.pdfUploaded byDimitris Papadopoulos
- 05 3G-2G IRATUploaded by123 mlmb
- Aphr Exam Content OutlineUploaded bySamatar Daher
- Syllabus crim1 2012Uploaded byHyman Jay Hernandez Blanco
- Ethos_Body and Mind in the Trobriand IslandsUploaded byGenaro Israel Ab'äj Vot'an
- metaanaliza povezanosti razvoda i blagostanja deceUploaded byAndjelija Kocic
- A Nova GuideUploaded byNolaine Nunez
- Infopack-v0.1-OYWMUploaded byteona1
- Chapter - 2 Marketing ManagementUploaded byciara White
- art%3A10.1007%2Fs12525-014-0170-xUploaded bythanhkhoaqt1b
- Guides to CommissioningUploaded bysmithwork
- MIT18_05S14_Reading10b.pdfUploaded byIslamSharaf
- Electrical Engineer PLC Programmer in Greenville Spartanburg SC Resume James WasnessUploaded byJamesWasness
- New Taxonomy Summary SheetUploaded byShantiram Dahal