Attribution Non-Commercial (BY-NC)

867 views

Attribution Non-Commercial (BY-NC)

- L01
- Daa Course File Final 2012
- DAA
- Stevey's Blog Rants_ Get That Job at Google
- Lecture 01
- Introduction to Data Structures
- Missive CS 168
- Algorithm Analysis Complexity
- cs651_syllabus (1).pdf
- Sorting Algorithms
- prog-assign-3-explained (1).pdf
- 1.2 Comparing Algorithms2
- [Fall 2011] CS-318 - Analysis of Algorithms - Course Outline
- Complexity
- III SEM- DESIGN ANALYSIS ALGORITHM.pdf
- Daa
- Divide & Conquer
- H6-solution[www.alirezaweb.com].pdf
- Sample Questions
- 1 key

You are on page 1of 8

KINGS

COLLEGE OF ENGINEERING

ENGINEERING

QUESTION BANK

Sub Title : Design And Analysis of Algorithm Year/Sem : II / IV

PART-A:

2. What is analysis framework?

3. What are the algorithm design techniques?

4. How is an algorithm’s time efficiency measured?

5. Mention any four classes of algorithm efficiency.

6. Define Order of Growth.

7. State the following Terms.

(i) Time Complexity

(ii) Space Complexity

8. What are the various asymptotic Notations?

9. What are the important problem types?

10. Define algorithmic Strategy (or) Algorithmic Technique.

11. What are the various algorithm strategies (or) algorithm Techniques?

12. What are the ways to specify an algorithm?

13. Define Best case Time Complexity .

14. Define Worst case Time Complexity.

15. Define Average case time complexity.

16. What are the Basic Efficiency Classes.

17. Define Asymptotic Notation.

18. How to calculate the GCD value?

DESIGN AND ANALYSIS OF ALGORITHM

PART-B:

(b) Explain some of the problem types used in the design of

algorithm. (6)

2. (a) Discuss the fundamentals of analysis framework . (10)

(b) Explain the various asymptotic notations used in

algorithm design. (6)

3. (a) Explain the general framework for analyzing the efficiency

of algorithm. (8)

(b) Explain the various Asymptotic efficiencies of an algorithm. (8)

4. (a) Explain the basic efficiency classes. (10)

(b) Explain briefly the concept of algorithmic strategies. (6)

5. Describe briefly the notions of complexity of an algorithm. (16)

6. (a) What is Pseudo-code?Explain with an example. (8)

(b) Find the complexity C(n) of the algorithm for the worst

case,best case and average case.(Evaluate average case

complexity for n=3,Where n is the number of inputs) (8)

PART-A:

2. What is algorithm animation?

3. What is the tool for analyzing the time efficiency of a non -

recursive algorithm?

4. What are the difference between mathematical & Empirical

analysis?

5. What are the two applications of algorithm visualization?

6. What are the three ways by which an algorithm can be

analyzed?

7. How the mathematical analysis can be performed?

8. Give any four features of algorithmic visualization.

9. What are the two approaches of algorithmic visualization?

DESIGN AND ANALYSIS OF ALGORITHM

10. What are the two categories of algorithms?

11. What is the mathematical modeling?

PART-B:

number of the Fibonacci sequence. (16)

2. Explain pros and cons of the empirical analysis of algorithm. (16)

3. (a) Explain the necessary steps for analyzing efficiency of

recursive algorithms with an example. (10)

(b) What is empirical analysis of an algorithm? Discuss its

strength & Weakness. (6)

4. Show a tree structure for recursive calls made in the problem

of Tower of Hanoi. (16)

5. (a) Write short notes on algorithm visualization & applications. (10)

(b) Discuss the features of animation of an algorithm. (6)

6. (a) Design a non-recursive algorithm for computing the product

of two n*n matrices and also find the time efficiency of

algorithm. (10)

(b) Give the general plan for empirical analysis. (6)

PART-A:

2. Find the number of comparisons made by the sequential

search in the worst & Best case.

3. Give the time efficiency & Drawback of merge sort

Algorithm.

4. What is the difference between DFS & BFS?

5. What is the Brute Force Algorithmic Strategy?

6. State the time complexity of following:

(i) Bubble sort

(ii) Selection sort

(iii) Sequential search

(iv) Brute force string matching

7. What are the features of Brute force String matching

algorithm?

DESIGN AND ANALYSIS OF ALGORITHM

8. Give any two strength & Weakness of Brute force

algorithm.

9. Explain Brute force string matching algorithm.

10. Define “Divide & Conquer Technique”.

11. State Master’s Theorem.

12. Define Merge sort & explain three steps of Merge sort.

13. Define Quick sort & explain three steps of Quick sort.

14. Define Binary Search.

15. What are the applications of binary search?

16. State advantages & Disadvantages of binary search.

17. Explain Binary search tree.

18. What is the recurrence relation for divide & conquer?

19. Explain Decrease & Conquer.

20. What are the variations of Decrease & Conquer?

21. What are the applications of decrease by constant?

