Kuvempu University 2011-4th Sem B.Sc Information Technology (I.T.) , ./ (Distance Education) ALGORITHMS - Question Paper

[Max.Marks:100,Time:3 hrs]



Instructions : 1) Part A is compulsory.
2) ans any 5 full ques. from Part B.
PART – A

ans all the questions:

1.Define algorithm profiling. (2)

2.Defferentiate ranging from static allocation and dynamic allocation. (4)

3.What is recusion? discuss. (3)

4.Define full binary tree and complete binary tree. provide example. (4)

5.Define Graph.Give example. (3)

6.Define circular queue with example. (3)

7.Define Debugging. (2)

8.Compare Binary search with sequential search technique. (4)

PART - B

ans any 5 full ques..

1.Design an iterative and recursive algorithm to obtain the maximum among provided set of n elements.(15)

2.Define the subsequent with example.
a.Depth of 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.Explain the subsequent with example

a.In-order traverse (5)

b.Pre-order traverse (5)

c.Post-order traverse(5)

6.a)Explain Time and Space complexity of an algorithm. (8)

b)Write an algorithm to short a list of elements using quick short.(7)

7.a)Explain 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.