Kuvempu University 2011 B.Sc Information Technology ember/ember Algorithms - Question Paper

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

Part-A
ans all the questions:
1. describe algorithm profiling. (2)
2. Differentiate ranging from static allocation and dynamic allocation. (4)
3. What is recusion? discuss. (3)
4. describe Full binary tree and complete binary tree. provide example. (4)
5. describe Graph. provide example. (3)
6. describe circular queue with example. (3)
7. describe Debugging. (2)
8. Compare Binary search with sequential search technique. (4)

Part-B
ans any 5 full questions:
1. Design an iterative and recursive algorithm to obtain the maximum among provided set of n elements(15)

2. describe the subsequent with example.
a) Depth of the tree (5)
b) Binary tree (5)
c) Queue (5)

3. Design and Simulate the working of binary search algorithm. (15)

4.
a) Design an algorithm to obtain the GCD of 2 numbers.(7)
b) Design an algorithm to obtain whether the provided graph is connected or not. (8)
5.
discuss the subsequent with example
a) In- order traverse (5)
b) Pre- order traverse (5)
c) Post- order traverse (5)
6.
a) discuss Time and Space complexity of an algorithm. (8)
b) Write an algorithm to sort a list of elements using quick sort. (7)
7.
a) discuss the dimensional representation of a binary tree. (8)
b) What is incidence matrix? discuss. (7)
8.
Write short notes on: (3*5= 15)
a) Linked list
b) Stack and in application
c) Merge- sort

Earning:   Approval pending.