Click Here to read answers

M Roll No. �- _
___ ---. Tot
al No. of Pn!CS :0
� { 3El6i-t612 ]
M B. Tech. (Sem. Ill) (Main/ Back) Examination, December - 2017
�
!
Computer Sc. & Engineering
� 3CS2A Data Structures and Algorithms
I
_, CS, IT, EX, EC, EI
Time : 3 Hours Maximum Marks 80
Min. Passing Marks 26
Attempt ay ive questions, selecting o,re question from each unit.
All Questions carry equal marks. Schematic diagrams mus be
t
shown wherever necessary. Any data you Jee! ,r,issing suita
bly be
assumed and stated clearly. Units of quantities
used / calculated
must be stated clearly.

Use of following supporting material§ is' permitted during examination.

(Mentioned in form }./o. 205)

. Nil 2. Nil

UNIT � I

1 Deine algorithm. What do you understand by best, worst and average case
analysis of an algorithm.
8
bJ Using suitable example explain row major and c�lumn major form of aray.
�
OR
1 (a) Explain the diiculties in 'esti�atin� exact_ �xecution time _of Algorithnls.
8
(b 1 Explain Asymptotic notations : Big-Oh, theta, Omega using sui:able example.
8
3E1652-1612 J 1 I P.T.O.

Click Here to read answers

Click Here to read answers

UNIT . II
/-

f
vf Deine he concept of. rec rsion Using s ack sing s i able e am
What are he difficul ies_ m dealing wi -.ini .,e pression ? p 1es.
. .

4 Con er ollowing e pressions in i s eq i alen postix expressions.

8

rA*(B+C*D)+E

1 A*B"C+D

8
OR
2 a) E plain ower of Hanoi problem. E plain sing s
ui able diagram and
e ample.

8
(b) Explain _transposition of sparse matrices with algorithms of varying
comple 1 .
8
UNIT - III

3/ compare binar search and seq en ial search. ,,

8
. (bY Using sui able diagram e plain the concept of Head Node in linked lis s..
.8
OR
3 (a) Wri e the algorithm for insertion and dele ion in doubl and circ larl
connected linear linked li .
8
(b) Write down the following pol nomial.
4
3x - 2x
2
+ 9x -11 b a linked list.
8
3El652-1612 ] 2 [ P.T.O.

Click Here to read answers

 Click Here to read answers

VNlt . IV

tion into
4 (al Deine he concep of balanced ree . W ite p e do code or inse
7 and deletion rom AVL ree. 8

Dei ne he dife ren a plica i on of t ee fo r e re enta ion of e s_.

(b) 8

OR
4 (a) Deine he following bina t ee
,,
() Complete binary ee.
(ii) Stri c ly bina tree.
8

(b) Wri e an algorithm .for inorder ra e al of a threaded bina tree.

UNIT - V

5 (a) Com a e Intenal o ing and E te al orting.

8
(b) B _ taking s itable e ample explain the inci le of ope ation of hea o .
8
(c) Pr ve tha .He!e_ s rt, Merge ort and Q ick ort akes n (n l g n) ie in
he wo t case.

OR
¥ Wri e hor no es on following :
. V DFS aver al Algo ithm
8
. (b com arison of or ing Algo i hms in erms f ime com le i .

JE1652-1612 J J
r 12440 1
Click Here to read answers
Similar Papers

B.TECH 3rd sem Data Structures and Algorithms paper 2016