1. What is an algorithm?Discuss its characteristics.
2. Discuss the steps used by computer professionals for Design and Analysis of Algorithms process.
3. What are asymptotic notations? List and discuss with definition, graph and examples.
4. Design and find the time complexity of non recursive algorithms.
(MaxElement, ElementUniqueness, Matrix Multiplication, Binary(n)
5. Design and find the time complexity of recursive algorithms.
(Factorial, Tower of Hanoi, Binary(n)
6. What is space complexity?Discuss with examples.
2. Discuss the steps used by computer professionals for Design and Analysis of Algorithms process.
3. What are asymptotic notations? List and discuss with definition, graph and examples.
4. Design and find the time complexity of non recursive algorithms.
(MaxElement, ElementUniqueness, Matrix Multiplication, Binary(n)
5. Design and find the time complexity of recursive algorithms.
(Factorial, Tower of Hanoi, Binary(n)
6. What is space complexity?Discuss with examples.
No comments:
Post a Comment