Anna University Chennai 2007 B.Sc Computer Science DESIGN OF ALGORITHMS - Question Paper

Computer Technology

DESIGN OF ALGORITHMS

(Common to B.Sc. info Technology)

PART A – (10 X two = 20 marks)

1. What do you mean by algorithm validation?
2. Compare direct and indirect recursive algorithms.
3. Show the binary decision tree for binary search. (assume no. of elements=14)
4. Write an algorithm for finding maximum and minimum in a straight forward
method.
5. State the principle of optimality.
6. Show the diagrammatic representation of graph with negative cycle.
7. Distinguish ranging from preemptive and non- preemptive schedule.
8. Define articulation point. provide example.
9. What is the total number of nodes in 8-queens state space tree?
10. What is Branch-and –Bound method?

PART B- (5 X 16 = 80 marks)

11. (i) obtain an optimal solution to the knapsack instance n-7, m=15 (6)

(p1, p2, p3 …….. p7) = (10,5,15,7,6,18,3) and
(w1,w2,w3,……w7) = (2,3,5,7,1,4,1)

(ii) Write an algorithm to obtain the shortest path from 1 node to every other node
in the graph. Illustrate with an example. (10)

12. (a) (i) What is algorithm? discuss the criteria to be satisfied in every algorithm. (6)

(ii) Devise an recursive algorithm to calculate the subsequent binomial coefficient.
Analyse its worst-case and best-case performance. (10)

n n!
--- = -----------
m m! (n-m)!

(b) (i) How do we analyze the performance of an algorithm? provide an example. (8)

(ii) discuss the different asymptotic notations used in algorithm. (8)





13. (a) (i) Write a recursive binary search algorithm. Analyze its time complexity. (8)

(ii) Sort the subsequent numbers using merge sort. (8)

310,285,179,652,351,423,867,254,450,220

Or
(b) (i) Write an algorithm for Quick sort. provide an example. (10)

(ii) Compare the performance analysis of merge sort and Quick sort. (6)

14. (a) (i) discuss the use of Traveling Salesman issue with an example. (10)

Or
(ii) Write a note on flow shop scheduling (6)

(b) (i) Write an algorithm to count the number of lead nodes in a binary tree?
What is its time complexity? (6)

(ii) discuss Depth 1st Search algorithm. (8)

(iii) describe spanning tree (2)

15. (a) explain the use of backtracking in solving 8-queens issue. Analyze its
Performance measures. (16)

or

(b) (i) Write down the control abstraction for LC- search (6)

(ii) discuss the method of solving knapsack issue using Branch-and-Bound
Technique.

Earning:   Approval pending.