Scribd
Upload
29 views2 pages

Daa 2 Marksquestion

NICE

Uploaded by

Anonymous buSPtQ8F0u
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
29 views2 pages

Daa 2 Marksquestion

NICE

Uploaded by

Anonymous buSPtQ8F0u
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

UNIT-I

1. Define Algorithm.
2. Write a short note on Algorithm Design and Analysis of Process.
3. What are the 2 kinds of Algorithm Efficiency?
4. How can you specify Algorithms?
5. What is Pseudo Code?
6. What are the Important Problem Types?
7. How can you Classify Algorithms
8. What is Searching Problem?
9. Differentiate Time Efficiency and Space Efficiency?
10. Give the diagram representation of Notion of algorithm.
11. What are the fundamental steps involved in algorithmic problem solving?
12. What is an algorithm design technique?
13. What are the steps involved in the analysis framework?
14. What is the basic operation of an algorithm and how is it identified?
15. What are the basic asymptotic efficiency classes?
16. What is order of growth?
17. What are the applications of Divide & Conquer?
18. What are Randomized Algorithms?
19. Write the General method for Divide &Conquer.
20. Differentiate Between Normal Matrix and Strassen’s Matrix Multiplication
UNIT-II
1. List various tree traversal techniques.
2. What are Bi connected components?
What is BFS.
8.What is DFS.
9. What is a spanning Tree.
10. What is MST.
11. Write the General method for Backtracking Method
12. List out applications Of Backtracking
13. What is Hamiltonian path?
14. What is N-Queen Problem?
15. What is a State Space Tree?
16. What is Chromatic Number.
17. What is m-coloring Graph problem.
UNIT-III
1.Write the general method for Greedy Method.
2.List out applications of Greedy Method.
3.What is the method for finding minimum cost of Spanning Trees?
4.What is Knapsack Problem?
5.What is time complexity of Prims and Kruskals algorithm?
6.Write 2 differences between prims and Kruskals algorithm.
7.What is the algorithm to find out of minimum cost of Spanning Trees?
8.What is single source shortest path problem?
9.Write the difference between Backtracking and Greedy method.
10.What is a Feasible Solution?
11.Write any two characteristics of Greedy Algorithm?
12.What is the Greedy choice property?
13.What are the steps required to develop a greedy algorithm?
14.What are the labels in Prim’s algorithm used for?
15.List out the steps of Greedy algorithms for the Knapsack Problem.

UNIT-IV
1. Define dynamic programming
2. What are the features of dynamic programming?
3. What are the drawbacks of dynamic programming?
4. Write the general procedure of dynamic programming.
5. Define principle of optimality.
6. Write the difference between the Greedy method and Dynamic programming.
7. What is Purging rule?
8. What is OBST problem?
9. What is 0/1 Knapsack problem
10. Write the difference between knapsack problem and 0/1 knapsack problem.
11. What is Travelling sales Person problem.
12. What is All pairs shortest path problem.
13. What is Reliability Design?
14. What is matrix chain multiplication?
15. Write the time complexities for the applications of Dynamic programming.
16. List the Applications Of Dynamic Programming.

You might also like