- Utility-Optimal Multi-Pattern Reuse in Multi-Cell Networks
- M Tech in Computer Science and Engineering Syllabus
- CS 135 mp - Chua,Ralph (2009-10151)
- bending moment
- helmbold_warmuth
- The general term of the prime number sequence and the Smarandache prime function
- Lect 0825
- Ai Problem Solving Search and Control Strategies
- MultiFlowGeneral.ps
- sec33b
- Ch5-Searching-Part1-The Design and Analysis of Parallel Algori - Selim G Akl
- Class Notes
- Sample Resume
- Algorithm Analysis 2
- week8
- Bosco en el articulo matematico
- Games
- gw-102
- Scimakelatex.25782.Megan Fox
- Computing Minimum Spanning Tree in Interval Valued Bipolar Neutrosophic Environment
- 15-17 Dynamic Programming - Algorithms (series lecture)
- Find a Fixed Point in a Given Array _ GeeksforGeeks
- Recitation 2
- nevo02a
- 20_GraphTraversalsAndApplications-091
- NP Section
- Grammar
- Stochastic Business Modeling
- lec4.ppt
- Daa
- R7310506 Design & Analysis of Algorithms
- R7311205 Distributed Databases
- R5410201 Neural Networks & Fuzzy Logic
- Control Systems (Cs) Notes as Per Jntua
- R7311506 Operating Systems
- R7311006 Process Control Instrumentation
- R7311306 Process Control
- R7312301 Transport Phenomena in Bioprocesses
- 07A4EC01 Environmental Studies
- 9A13701 Robotics and Automation
- ssc Social Textbook (AP)
- ssc Telugu(FL) (AP)
- R7410506 Mobile Computing
- R7410407 Operating Systems
- 9A05707 Software Project Management
- R7310406 Digital Communications
- R5310406 Digital Communications
- R7310106 Engineering Geology
- 9A05505 Operating Systems
- 9A15502 Digital System Design
- R7310206 Linear Systems Analysis
- 9A10505 Principles of Communications
- 9A03505 Heat Transfer
- 9A04504 Digital IC Applications
- 9A23501 Heat Transfer in Bioprocesses
- R7310306 Heat Transfer
- 9A14503 Principles of Machine Design
- 9A21506 Mechanisms & Mechanical Design
- R5310204 Power Electronics
- 9A02505 Electrical Machines-III

1

