Kuvempu University 2012 B.Sc Information Technology .,(IT) s /e Algorithms - Question Paper

1. Part A compulsory
2. ans any 5 full ques. from part-B

Part-A
ans all questions: 25 Marks
1. describe Algorithm. (2)
2. What is Debugging and Profiling? (3)
3. provide at lowest 5 real life examples where we use stack operations. (2)
4. What is recursion and discuss. (3)
5. Difference ranging from static allocation and dynamic allocation (4)
6. describe Graph? provide example. (3)
7. describe adjacency matrix and explain? (5)
8. describe queue and mention the types? (3)

Part-B
ans any 5 questions:
1.
a) describe stack and write an algorithm for stack operations. (8)
b) discuss Incidence matrix. (7)
2.
a) Design an algorithm to illustrate insertion sort? (7)
b) discuss the subsequent (8)
i) Depth of the tree
ii) Binary tree
3.
a) Design and simulate the working of binary search algorithm? (10)
b) discuss BFS with an example. (5)
4.
a) Design an algorithm to obtain the GCD of 2 numbers? (7)
b) List out the merits and demerits of the recursion? (8)
5.
discuss the subsequent with example. (15)
i) In- order traverse
ii) Pre- order traverse
iii) Post- order traverse
6.
a) Trace out the algorithm quick sort on the data set 12, 1, 5, 7, 19, 15, 8, 9, 10? (8)
b) Design merge sort algorithm. (7)
7.
a) Differentiate ranging from selection sort and Merge Sort? (8)
b) describe the subsequent terms. (7)
i) Walk
ii) Path
iii) Connected graph
8.
Write short notes on:

a) Circular- queue (3)
b) Characteristics of an algorithm (3)
c) Tree (3)
d) Write an algorithm for generating fibonacci series. (6)

Earning:   Approval pending.