DOWNLOAD THIS FREE AT www.vturesource.

com 06CS43

MODEL QUESTION PAPER-1

Fourth Semester B.E. Degree Examination, June/July 2008
COMPUTER SCIENCE / INFORMATION SCIENCE ENGINEERING
Analysis and Design of Algorithms
Time : 3 hours Max Marks:100

Note: Answer atleast two full questions from each part.

PART -A
1. a. With the help of a flowchart, explain the various stages of algorithm and design
process. (08 marks)
b. Explain any three fundamental problem types. (06 marks)
c. Let A be the adjacency matrix of an undirected graph. Explain what properties of the
matrix indicates that
i. The graph is complete
ii. The graph has a loop
iii. The graph has an isolated vertex (06 marks)

2. a. Explain the worst-case , best-case and average case efficiencies of an algorithm

with help of an example. (08 marks)
b. Explain the general plan for analyzing the efficiency of a recursive algorithm.
(08 marks)
c. Solve the following recurrence relations.
i. x(n) = x(n-1) + 5 for n >1 , x(1)=0
ii. x(n) = 3x(n-1) for n > 1, x(1) =4 (04 marks)

3. a. What is brute-force method? Write a brute-force string matching algorithm.

Analyze its complexity. (08 marks)
b. Write the quick sort algorithm. Analyze its efficiency. Apply the algorithm to sort the
list { 4, 1, 6, 3, 9, 2, 7, 5}. (12 marks)

4. a. Explain how the Divide-and-Conquer strategy is used to multiply large integers.

Apply the same to compute 2101 * 1130. (10 marks)
b. Explain the Johnson Trotter algorithm for generating permutations. Generate the
permutations for the given set {1, 2, 3, 4} by
i. Bottom-up minimal change algorithm
ii. The Johnson Trotter algorithm
iii. The lexicographic order algorithm (10 marks)

ALL BRANCHES | ALL SEMESTERS | NOTES|QUESTION PAPERS|LAB MANUALS |

FREE AT
www .vturesource.com
Page 1
DOWNLOAD THIS FREE AT www.vturesource.com 06CS43

PART -B
5. a. Explain Transform-and-Conquer technique. What are the major variations of this
technique. (06 marks)
b. Explain the different rotations of AVL tree. Construct an AVL tree for the input
sequence 3,6,5,1,2,4 (10 marks)
c. Construct a 2-3 tree for the data of 5 (b) above. (04 marks)

6. a. Explain the different types of hashing. For the input 30,20,56,75,31,19 and hash
function h(K) = 2K mod 11 , construct the open hash table. (08 marks)
b. What are memory functions? Explain how they are used to solve the knapsack
problem . Solve the instance of the knapsack problem below. Capacity W= 5
Item Weight Value
1 2 $12
2 1 $10
3 3 $20
4 2 $15
(12 marks)
7. a. i. Construct a Huffman code for the following data
Character A B C D -
Probability 0.4 0.1 0.2 0.15 0.15
ii. Encode the text ABACABAD using the code of (i) above.
iii. Decode the text whose encoding is 10001011100101 in the code of (i) above.
(10 marks)
b. What are decision trees? Explain the concept of decision trees for sorting algorithms.
(10 marks)

8. a. Distinguish between P, NP and NP-complete problems. Give examples for each

category. (10 marks)
b. Apply backtracking to solve the following instance of the subset sum problem
S={5,1,4,3} and d=11. (10 marks)

ALL BRANCHES | ALL SEMESTERS | NOTES|QUESTION PAPERS|LAB MANUALS |

FREE AT
www .vturesource.com
Page 2