### CS6402  DAA Important Questions

Anna University Regulation 2013 Computer Science Engineering (CSE) CS6402  DAA Important Questions for all 5 units are provided below. Download link for CSE 6th SEM CS6402  DESIGN AND ANALYSIS OF ALGORITHMS Answer Key is listed down for students to make perfect utilization and score maximum marks with our study materials.

CS6402  DAA Important Questions

Year & Semester : II / IV

Section : CSE-1& 2

Subject Code : CS 6402

Subject Name : DESIGN AND ANALYSIS OF ALGORITHM

Degree & Branch : B.E – C.S.E.

UNIT -1

2 MARK QUESTIONS

1. Define the term Algorithm Remember BTL1

2. List the steps to write an Algorithm Remember BTL1

3. Illustrate an algorithm for (i) Finding factorial of n number. (ii).Sorting the Elements. Apply BTL3

4. Evaluate an algorithm for computing gcd(m,n) using Euclid’s algorithm Evaluate BTL5

5. Design the equality gcd(m,n)=gcd(n,m mod n) for every pair of positive integers m and n. Create BTL6

6. List out the steps that need to design an algorithm? Remember BTL1

7. Examine an algorithm to convert a binary number to a decimal number. Apply BTL3

8. Identify how will you measure input size of algorithms? Remember BTL1

9. Explain how many algorithms can you write for solving find the prime numbers? Compare which is the simplest Analyze BTL4

10. Explain the various types of problems that can be solved using algorithm. Analyze BTL4
11. Apply a simple algorithm for the string matching problem. Apply BTL3
12. Define time complexity and space complexity. Write an algorithm for adding n natural numbers and find the space required by that algorithm. Remember BTL1
13. Define Big ‘Oh’ notation? Remember BTL1
14. Formulate the order of growth? Compare the order of growth n! and 2n . Create BTL6
15. Differentiate between Best, average and worst case efficiency? Understand BTL2
If you require any other notes/study materials, you can comment in the below section.