20495 20495 20495 20495 20495 20495 20495 20495 20495

20495 Roll No.

20495 20495 20495 20495 20495 Total20495
No. of Pages
20495 : 02 20495

Total No. of Questions : 09

B.Tech.(Computer Science Engg.) / (IT) (Sem.–3)
20495 20495 DATA STRUCTURES
20495 20495 AND PROGRAMMING
20495 20495 METHODOLOGY
20495 20495 20495

Subject Code : CS-207

Paper ID : [A0454]
20495 Time : 3 Hrs.
20495 20495 20495 20495 20495 Max. Marks
20495 20495 : 60 20495

INSTRUCTIONS TO CANDIDATES :
1. SECTION-A is COMPULSORY consisting of TEN questions carrying T WO marks
20495 20495
each. 20495 20495 20495 20495 20495 20495 20495

2. SECTION-B contains FIVE questions carrying FIVE marks each and students
have to attempt any FOUR questions.
3. SECTION-C contains T HREE questions carrying T EN marks each and students
20495 20495
have to20495
attempt any 20495 20495
T WO questions. 20495 20495 20495 20495

20495 20495 20495 20495

SECTION-A
20495

o m
20495 20495 20495 20495

.r c
1) Write briefly :

m
20495 20495 20495are the advantages
(a) What 20495 20495
and disadvantages of20495
linked list over20495
Arrays? 20495 20495

p e
(b) Which data structure will be used in recursion?
o
a .r c
20495 20495 20495 20495 20495 20495 20495 20495 20495
(c) Define height balanced tree with example.

r p e
(d) A full binary tree with 2n+l node contains how many leaf nodes?
20495 20495 20495

b 20495 20495 20495

a p
20495 20495

(e) Graphically show the Deletion of an element from the circular queue implemented as
linked list.
20495

rp
20495 20495 20495 20495 20495 20495 20495 20495 20495
(f) A linear Array A is given with lower bound as 1. If address of A[20] is 360 and

20495 20495 20495

(g) Define sets. How20495 20495
sets are represented
b
A[30] is 390, then find address and word size of A[16].

20495
in memory? 20495 20495 20495

(h) Define Big Omega and Theta notation.

20495 20495 20495 20495 20495 20495 20495 20495 20495
(i) What are the initial conditions required to implement binary search?

(j) What is a file? What are the basic operations performed on file system?
20495 20495 20495 20495 20495 20495 20495 20495 20495

20495 1|M
20495 - 56504 20495 20495 20495 20495 20495 (S2)-3047
20495 20495

20495 20495 20495 20495 20495 20495 20495 20495 20495

20495 20495 20495 20495 20495 20495 20495 20495 20495

SECTION-B
20495 20495 20495 20495 20495 20495 20495 20495 20495

2. How can the stack empty and stack full conditions be checked? Write code for the same.

20495 3.
20495 Write an algorithm to20495
20495 insert “Navjot” into the following
20495 20495 array : 20495 20495 20495

0 1 2 3 4 5 6
Aena Hamid Miara Somi Tina
20495 20495 20495 20495 20495 20495 20495 20495 20495

4. What is hash collision? Explain technique’s to resolve a collision.

20495 5.
20495 Write an algorithm to20495
20495 implement linear
20495search. 20495 20495 20495 20495

6. a) Describe linked representation of Binary Tree in memory with diagram.

20495 20495 20495 20495 20495 20495 20495 20495 20495
b) Construct a binary search tree from the following elements and traverse the tree using
postorder traversal method :

20495 20495 51 20495 82 92

20495 35 20495 95

o m 6
20495 1820495 59 20495 42 20495

20495 20495 20495 20495

SECTION
20495
C
.r c 20495 20495

m
20495 20495

7. Given the following List :

p e o
82 292
a 235 195 9620495 198

.r c 19 119
20495 20495 20495 20495 20495 20495 20495 20495

complexity
r
of both sorting p
techniques.
e
Apply the merge sort and radix sorting technique to sort the list. Also compare the time
(10)
20495 20495

8.
20495

b 20495 20495 20495

a p
20495 20495

(a) Differentiate between depth-first and breadth first search traversal of a graph. (6)
20495

(b) Transform the following expression

rp
20495 20495 20495 20495 20495 into postfix and pre-fix expressions
20495 20495 showing
20495 each 20495

step of conversion properly. ((A+B)*C–(D–E)/(F+G) (4)

20495
9.
20495
Write an algorithm to20495
20495
insert anode into
20495
and draw the same by taking an example.
b
a circular 20495
header linked list
20495
at a specific position
20495
(10)
20495

20495 20495 20495 20495 20495 20495 20495 20495 20495

20495 20495 20495 20495 20495 20495 20495 20495 20495

20495 2|M
20495 - 56504 20495 20495 20495 20495 20495 (S2)-3047
20495 20495

20495 20495 20495 20495 20495 20495 20495 20495 20495