RTU 2016 Question Paper Semester VI Electrical Engineering Data Structures in C

ot Io r [ec,rs,

cn Total No ot pages:
fl
Fr{ 6E3 113
F{ Tech. VI-Sem. (OId Back) Exam.,
m April/UI ay-2016
Edl Ele_ctrical Engineering
\0 6BES (O) Data Structures in C
Common for EE and EX
Time: 3 Hours
Maximum Marks: g0
Min. Passing Marks (Old Back): 24
Instructions to Candidate s : _

Attempt any five questions, serecting
one qaestion from each unit. Alr
Questions carry equal marks. schematic
diagrams must be shown
wherever necessary. Any data you
feer missing may suitabry be assumed
and stated clearly.
units of quantities used/ carcurated
must be stated crearry.
use offollowing supponing materiar
is permitted during examination.
1. NIL
2. NIL

UNIT.I
Q.1 (a) What do you understand by time_space
tradeoff?
t8l
(b) what is rate of growth of any function?
Exprain alr asymptotic notations
in
details.
t8l
OR
Q.1 (a) What is difference between array
and linked list?
t6l
(b) write an algorithm for creating and traversing
a doubly rinked list.

[6E3 113] Page 1 of3
ue4o I

UNIT.II
i6l'
major mapping'
Q.2 (a) Explain row and column
base address is 2000'
(b) There is a matrix A with 50 rows and 40 columns and the
the address of:
Size of data type is 2 byte' Calculate
12.s)
(i) A t20l [30] in row major maPPing
12.s)
(ii) A t17l [37] in row major mapping
L2.sl
(iii) A [49] [39] in column major mapping
12.s)
(iii) A t18l t7l in column major mapping
OR
How elements are
Q.2 (a) What do you understand by sparse matrix representation?
stored in sParse rnatrix?
i6l
(b) Write steps to add two sparse matrixes'
UNIT.III
linked
Q.3(a)Definestock?Explainitsbasicoperationandimplementstackusing
l8l
list.
fix expression:
(b) Transform each of the following infix expression into post
t4l
(i) ax(b+c)-dle

(ii) A+ (B*c-(DlE ^F) * G) *H
i4l

OR
solution
of Hanoi prollem and also write a recursive
Q.3 (a) write short note on Tower
for TOH Problem.
What are their uses? l6l
(b) What are dequeue and priority queues?

Page 2 of3 [1e40 ]

T]NIT.IV
-

Q.4 Write short notes on: t4l
(a) StrictlY binarY tree
l4l
(b) ComPlete binarY tree
t4l
(c) Almost comPlete binarY tree
t4l
(d) Binary search tree
OR
in height
Q'4WhatdoyouunderstandbyHeightbalancedtree?Explaintheinsertion
balanced tree.
-
Insert the following keys in AVL tree
t16l
A,Z,B, Y, C, X.
UNIT.V
with suitable examples -
Q.5 (a) Define the following terms t2)
(i) connected graPh
l2l
(ii) non-connectedgraPh
121
(iii) comPlete graPh
Lzl
(iv) directed graPh
t8l
(b) Define BFS and write steps to explain BFS'
OR
t16l
Expl{n its complexity in details'
Q.5 Write quick - sort algorithm?

Page 3 of3 [1e40 ]