CS8451 DAA Important Questions
Anna University Regulation 2017IT CS8451 DAA Important Questions with Answer Key and IT 4th Sem CS8451 DESIGN AND ANALYSIS OF ALGORITHMS Engineering Answer Key is listed down for students to make perfect utilization and score maximum marks with our study materials.
1.Define Algorithm. (Or) Define Notion of Algorithm.
2.Give the Euclid Algorithm for computing gcd of two numbers.
3.What do you mean by sorting problem?
4.What is a basic operation?
5.Define order of growth and compare the order of growth of n(n-1)/2 and n2.
6.What do meant by “Worst case efficiency” of an algorithm?
7.Discuss the principle of optimality.
8.Differentiate Time Efficiency and Space Efficiency.
9.Discuss the general plan for analyzing Time efficiency of recursive algorithm.
10.Discuss the recursive Fibonacci algorithm and its recurrence relation.
CS8451 DAA All units Important Questions – Download Here
If you require any other notes/study materials, you can comment in the below section.
Related Links
For CS8451 DAA Previous Year Question Papers – Click here
For CS8451 DAA Question Bank/2marks 16marks with answers – Click here
For CS8451 DAA Lecture Handwritten Notes – Click here
Search Terms
CS8451 DAA Important Questions
Anna University 4th Sem IT DAA Important Questions
CS8451 DESIGN AND ANALYSIS OF ALGORITHMS Engineering Answer Key free download
Anna University IT DAA Important Questions Regulation 2017
CS8451 Answer Key, DAA Unit wise Important Questions-IT4th Semester