RollNo.

(Printed Pages 5)

2760
B.Tech. Second Semester
Examination, 2010
Data Structures
PaPer : Sixth
fime

Allowed

:i,.,,|{ote

Three

H*rlls,

[Maximum Fla*s t 7O

Attempt any five questions' All questions carry equal marks.

(a) Derive an expression for finding address

of an arbitrary element of an n-dimensional arraY.

(b)

What are shortcomings of linear queue

and explain how circular queue is caP.T.O.

t760

6.

(a)

sparse matrix? Store following matrix

into any two representations

[o o 7
(a)

What do you understand by a

hr

function? List the desired propertie:

a good hash function.

i-o
2 oi
tt o
l0 1 0 0l
t4

2"

(b)

0{
o-]

32L 150 235 655 573 78

Find the preorder, postorder and inorder

traversals of the following binary tree:

Sort the following elements using

lection sort and Redix sort methods
92

Give only steps involved in procedu

7.

(a)

How will you define a Binary tree? H

a complete binary tree is different frr

a full binary tree.

(b)

How BFS differs from DFS? Exptain w

help of an example.
8.

Write short notes on any

two of the follo

ing :

(b)

Define an AVL tree. Construct one such

tree for the following list of elements-

35 20 50 10 23

32

(a)
(b)
(c)
(d)

Union and find algorithms

Garbage Collection
Threaded binary tree

Polynomialaddition

1oo.