Name : ……………………………………………………………

htt
Roll No. : ………………………………………………………..
Invigilator’s Signature : ………………………………………..

CS/B.TECH (CSE-OLD)/ IT (O),ECE (O), EE (O), EEE (O), ICE (O)/SEM-3/CS-302/2012-13

p:/
2012
DATA STRUCTURE & ALGORITHMS
Time Allotted : 3 Hours Full Marks : 70
/q
The figures in the margin indicate full marks.
pap
Candidates are required to give their answers in their own words
as far as practicable.

GROUP – A
er.

( Multiple Choice Type Questions )

1. Choose the correct alternatives for the following :

10 1 = 10
wb

i) Inserting a new node after a given node in a doubly

linked list requires

ut .

a) four pointer exchanges

b) two pointer exchanges

a c.

c) one pointer exchanges

d) np pointer exchange.
in

3001 (O) [ Turn over

CS/B.TECH (CSE-OLD)/ IT (O),ECE (O), EE (O), EEE (O), ICE (O)/SEM-3/CS-302/2012-13

ii) A complete binary tree with n leaves contains

htt
a) n nodes b) log 2 n nodes

c) 2n – 1 nodes d) 2 n nodes.
p:/
iii) A vertex of degree one is called

a) Isolated vertex b) Pendant vertex

/q
c) Coloured vertex d) Null vertex.
pap
iv) A sort, which iteratively passes through a list to

exchange the first element with any element less than it

and then repeats with a new first element, is called

er.

a) Bubble sort b) Selection sort

c) Heap sort d) Quick sort.

wb

v) The postfix equivalent of the prefix + ab – cd is

a) ab + cd – b) ab ± cd

c) ab + cd – d) abcd + – .
ut .

vi) A linear list that allows elements to be added or

removed at either end but not in the middle is called

a c.

a) stack b) queue

c) priority queue d) none of these.

in

3001 (O) 2
 CS/B.TECH (CSE-OLD)/ IT (O),ECE (O), EE (O), EEE (O), ICE (O)/SEM-3/CS-302/2012-13

vii) Which of the following methods had the best average

htt
case complexity for searching ?

a) Hashing b) Sequential search

p:/
c) Random search d) Binary search.

viii) The technique of linear probing for collision resolution

/q
can lead to

a) clustering
pap

b) efficient storage utilization

c) underflow
er.

d) overflow.

ix) If a binary tree is threaded for in-order traversal a right

wb

NULL link of any node is replaced by the address of its

a) successor b) predecessor

c) root d) own.
ut .

x) For a function f ( n ) = 1000 n log n + 500 n 4 + 0·52 n ,

we can say that f ( n ) is

a c.

a) O( n4) b) O ( n log n )

c) O(2n) d) none of these.

in

3001 (O) 3 [ Turn over

CS/B.TECH (CSE-OLD)/ IT (O),ECE (O), EE (O), EEE (O), ICE (O)/SEM-3/CS-302/2012-13

GROUP – B
htt
( Short Answer Type Questions )
Answer any three of the following. 3 5 = 15

2. Discuss the advantages and disadvantages of linked list over

p:/
array as linear data structure and also write down the

function to insert an element into a sorted array of

descending order.
/q
3. Define hashing. Explain with a suitable example the collision
pap
resolution technique using linear probing with open

addressing.

4. Define big O notation. What is stack and why is this called

er.

LIFO ?

5. Write the algorithm for in-order traversal of a threaded

binary tree.
wb

6. Prove that for any non-empty binary tree T, if n 0 is the

number of leaves and n 2 be the number of nodes having

ut .

degree 2 then prove

n 0 = n 2 + 1.
a c.

7. Write an algorithm to delete a node from a doubly linked list,

where a node contains one data and two addresses

( previous and next ) portion.

in

3001 (O) 4
 CS/B.TECH (CSE-OLD)/ IT (O),ECE (O), EE (O), EEE (O), ICE (O)/SEM-3/CS-302/2012-13

GROUP – C
htt
( Long Answer Type Questions )
Answer any three of the following. 3 15 = 45

8. a) Write the algorithm of binary search and calculate the

p:/
complexity for best, worst and average cases.

b) Why is queue data structure called FIFO ?

/q

c) Construct the following queue of characters where

pap

queue is a circular array which is allocated six memory

cells.
er.

FRONT = 2, REAR = 4 & QUEUE : …… , A, C, D, …… , ……

Describe the queue as the following operations take

wb

place :

i) F is added to the queue.

ut .

ii) Two characters are deleted from the queue.

iii) K, L, M are added into the queue.

a c.

iv) R is added to the queue.

v) One character is deleted from the queue.

in

3001 (O) 5 [ Turn over

CS/B.TECH (CSE-OLD)/ IT (O),ECE (O), EE (O), EEE (O), ICE (O)/SEM-3/CS-302/2012-13

9. a) How can a polynomial such as

htt
5x 8 + 600x 5 + 45x 2 – 5x + 56

be represented by a linked list.

b) Write the algorithm to reverse linked list.

p:/
c) What is dummy node in a linked list.

d) Write the function in c language to find the predecessor

of a node in linked list.
/q
10. a) The in-order & pre-order traversal sequences of nodes
in a binary tree are given as follows :
pap

In : D G B A H E I C F

Pre : A B D G C E H I F

Draw the binary tree. State the algorithm to construct

the tree.
er.

b) Insert the following keys in order given below to build

them into an AVL tree :
wb

g, h, s, l, e, m, t, u.

c) What is two-way threading ?

11. a) What is stack ?

ut .

b) Write the algorithm to evaluate postfix expression using

stack data structure, and hence evaluate following
postfix expression :
a c.

5 + 67 + –

c) Convert the following infix expression into equivalent

postfix expression :
in

a+b c+(d e+f) g.

3001 (O) 6
 CS/B.TECH (CSE-OLD)/ IT (O),ECE (O), EE (O), EEE (O), ICE (O)/SEM-3/CS-302/2012-13

12. Write short notes on the following :

htt
a) Quick sort

b) B-tree
p:/
c) Tail recursion

d) AVL Tree.
/q pap
er.
wb
ut .
a c.
in

3001 (O) 7 [ Turn over