3rd Sem Data Structures with C Jan 2016.pdf

Viewer
Transcript

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
F.

st

2 a. b. c.

What is recursion? What are the various types of recursion? Write a recursive function to (s? Marks) implement binary search. Define the term "space and time complexity". Determine the tirne co.rnplexity of an iterative and recursive functions that adds n elements of an array using tabular method. (07 Marks) (06 ['trarks] Write a note on dynamically allocated array's with example. How rvould you represent two sparse polynomials using array of stmcturr;s and also write a (10 Marks) function to add two polynomials and give the analysis of the function. For the given sparse matrix A and its transpose, give the tripiet representation 'A' is the given sparse matrix and 'B' will be its transpose.

QI

Sparse

matrix A =

50<

3a. ir.

tix o

0 0

0 0

Define stack. Implement push and pop functions for stacks using arra'ys. Write the postfix form of the following expressions using stack:

I (l.

>1

'+

ooo 'E': F>

4a.

b.

w

rJ<

; z

5a.

r:.

b.

(S4l\4arks)

Write C functions to implernent the insert and delete operations on a queue using linked list. (08 Marks)

lMith the node structure show how would you store the given polynomiais a and b in linked (0tl Marks) list? Write a C function for adding 2 polynomials using linked lists. Write a note on doubly linked list. How is it different from single linked list? ($4 N{arks)

PART _ B What is binary tree? State its properties. How it is represented usinS; array and iinked list? Girre

o

{odvtrarks)

What is the advantage of circular queue over linear queue? Write insert and delete functicns (05 Marks) for circular implernentation of queues. * Eyaluate the fbllowing postfix expression 623 + -3 821+ 2 $ 3 + using stack.

w w

:q

{05 Marksi

i) A$ts*C-D+E/F/(G+H)

.p

t.

O:

(04 iVlarks)

0

i0 A-B(C*D$E)

_-I

=e

-10

ed

:Y

2s 0 0 ii 0 0t2 3 00 UL} 60 0 0 00 00 00 8l 00 0 0 -18 00

ia

oO

-o >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

*{<*{<*

2

of2

For More Question Papers Visit - www.pediawikiblog.com

(20 Marks)

Programming in C & Data Structures Jan 2016 - 2015 Scheme.pdf ...