II B.Tech. II Semester (R05) Supplementary Examinations, April/May 2009 DESIGN AND ANALYSIS OF ALGORITHMS (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

**1. (a) Consider a polynomial in n of the form f (n) =
**

m i=0

ai ni . = am nm + am−1 nm−1 + ..... + a2 n2 + a1 n + a0 where am > 0 then f (n) = Ω (nm ) [10+6] [8+8]

(b) Diﬀerentiate between proﬁlling and debugging. 2. (a) Derive a time complexity of Quicksort in average case. (b) Explain the divide and conquer method with an example. 3. (a) What is spanning tree? Explain the prim’s algorithm with an example. (b) Explain the terms Feasible solution, optimal solution and objective function.

[10+6] 4. (a) Using dynamic programming method, ﬁnd the maximum no.of operation possible for the following chain matrix multiplication and also the sequence of multiplications that will require this maximum no. of operations A(20,30) * B(30,5) * C(5,12),* D(12,5) (b) Deﬁne merging and purging rules in o/1 Knapsack problem. 5. (a) What is articulation point. Write the pseudocode for the articulation point. (b) Show that DFS visits all vertices in G reachable from v. 6. (a) Write a recursive backtracking algorithm for sum of subsets problem. (b) Draw the search tree to color the graph with the three colors: red, blue, green. [8+8] 7. (a) What is Bounding? Explain how these bound are useful in Branch and Bound methods. (b) Describe the TSP in Branch and Bound. 8. (a) Explain about cook’s theorem. (b) Explain the strategy to prove that a problem is NP hard. [8+8] [8+8] [8+8] [10+6]

Code No: R5220502

2

II B.Tech. II Semester (R05) Supplementary Examinations, April/May 2009 DESIGN AND ANALYSIS OF ALGORITHMS (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. (a) Explain the asymptotic notations used in algorithm analysis. (b) Prove that f(n)=0(h(n)) where f(n)=0(g(n)) and g(n)=0(h(n)). [10+6] 2. (a) Design a recursive linear time algorithm that tests whether a binary tree satisﬁes the search tree order property at every node. (b) Derive the time complexity of strassen’s matrix multiplication. 3. (a) What is spanning tree? Explain the prim’s algorithm with an example. (b) Explain the terms Feasible solution, optimal solution and objective function. [10+6] 4. (a) Solve the following 0/1 Knapsack problem using dynamic programming m=6, n=3, (w1 , w2 , w3 )=(2,3,3), (p1 , p2 , p3 )=(1,2,4) (b) Write an algorithm of all pairs shortest path problem. [8+8] 5. (a) Find a necessary and suﬃcient condition for the root of a depth ﬁrst search for a connected graph to be an articulation point. Prove it. (b) Show that the inorder and postorder sequences of a binary tree uniquely deﬁne the binary tree. [8+8] 6. (a) Let w = {20, 18, 15, 12, 10, 7, 5} and m=35. Find all possible subsets of w that sum to m. Draw the portion of the state space tree that is generated. (b) Describe the applications of m-coloring. 7. (a) Explain the general method of Branch and Bound. (b) Explain the principles of LIFO Branch and Bound. 8. (a) Explain the Clique problem and write the algorithm for the same. (b) Diﬀerentiate between NP-complete and NP-Hard. [10+6] [8+8] [10+6] [8+8]

Code No: R5220502

3

II B.Tech. II Semester (R05) Supplementary Examinations, April/May 2009 DESIGN AND ANALYSIS OF ALGORITHMS (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. (a) Write the non-recursive algorithm for ﬁnding the ﬁbonacci sequence and derive its time complexity. (b) Show that f(n) = 4n2 −64n + 288 =Ω (n)2 . 2. (a) Write and explain the control abstraction for Divide and conquer. (b) Suggest reﬁnements to mergesort to make it in-place. 3. (a) Write a greedy algorithm to the Job sequencing with deadlines. (b) Prove that the edge with the smallest weight will be part of every minimum spanning tree. [8+8] 4. (a) Explain the matrix chain multiplication with an example. (b) Find the shortest tour of a TSP for the following graph (ﬁgure 1)using dynamic programming. [8+8] [8+8] [10+6]

Figure 1: 5. (a) Write a pseudocode for ﬁnding the strongly connected components of directed graph. Also analyze its time complexity. (b) Explain the Inorder traversal of a tree with an example. 6. (a) Write an algorithm of ﬁnding all m-colorings of a graph. (b) Describe the 4-queens problem using backtracking. 7. (a) Explain the method of reduction to solve TSP problem using Branch and Bound. (b) Explain the principles of FIFO Branch and Bound. 8. (a) Explain the classes of NP-hard and NP-complete. (b) Describe clique decision problem and write the algorithm for the same. [8+8] [8+8] [8+8] [8+8]

Code No: R5220502

4

1. (a) Write the non-recursive algorithm for ﬁnding the ﬁbonacci sequence and derive its time complexity. (b) Show that f(n) = 4n2 −64n + 288 =Ω (n)2 . 2. (a) Write a search algorithm in a binary search tree. (b) List some of the advantages and disadvantages of the partition algorithm. [10+6] 3. Write and Explain the Kruskal’s algorithm for ﬁnding the minimum cost spanning tree. What is its time complexity. [16] 4. (a) Find one problem for which the principle of optimality does not hold. Explain why the principle does not hold. (b) Find the shortest path between all pairs of nodes in the following graph. (Figure 1) [8+8] [10+6]

Figure 1: 5. (a) A directed graph G=(V,E) is singly connected if u → v implies that there is atmost one simple path from u to v for all vertices u, v ∈ V. Give an eﬃcient algorithm to determine whether or not a directed graph is singly connected. (b) Diﬀerentiate between BFS and DFS. [10+6] 6. Write the control abstraction of backtracking write backtracking algorithm for 8-queen problem. [16] 7. (a) Explain the method of reduction to solve TSP problem using Branch and Bound. (b) Explain the principles of FIFO Branch and Bound. 8. (a) Explain the classes of NP-hard and NP-complete. (b) Describe clique decision problem and write the algorithm for the same. [8+8] [8+8]

- Utility-Optimal Multi-Pattern Reuse in Multi-Cell NetworksUploaded byShabeer Vpk
- M Tech in Computer Science and Engineering SyllabusUploaded byJinu Madhavan
- CS 135 mp - Chua,Ralph (2009-10151)Uploaded byRalph Jacob Ang Chua
- bending momentUploaded byapi-242078103
- helmbold_warmuthUploaded bygsucheta
- The general term of the prime number sequence and the Smarandache prime functionUploaded byMia Amalia
- Lect 0825Uploaded byblabla9999999
- Ai Problem Solving Search and Control StrategiesUploaded bysuperespol
- MultiFlowGeneral.psUploaded byLeandro Meili
- sec33bUploaded byroufix
- Ch5-Searching-Part1-The Design and Analysis of Parallel Algori - Selim G AklUploaded byHendro Utomo
- Class NotesUploaded byRajinder Sanwal
- Sample ResumeUploaded byapi-3708181
- Algorithm Analysis 2Uploaded byMahreen Ilahi
- week8Uploaded byHardeo Thakur
- Bosco en el articulo matematicoUploaded byartovolasti
- GamesUploaded byToth Eni
- gw-102Uploaded byPiyush Puskar
- Scimakelatex.25782.Megan FoxUploaded byMaty Acosta
- Computing Minimum Spanning Tree in Interval Valued Bipolar Neutrosophic EnvironmentUploaded byscience2010
- 15-17 Dynamic Programming - Algorithms (series lecture)Uploaded byturjo987
- Find a Fixed Point in a Given Array _ GeeksforGeeksUploaded byNiraj Kumar
- Recitation 2Uploaded bystlonginus1942
- nevo02aUploaded bySandip Pandya
- 20_GraphTraversalsAndApplications-091Uploaded byPavin Ka
- NP SectionUploaded byspy_crash
- GrammarUploaded byAnonymous BWVVQpx
- Stochastic Business ModelingUploaded byptanoy8
- lec4.pptUploaded byshiv kumar
- DaaUploaded bySwati Sharma

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