Daa Quations

Chapter-1,2,3
1. what is recursive algorithms with examples

2. what is algorithm visualization with examples
3. Explain An Optimal Randomized Algorithm with Example
4. Explain the algorithm of merge sort Quick sort. Compute the time complexity of merge sort.
Also sort the list 15, 10, 2, 11, 17, 12, 5, 8, 9, 1 , 3, 13, 6 using merge sort
5. Explain Strassen’s algorithm for matrix multiplication with an example.
6. what is asymptotic notations ? basic efficiency classes asymptotic notations with
examples
7. what is empirical analysis of algorithms with examples.
8. With a suitable algorithm, explain the problem of finding the maximum and minimum items
in a set of n elements.
9. Discuss the Dijkstra’s single source shortest path algorithm and derive its time complexity.
10. Define merging and purging rules in 0/1 knapsack problem and explain with an example.
11. Write a greedy algorithm for sequencing unit time jobs with deadlines and profits.
12. Write and explain Prism’s algorithm for finding minimum cost spanning tree of a graph with
an example.
13. What is a Minimum Cost Spanning tree? Explain Kruskal’s Minimum cost spanning tree
algorithm with a suitable example.
14. Write a recursive algorithm for binary search and also bring out its efficiency.
15. Explain divide-and-conquer technique; write a recursive algorithm for finding the maximum
and minimum element from the list.
16. Explain the Optimal Merge Patterns with Example.
Chapter- 6
1. Explain Travelling sales person person problem LCBB procedure with the following instance and
draw the portion of the state space tree and find an optimal tour.
2. What is LC – Search? Discuss LC – Search algorithm.
3. Distinguish between backtracking and branch – and bound techniques.
4. Give the 0/1 Knapsack LCBB algorithm. Explain how to find optimal solution using variable – tuple
sized approach.
5. Explain the FIFO BB 0/1 Knapsack problem procedure with the knapsack instance for n=4.m=15,
(p1,p2,p3,p4)=(10,10,12,18) (w1,w2,w3,w4) =(2, 4, 6, 9). Draw the portion of the state space tree
and find optimal solution.
6. Draw the portion of state space tree generated by FIFOBB for the job sequencing with deadlines
instance n=5 , (p1,p2,..,p5) =(6,3,4,8,5), (t1,t2,..t5) = (2,1,2,1,1) and (d1,d2,..,d5)=(3,1,4,2,4).What is
the penalty corresponding to an optimal solution.
7. Draw the portion of state space tree generated by LCBB for the 0/1 Knapsack instance: n = 5,
(p1,p2,…,p5) = (10,15,6,8,4), (w1,w2,..,w5) = (4,6,3,4,2) and m=12. Find an optimal solution using
fixed – tuple sized approach.
8. Explain FIFO Branch and Bound solution
9. Explain 0/1 Knapsack problem with respect to branch and bound method.
10. What are the differences between FIFO and LC branch and bound solutions?
11. How to search an answer node in branch and bound using Least Cost Search? Explain.
Chapter- 5
1. What is a backtracking? Give the explicit and implicit constraints in 8 queen’s problem.
2. Draw the portion of state space tree for 4 queen’s problem using variable – tuple sized approach.
3. What is a Hamiltonian Cycle? Explain how to find Hamiltonian path and cycle using backtracking
algorithm.
4. Write an algorithm for N – queen’s problem. Give time and space complexity for 8 – queen’s
problem.
5. Give the statement of sum –of subsets problem. Find all sum of subsets for n=4, (w1, w2, w3, w4)
= (11, 13, 24, 7) and M=31.Draw the portion of the state space tree using fixed – tuple sized
approach.
6. Write control abstraction for backtracking.
7. Explain the Graph – coloring problem. And draw the state space tree for m= 3 colors n=4 vertices
graph. Discuss the time and space complexity.
8. Explain the basic principle of Backtracking and list the applications of backtracking.
Chapter- 4
1. Draw an Optimal Binary Search Tree for n=4 identifiers (a1,a2,a3,a4) = ( do,if, read, while)
P(1:4)=(3,3,1,1) and Q(0:4)=(2,3,1,1,1).
2. Explain Reliability Design Problem with suitable example.
3. Describe the Dynamic 0/1 Knapsack Problem. Find an optimal solution for the dynamic
programming 0/1 knapsack instance for n=3, m=6, profits are (p1, p2, p3 ) = (1,2,5), weights are
(w1,w2,w3)=(2,3,4).
4. What is All – Pair Shortest Path problem (APSP)? Discuss the Floyd’s APSP algorithm and discuss
the analysis of this algorithm.
5. Explain Optimal Binary Search tree.
6. Explain the methodology of Dynamic programming. List the applications of Dynamic

programming.
7. Construct a system with multiple devices connected parallel in three stages. The costs of the
devices are 25, 10 and 15 respectively. The cost of the system is to be no more than 100. The
reliability of each device type is 0.8, 0.7 and 0.4 respectively.
8. Compute Multistage graphs for following graph shown in figure
Chapter- 7
1. Write short notes on 3-SAT problem.
2. Briefly explain deterministic and non deterministic algorithms with example.
3. Describe about clique problem.
4. Discuss in detail about the class P, NP, NP-hard and NP-complete problems. Give examples for
each class
5. Write and explain the Cooks theorem.
6. Explain Satisfiability problem.
7. Differentiate between NP - Hard and NP-Complete classes.

Daa Quations

Uploaded by

Copyright:

Available Formats

Daa Quations

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Daa Quations

Uploaded by

Copyright:

Available Formats

Chapter-1,2,3

1. what is recursive algorithms with examples

2. What is LC – Search? Discuss LC – Search algorithm.

3. Distinguish between backtracking and branch – and bound techniques.

8. Explain FIFO Branch and Bound solution

6. Write control abstraction for backtracking.

2. Explain Reliability Design Problem with suitable example.

5. Explain Optimal Binary Search tree.

6. Explain the methodology of Dynamic programming. List the applications of Dynamic

1. Write short notes on 3-SAT problem.

2. Briefly explain deterministic and non deterministic algorithms with example.

3. Describe about clique problem.

5. Write and explain the Cooks theorem.

6. Explain Satisfiability problem.

7. Differentiate between NP - Hard and NP-Complete classes.

You might also like