CS8451 Question Bank Design and Analysis Of Algorithms
CS8451 Question Bank Design and Analysis Of Algorithms Regulation 2017 Anna University free download. Design and Analysis Of Algorithms Question Bank CS8451 pdf free download.
Sample CS8451 Question Bank Design and Analysis Of Algorithms:
1. What is an Algorithm?
2. Write the Euclid’s algorithm for GCD calculation?
3. What is algorithm design Technique?
4. Differentiate time and Space efficiency?
5. Design an algorithm to compute the area and Circumference of a circle CS8451 Question Bank Design and Analysis Of Algorithms
6. List the important problem types
7. How will you measure input size of algorithms
8. Define best, worst and average case efficiency?
9. Define big oh(O),Big omega(Ω ) and big theta(Ө) notations
10. List the basic efficiency classes CS8451 Question Bank Design and Analysis Of Algorithms
11. Define recurrence relation?
12. What is non recursion relation?
13. Define nonrecursive algorithm? CS8451 Question Bank Design and Analysis Of Algorithms
16. Write an algorithm using recursive function to find the sum of n numbers.
17. What is algorithm optimality
18. List the factors which affects the running time of the algorithm.
19. What is meant by substitute methods?
20. Write the general plan for analyzing Time efficiency of recursive algorithm CS8451 Question Bank Design and Analysis Of Algorithms
16 MARK QUESTIONS: CS8451 Question Bank Design and Analysis Of Algorithms
1. Discuss in detail about fundamentals of algorithmic problem solving?
2. Explain the important problem types in detail
3. Explain the necessary steps for analyzing the efficiency of recursive algorithms
4. Explain the general framework for analyzing the efficiency of algorithm. CS8451 Question Bank Design and Analysis Of Algorithms
5. Write the asymptotic notations used for best case ,average case and worst case analysis of algorithms and Write an algorithm for finding maximum element of an array perform best , worst and average case complexity with appropriate order notations
6. Explain the method of solving recurrence equations with suitable example.
7. Explain the method of solving Non recursive equations with suitable examples CS8451 Question Bank Design and Analysis Of Algorithms
8. i)Describe the basic efficiency classes in detail.
ii) Write an algorithm for Fibonacci numbers generation and compute the following
a) How many times is the basic operation executed
b) What is the efficiency class of this algorithm
9. Solve the following recurrence relations CS8451 Question Bank Design and Analysis Of Algorithms
| Subject name | Design and Analysis Of Algorithms |
| Short Name | DAA |
| Semester | 4 |
| Subject Code | CS8451 |
| Regulation | 2017 regulation |
CS8451 Design and Analysis Of Algorithms Question Bank Click Here To Download
CS8451 Design and Analysis Of Algorithms Important Questions
CS8451 Design and Analysis Of Algorithms Syllabus
CS8451 Design and Analysis Of Algorithms Notes