Scribd
Upload
22 views3 pages

Study All Questions Fully. Dont Leave Choice

This document contains 16 questions related to algorithms. The questions cover topics such as algorithm analysis, graph algorithms, greedy algorithms, dynamic programming, NP-complete problems, approximation algorithms, and more. Students are instructed to study all questions fully and not leave any choices unanswered.

Uploaded by

Vinoth Kumar M
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
22 views3 pages

Study All Questions Fully. Dont Leave Choice

This document contains 16 questions related to algorithms. The questions cover topics such as algorithm analysis, graph algorithms, greedy algorithms, dynamic programming, NP-complete problems, approximation algorithms, and more. Students are instructed to study all questions fully and not leave any choices unanswered.

Uploaded by

Vinoth Kumar M
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/ 3

Study all questions fully.

dont leave choice

1. Compare and contrast time and space efficiency.


2. Give the diagram representation of Notion of algorithm.
3. Evaluate the methods can be used to solve the knapsack problem.
4. Point out the applications of Brute Force method.
5. Compare greedy technique with dynamic programming model.
6. What does Floyd’s algorithm do?
7. State the stable marriage problem.
8. What do you mean by ‘perfect matching’ in bipartite graphs?
9. Give the purpose of lower bound.
10. What is the property of NP-Complete problem?

11 a Discuss in detail about mathematical analysis of non-recursive


algorithms.
OR
B Elaborate on asymptotic notations with examples.
ITEMS WEIGHT VALUE
1 7 $42
2 3 $12
3 4 $40
12 a Consider a Knapsack instance as follows.

The Capacity W=10.

OR
B Find all the solution to the travelling salesman problem (cities and
distances shown below) by exhaustive search. Give the optimal.

13 a Write the Huffman's Algorithm. Construct the Huffman's tree for the
following data and obtain its Huffman's Code.
OR
13 b Explain the memory function method for the knapsack problem and
give the algorithm.
14 a Describe in detail the simplex algorithm methods.
OR
14 b Outline the stable marriage problem with an example.

15 a Discuss the approximation algorithm for NP- hard problems.


OR
15 b Describe the backtracking solution to solve 8-queens problem.

16 a Discuss in detail about the mathematical analysis of recursive


algorithms.
OR
16 b Write the Floyd algorithm to find all pairs shortest path and derive its
time complexity.

1. Show the fundamental steps involved in algorithmic problem solving.


2. Compare and contrast algorithm and program.
3. Generalize the method of topological sorting.
4. List the various features of Brute Force algorithm and its applications.
5. Compare feasible and optimal solution.
6. Define principle of optimality.
7. What is an articulation point in graph?
8. What do you mean by ‘perfect matching’ in bipartite graphs?
9. What does Floyd's algorithm do?
10. Compare tractable and non-tractable problems.

11.a Analyze the rules for writing the algorithm.


OR
11. Point out the steps involved in the analysis framework.
b
12.a There are four people who need to be assigned to execute four jobs (one
person per job) and the problem is to find an assignment with the minimum
total cost. The assignment cost is given below, solve the assignment
problem by exhaustive search.
OR
12. Apply the DFS based algorithm to solve the topological sorting problem for
b following digraphs.

13.a Explain the Dijkstra’s shortest path algorithm and its efficiency.
OR
13.
Write the Huffman code algorithm and derive its time complexity.
b
14.a List the steps in Simplex Method and give the efficiency of the same.
OR
14. What is stable marriage problem? Give the algorithm and analyze it.
b
15.a Discuss the approximation algorithm for NP-hard problems
OR
15. What is Hamiltonian problem? Explain with an example using
b backtracking.

16.a Discuss in detail about Mathematical analysis of recursive algorithms.


OR
16. Solve Knapsack instance as follows.
b ITEMS WEIGHT VALUE
1 2 $1
2 3 $2
3 4 $8
4 5 $6
The Capacity W=8.

You might also like