DAA
2 marks Important Questions:
1. List the properties of asymptotic notations.
2. Differentiate Mathematical and empirical analysis.
3. Give Euclid's algorithm for computing gcd (n, n).
4. Write the brute force algorithm for string matching.
5. Write a recurrence relation equation for divide and conquer Algorithm.
13 marks
1. i) Write an algorithm using recursion that determines the GCD of numbers.
Determine the time and space complexity.
ii) Apply non recursion to find the element with maximum value in a given
array.
2. i) Summarize about visualization.
ii) Write about the fundamental steps of Algorithmic problem solving.
3. i) Reproduce an algorithm to implement brute-force string matching
problem with an example.
ii) Concept of transform and conquer Approach with analysis.
4. Exhaustive search methods with example.
14marks
1. i) Briefly the divide & conquer methodology in detail.
ii) Explain the checking uniquences in an array using presorting?
2. i) Describe Traveling Salesman problem using exhaustive Search Technique.
and find the optimal tour. Any one of the example graph
ii) Closest pair problem with suitable example. And also discuss the time
complexity of this algorithm.
2 marks
6. Specify the notation of algorithm properties.
7. Compare Recurrence Algorithm & non recurrence
8. Name at least two sorting techniques that make use of divide and conquer
algorithm.
9. Compute 2101 * 1130 by applying the divide and conquer algorithm.
13 marks
5. List and Explain the fundamental properties of asymptotic notations. prove
each property with suitable mathematical functions.
6. Explain the method of solving recurrence equation.
7. i) Traveling salesman with example Algorithm.
ii) Strassen's algorithm with example.
14 marks
3. i) Divide & conquer approach
closest pair
ii) Convex Hull problem
iii) Master theorem and its cases.
4. i) Recurrence relation T(n) = T(n+1)+1 with T(0)=0 as initial condition. Find
Big oh Notation.