22. Write any four advantages of insertion sort.

23. What are the two types of searching algorithm?

24. Define the Following Terms:

(i) Tree Edge

(ii) Back Edge

(iii) Cross Edge

PART-B:

2. (a) Write an algorithm to sort a set of ‘N’ numbers using

insertion sort. (8)

(b) Expalin the difference between depth first search &

Breadth first search. (8)

3. (a) Write a pseudo code for divide & conquer algorithm for

merging two sorted arrays in to a single sorted one.

Explain with example. (12)

(b) Set up & solve a recurrence relation for the number of

key comparisons made by above pseudo code. (4)

4. Give a suitable example & explain the Breadth first search &

Depth first search. (16)

5. Find the number of comparisons made by the sentinel version

of sequential search algorithm for in,

(i)Worst case

(ii)Average case (16)

DESIGN AND ANALYSIS OF ALGORITHM

6. Design a recursive Decrease-by-one algorithm for sorting

the n real numbers in any array with an example & also

determinem the number of key comparisons & time efficiency

of the algorithm. (16)

7. (a) Give an algorithm for selection sort & analyze your

algorithm. (10)

(b) Give Strength & Weakness of Brute force algorithm. (6)

IV-UNIT(Algorithmic Techniques)

PART-A:

2. How efficient is prim’s algorithm?

3. Define concept of transform & conquer.

4. What are the three variations of transform & conquer?

5. State the following terms:

(i) Balanced Tree

(ii) Unbalanced Tree

6. What is height of balanced tree?

7. What is balance factor?

8. Define rotation & what are the four types of rotations?

9. What are the drawbacks of AVL trees?

10. What is 2-3 trees?

11. Define Heap.& what are the two types heap?

12. What are the important properties of heap?

13. Define complete binary tree.

14. What is the height of the tree?(or)depth of the tree?

15. Define almost complete binary tree.

16. How to construct a heap?

17. What are the features of heap sort?

18. Define heapsort.

19. State the properties of AVL trees.

20. What is dynamic programming?

21. Compare divide & conquer and Dynamic programming.

22. How the problems can be solved using dynamic programming?

23. Define Warshall’s algorithm.

24. Define Floyd’s algorithm.

DESIGN AND ANALYSIS OF ALGORITHM

25. Give any two properties of dynamic programming approach.

26. Define principle of optimality.

27. What is OBST?

28. What is Greedy method?

29. Compare Greedy algorithm & Dynamic programming.

30. Define Prim’s algorithm.

31. Define Kruskal’s algorithm.

32. Define Dijikstra’s shortest path algorithm.

33. How to obtain Huffman’s Code?

34. What are the applications of Huffman trees?

35. What are the applications of spanning trees?

PART-B:

algorithm with your own example. (10)

(b) Properties of Heap sort. (6)

(b) Explain single L-Rotation & of the double RL-Rotation

with general form. (6)

tree with simple example. (16)

4. Solve the all pair shortest path problem for the diagraph with the

weighted matrix given below:-

a b c d

a 0 ∞ 3 ∞ (16)

b 2 0 ∞ ∞

c ∞ 7 0 1

d 6 ∞ ∞ 0

5. Explain Warshall’s & Floyd’s Algorithm. (16)

6. Define Spanning tree.Discuss design steps in Prim’s algorithm to

construct minimum spanning tree with an example. (16)

7. (a) Explain Kruskal’s algorithm. (8)

(b) Explain Dijikstra algorithm (8)

DESIGN AND ANALYSIS OF ALGORITHM

PART-A:

1. Define Backtracking.

2. What are the applications of backtracking?

3. What are the algorithm design techniques?

4. Define n-queens problem.

5. Define Hamiltonian Circuit problem.

6. Define sum of subset problem.

7. What is state space tree?

8. Define Branch & Bound method.

9. Define assignment problem.

10. What is promising & non-promising node?

11. Define Knapsack’s problem.

12. Define Travelling salesman problem.

13. State principle of backtracking.

14. Compare Backtracking & Branch and Bound techniques with an

example.

15. What are the applications of branch & bound?(or)

What are the examples of branch & bound?

16.In Backtracking method,how the problem can be categorized?

17.How should be determine the solution in backtracking algorithm?

18.Obtain all possible solutions to 4-Queen’s problem.

19.Generate atleast 3-solutions for 5-Queen’s problem.

20.Draw a pruned state space tree for a given sum of subset

problem:

S={3,4,5,6} and d=13

DESIGN AND ANALYSIS OF ALGORITHM

PART-B:

solutions. (16)

branch & bound algorithm. (16)

branch & bound technique. (16)

of subset sum problem : S={1,3,4,5} and d=11 (16)

strategies using backtracking. (16)

