Scribd
Upload
26 views2 pages

ADAMODELPAPER2

The document is an exam paper for an algorithms design and analysis course. It contains multiple choice and long answer questions covering topics like the travelling salesman problem, dynamic programming, NP-complete problems, approximation algorithms, and randomized algorithms.

Uploaded by

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

ADAMODELPAPER2

The document is an exam paper for an algorithms design and analysis course. It contains multiple choice and long answer questions covering topics like the travelling salesman problem, dynamic programming, NP-complete problems, approximation algorithms, and randomized algorithms.

Uploaded by

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

SITE18

April -2021
II B.Tech II Semester Regular Examinations
Algorithms Design And Analysis

Subject Code: 18CSCST4040

Time: 3hrs Max.Marks: 70


___________________________________________________________________
Instructions:
1. Answer all the questions from Part-A. Each question carries one mark.
2. Answer one full question from each unit in Part-B. Each full question carries 12 marks
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
PART – A

1 (a) What is Travelling Sales Man Problem? Explain [1M]


(b) State the Job – Sequencing Deadline Problem. [1M]
(c) Define Backtracking? List the applications of Backtracking. [1M]

(d) State the Subset Sum problem. [1M]


(e) Define Minimum Cost Spanning tree and list its applications. [1M]
(f) Define All Pairs Shortest Path problem [1M]
(g) Define NPC. [1M]
(h) State vertex cover problem. [1M]
(i) Discuss divide and conquer strategy. [1M]
(j) What is contention resolution. [1M]
2 a) Determine an LCS of <1,0,0,1,0,1,0,1>and <0,1,0,1,1,0,1,1,0>. [6M]
b) Generalize Huffman’s algorithm to ternary codewords (i.e., codewords [6M]
using the symbols 0, 1, and 2), and prove that it yields optimal ternary
codes
OR

3 a) Generate the algorithm to compute 0/1 Knapsack problem using dynamic [8M]
programming and solve n = 3; (W1, W2, W3) = (3, 5, 7); (P1, P2, P3) =
(3, 7, 12); M = 4.
b) Compare Greedy vs Dynamic programming [4M]

4 a) What is a Hamiltonian Cycle? Explain how to find Hamiltonian path and [6M]
cycle using backtracking algorithm.

1
b) Explain Travelling sales person person problem LCBB procedure with the [6M]
following instance and draw the portion of the state space tree and find an
optimal tour.

OR

5 a) Give the statement of sum of subsets problem. Find all sum of subsets for [8M]
n=4, (w1, w2, w3, w4) = (11, 13, 24, 7) and M=31.Draw the portion of
the state space tree
b) What is LC – Search? Discuss LC – Search algorithm. [4M]

6 a) What is Minimum cost spanning tree? Explain an algorithm for [8M]


generating minimum cost spanning tree and list some applications of it.
b) Distinguish bellman ford and dijkstras algorithms for finding shortest [4M]
paths.
OR
7 a) Compare BFS and DFS algorithm with an example graph and denote its [12M]
time complexities

8 a) Explain the verification algorithm for Hamiltonian path. [7M]


b) Briefly discuss about circuit satisfiability problem. [5M]
OR

9 a) By using NP complete solve the sum of subset problem with one example [6M]
b) Explain formula satisfiability and 3CNF satisfiability . [6M]

10 a) Explain the Performance ratios for approximation algorithms [12M]


OR
11 a) Explain randomized algorithms. [4M]

b) Discuss the center selection problem with an example. [8M]


>>>>>>>>>>>>>>>

You might also like