D 4032

B.E./B.Tech.DEGREE EXAMINATION, MAY/JUNE 2007'

Third Semester
Electronics and Communication Engineering
CS 1151- DATA STRUCTURES
(Regulation 2004)
Maximum : 100 marks

Time : Three hours

Answer ALL questions.

co
m

PARTA-(10 x2=20 marks)

List out and define the performancesmeasures of an algorithm.

2.

What is Recursion?Explain rvith an example.

3.

Define ADT.

4.

How do you push and pop elements in a linked stack?

5.

Defrne binary search tree.

6.

List out the various techniques of hashing

7.

What is the worst casecomplexity of Quick sort?

B.

State the algorithmic technique used in merge sort.

g.

Prove that the number of odd degree vertices in a eonnectedgraph should be

even.

10.

Define NP hard and NP ComPlete.

ww

w.

aa
na

va

N.

1.

PARTB-(5x16=80marks)
11.

(a)

(i)

Develop an algorithm for binary search. Vaiidate the algorithm

(10)
with a suitable data set.

(ii)

What is Top down approach? Explain.

(6)

Or
(b)

Derive the best, average,worst casetime complexity of a Iinear search.

L2. (a)

Write ADT operations for array implementation of polynomial addition.

Or

(b)
13. (a)

Write ADT operations for atray implementation of a queue.

Write insertion algorithm for AVL Tree.
algorithms.

Write suitable rotation

Or
(b)

14. (a)

(i)

Explain the algorithm for separate chaining.

(8)

(ii)

Explain implementation of priority quetle.

(8)

Write ADT operations for heap sort. Using the above algorithm, sort the
following:
35 45 25 rr 6 85 1735.

(ii)

Explain external sorting. Give relevant example.

(8)
(8)

Explain Dijkstra's algorithm using the follou'ing graph' Find the shortest
path betweenv1 to v2, v3, v4, v6, v7'

(b)

w.

aa
na

va

(a)

Expiain the quick sort algorithm.

Or

(i)

Write ADT operationfor Prim's algorithm.

(8)

(ii)

Explain the topologicalsort algorithm.

(8)

ww

15.

(i)

N.

(b)

co
m

Or

D 4032