- L01Uploaded byRonak Chaudhary
- Daa Course File Final 2012Uploaded bygurusodhii
- DAAUploaded bymarifs2002
- Stevey's Blog Rants_ Get That Job at GoogleUploaded byAbcdef
- Lecture 01Uploaded byziactn
- Introduction to Data StructuresUploaded byRiteshRaj
- Missive CS 168Uploaded byAnonymous O4Iw7C
- Algorithm Analysis ComplexityUploaded byamandeep651
- cs651_syllabus (1).pdfUploaded byvanitamane1
- Sorting AlgorithmsUploaded byzaheerimpeccable1116
- prog-assign-3-explained (1).pdfUploaded byMoazzam Hussain
- 1.2 Comparing Algorithms2Uploaded byiducduy
- [Fall 2011] CS-318 - Analysis of Algorithms - Course OutlineUploaded byJunaid Akram
- ComplexityUploaded byShivam Abrol
- III SEM- DESIGN ANALYSIS ALGORITHM.pdfUploaded byAnil Kumar
- DaaUploaded byVijaya Kumar
- Divide & ConquerUploaded bySaraah Ghori
- H6-solution[www.alirezaweb.com].pdfUploaded byVahid Esmaeilzadeh
- Sample QuestionsUploaded byMBANZABUGABO
- 1 keyUploaded byAarti Soni
- Docslide.us Week5 Lab ReportUploaded byCarlos Liang
- Gating by Sorting Fusion Jul 2013Uploaded byducpiano
- Chapter 12Uploaded bySumedh Deshpande
- Image ProjectsUploaded byArkaprava Bhowmik
- APA_Lab.2 - ReportUploaded byMihai Lungu
- lec5Uploaded byXaKep Eguchi
- Discovering_Computer_Science_Interdiscip.pdfUploaded byPaul Divac
- RZC-ComputerScienceUploaded byYounger Boxer Metalic
- IntroductionUploaded byFidelito Bautista
- Notes NetworksUploaded byLe Professionist

- Formula Sheet-Probability and Random ProcessesUploaded byhammadmunawar
- Theory of ComputationUploaded bysaranjsp
- Annauniv 5thsem Sytsemsoftware Students CornersUploaded bystudentscorners
- Cs1353 Software EngineeringUploaded byEmmanuel Israel T
- MaanavaN.comUploaded bykarthikbabube
- Cs1253 Visual Programming two marksUploaded bykarthikbabube
- Noorul Islam College of Engineering, Kumaracoil. Department of Computer ScienceUploaded bys.reegan
- win7Uploaded bykarthikbabube
- COA two marksUploaded bykarthikbabube
- Basic Research in Computer Science BRICS RS-97-43Uploaded bykarthikbabube
- New VP RecordUploaded bykarthikbabube
- 10.1.1.112Uploaded bykarthikbabube
- r 2008 Cse SyllabusUploaded bykarthikbabube
- UNIT IUploaded bykarthikbabube
- OS-Kings College Unit WiseUploaded byPradeep Kumar
- Math FormulaUploaded byJames Ho
- Slides 4Uploaded bykarthikbabube
- System Calls 4Uploaded bykarthikbabube
- Problems on Algorithms (2002)Uploaded bylcnblzr3877
- Search SortUploaded bykarthikbabube
- Cse CurriculumUploaded bykarthikbabube

- Answer Homework7 Heapsort (1)Uploaded byVamshi Kolan
- ECE-DS OOPS QBUploaded bymyfriend06
- Heap SortUploaded bySanan Rasheed
- Relational Algebra & SyncsortUploaded byvengangaboy
- DS LAB MANUALUploaded bykrishnakrishna22
- Cpp FundamentalsUploaded bybimblio222
- FS Lecture 9 CosequentialUploaded byMitesh Kumar
- Sequential and Parallel Sorting AlgorithmsUploaded bykesharwanidurgesh
- ADS Unit - 1Uploaded bySurya
- Ds&Oops Lab Manual-eceUploaded byHari Krishnan
- Heap SortUploaded byYogender Singh
- ds__oops___unit___5Uploaded bymohan
- Heap SortUploaded byHande Koru
- Advanced Data StructuresUploaded byNagesh Nadigatla
- Data Structures and Algorithm Analysis in C++, Weiss, 3rd Edition. TABLE OF CONTENTS ONLY.Uploaded byelunicopericodelospalotes
- CS502_allUploaded byrung_baaz
- EC6301_qb.pdfUploaded byVive Kowsal Yaniss
- Data StructureUploaded byWaleed Khalid
- TREE (C)Uploaded byबानि तमिन्
- AlgorithmUploaded bySachin Michu
- Design and Analysis of AlgorithmUploaded byromeofatima
- Ds AssignmentUploaded byAsdf Fdsa
- Gate Cs Solved Paper by Nodia 2Uploaded byKrishnendu Rarhi
- 05 Sorting MethodsUploaded byamitfegade121
- Heap SortUploaded byhb
- Computer Prog QUESTIONS and ANSWERS-Vamsi (75 Questions With Answers)Uploaded bySai Sumanth
- Rao Lecture 17Uploaded bySakura2709
- The JourneyUploaded byZeyad Etman
- Lab-09Uploaded byWaqas Ali
- Chapter 4_Sorting AlgorithmUploaded byNguyễnHoàngCầm