3rd Sem Data Structures with C Jan 2016.pdf - Google Drive

For More Question Papers Visit - www.pediawikiblog.com 1CIC535

USN

Third Sernester B.E. Degree Exa

i Dec.2015/Jan.20l6

Data Structures with

G Max. Marks:1OCI

Time: 3 hrs.

{)

c.

a) !

?()

=^-,1 cO"

troo

4a.

b.

w

rJ
6 €G -?6)

co

b.

(S6 &{arirs)

g.

E

I a. Explain the functions supported by C to carry out dynamic memory anlocation with example.

lo

!

o. (o

-A

ib

(J

PART

ik

o

w

a)

m

Note: Answer FIVE full questioms, selecting at least TWO questions frow ewch part.

example.

(08 hfarks)

Show the binary tree with the arithmetic expression A/B*C*D+E. Give the algorithm for inorder, preorder, postorder traversals and show the result ofthese traversals. (08 tr{arks) What is heap? Explain different types of heap. (84 Marks)

For More Question Papers Visit 1-of2 www.pediawikiblog.com

,For More Question Papers Visit - www.pediawikiblog.com 10cs35

i)

Forests Graphs

iii) Slinner

I

a. b. c. d.

binary search tree.

trees.

(03 Marks)

Briefly explain the following with examples:

ii) WBLT

i) FIBLT

g.

b.

a

(05 Marks) (05 Marks)

m

Write a iterative search routine for Define the following terms:

ii)

7 a.

BCAEDGHFI

co

Inorde,r seq

Write short notes on:

i)

Fr:iority

queues ii) Binomial heaps iii) Priority heaps iv)

Write short notes on:

AVL

(08 Marks)

Fibonacci heafl;.Marks)

lo

c. d.

ii)

treers.

Red-black trees. Optimal binary search trees. Splalr {1ss5.

ib

b.

Define binary search tree. Draw the binary search tree for the following input 14, 15, 4,9,7, 18, 3, 5, 16, 4,20, 17,9, 14,5 {07 Marks) Construct abinary tree having the following sequences: i) Preordler seq ABCDEFGHI

ik

6 a.

w

w w

.p

ed

ia

w

*{