Scribd
Upload
32 views2 pages

DAA IMPORTANT QUESTIONS

Uploaded by

jayanbu05
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
32 views2 pages

DAA IMPORTANT QUESTIONS

Uploaded by

jayanbu05
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

DESIGN AND ANALYSIS OF ALGORITHM

Unit 1

1. Explain about algorithm with suitable example (Notion of algorithm).

2. Write short note on Fundamentals of Algorithmic Problem Solving

3. Discuss important problem types that you face during Algorithm Analysis.

4. Discuss Fundamentals of the analysis of algorithm efficiency elaborately. [Nov/Dec 2019,

Apr/May 2019]

5. Elaborate Asymptotic analysis of an algorithm with an example.List out the Steps in

Mathematical Analysis of non recursive Algorithms.

6. List out the Steps in Mathematical Analysis of Recursive Algorithms.

7. Explain in detail about linear search.

8. Write an Algorithm using recursion that determines the GCD of two numbers. Determine

the time and space complexity. [Nov/Dec 2019]

Unit 2

1. Explain Divide and Conquer Method.

2. Explain Merge Sort with suitable example.

3. Discuss Quick Sort Algorithm and Explain it with example. Derive Worst case and Average

Case Complexity.

4. Explain in detail about Travelling Salesman Problem using exhaustive search.

5. Explain in detail about Knapsack Problem.

6. Write algorithm to find closest pair of points using divide and conquer and explain it with

example. Derive the worst case and average case time complexity. [Nov/Dec 2019]

7. What is Convex hull problem? Explain the brute force approach to solve convex-hull with an

example. Derive time complexity.

Unit 3

1..Explain Kruskal's Algorithm

2. Discuss Prim's Algorithm in detail.

3. Write short note on Greedy Method. [Nov/Dec 2019]

4. What does dynamic programming have in common with divide-and-Conquer?

5. Explain how to Floyd’s Algorithm works. [Apr/May 2019]

6. Write Huffman code algorithm and derive its complexity. [Apr/May 2019]
7. Outline the Dynamic Programming approach to solve the Optimal Binary Search Tree

problem and analyze it time complexity. [Nov/Dec 2019]

Unit 4

1. Explain in detail about Simplex Method.

2. Explain in detail about Maximum Flow Problem [Apr/May 2019]

3. Outline the stable marriage problem with example. [Nov/Dec 2019]What is bipartite

graph? Is the subset of bipartite graph is bipartite? Outline withexample. [Nov/Dec 2019]

4.Solve the following equation using Simplex Method. [Apr/May 2019]

Maximize: 18x1+ 12.5x2

Subject to x1+x2<=20

x1<=12

x2<=16

x1,x2>=0

Unit 5

1. Elaborate how backtracking technique can be used to solve the n-queens problem. Explain

with an example. [Nov/Dec 2019]

2. ExplainBacktrackingtechnique.

3. Give solution to Hamiltonian circuit using Backtracking technique

4. Give solution to Subset sum problem using Backtracking technique [Apr/May 2019]

5. Explain P, NP and NP complete problem

6. Explain the approximation algorithm for the travelling salesman problem (TSP) [Apr/May

2019]

7. Outline the steps to find approximate solution to NP-Hard optimization problems using

approximation algorithms with an example. [Nov/Dec 2019]

You might also like