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

htt
Roll No. : …………………………………………………………
Invigilator's Signature : ………………………………………..
CS/B.TECH (CSE,IT,ECE,EE(N),EEE,ICE)/SEM-3/CS-302/2010-11
p:/
2010-11
DATA STRUCTURE AND 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) Which of the following is the best time for an

algorithm ?
ut .

a) O(n)

b) O ( log 2 n )
a c.

c) O(2n )

d) O ( n log 2 n ).
in

3001 [ Turn over

CS/B.TECH (CSE,IT,ECE,EE(N),EEE,ICE)/SEM-3/CS-302/2010-11

ii) The Ackerman function, for all non-negative values of m

htt
and n is recursively defined as

A ( m, n ) =

i) n+1 if m = 0
p:/
ii) A ( m – 1, 1 ) if m ! = 0 and n = 0

iii) A ( m – 1 ), A ( m, n – 1 ) if m ! = 0, n ! = 0
/q
Therefore the value of A ( 1, 2 ) is

a) 4 b) 3
pap

c) 5 d) 2.

iii) The best case time complexity of Bubble sort technique

is
er.

a) O(n) b) O(n2 )

c) O ( n log n ) d) O ( log n ).
wb

iv) A linear list in which elements can be added or removed

at either end but not in the middle, is known as

a) queue b) dequeue

c) stack d) tree.
ut .

v) Which of the following sorting procedures is the

slowest ?
a c.

a) Quick sort b) Heap sort

c) Merge sort d) Bubble sort.

in

3001 2
 CS/B.TECH (CSE,IT,ECE,EE(N),EEE,ICE)/SEM-3/CS-302/2010-11

vi) In array representation of Binary tree, if the index

htt
number of a child node is 6 then the index number of
its parent node is

a) 2 b) 3
p:/
c) 4 d) 5.

vii) Maximum number of edges in a n-node undirected

graph without self loop is
/q
n(n–1)
a) n2 b) 2
pap
(n+1)(n)
c) n–2 d) 2 .

viii) Four algos do the same task. Which algo should execute
the slowest for large values of n ?
er.

a) O(n2 ) b) O(n)

c) O ( log 2 n ) d) O ( 2 n ).
wb

ix) The adjacency matrix of an undirected graph is

a) unit matrix b) asymmetric matrix

c) symmetric matrix d) none of these.

ut .

x) BFS constructs

a) a minimal cost spanning tree of a graph

a c.

b) a depth first spanning tree of a graph

c) a breadth first spanning tree of a graph

d) none of these.
in

3001 3 [ Turn over

CS/B.TECH (CSE,IT,ECE,EE(N),EEE,ICE)/SEM-3/CS-302/2010-11

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

2. a) Convert the following infix expression into equivalent

p:/
postfix expression using stack.

( A + B ) ✳ C – ( D – E ) / ( F + G ).
/q
b) What is dequeue ? 4+1

3. a) How a polynomial such as 6x 6 + 4x 3 – 2x + 10 can be

pap
represented by a linked list ?

b) What are the advantages and disadvantages of linked

list over an array ? 2+3
er.

4. Define Big O notation. Show that the function f ( n ) defined

by

F(1)=1
wb

F ( n ) = f ( n – 1 ) + 1/n for n > 1

has the complexity O ( log n ). 2+3

ut .

5. a) Write down the recursive definition for generation of the

Fibonacci sequence.

b) Assuming Fib ( n ) is a recursive function, draw a

a c.

recursive tree for Fib ( 6 ). 2+3

6. What is the precondition of performing binary search in an

array ? Write the Binary Search algorithm.
in

3001 4
 CS/B.TECH (CSE,IT,ECE,EE(N),EEE,ICE)/SEM-3/CS-302/2010-11

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

7. a) What is Circular queue ? Write Q-insert algorithm for

p:/
the circular queue. 1+4

b) Construct the expression tree for the following

expression : 2
/q
E = ( 2a + 5b ) ( x – 7y ) 4 .

c) Write the recursive function for the problem of Tower of

pap

Hanoi problem. 3

d) Write a C function for selection sort and also calculate

the time complexity for selection sort. 3+2
er.

8. a) Show the stages in growth of an order – 4 B-tree when

the following keys are inserted in the order given : 5

74 72 19 87 51 10 35 18 39 60 76 58 19 45
wb

b) How do AVL trees differ from binary search tree ?

Insert the following keys in the order given below to

build them into an AVL tree :
ut .

8 12 9 11 7 6

Clearly mention different rotations used and balance

a c.

factor of each node. 5

c) Explain with suitable example the principle of operation

of Quick sort. 5
in

3001 5 [ Turn over

CS/B.TECH (CSE,IT,ECE,EE(N),EEE,ICE)/SEM-3/CS-302/2010-11

9. a) Given the preorder and inorder sequence and draw the

htt
resultant binary tree and write its postorder traversal :

5
p:/
Pre-order : A B D G H E I C F J K

In-order : G D H B E I A C J F K
/q
b) Write non-recursive algorithm for inorder traversal of a
pap
binary tree. 5

c) Write an algoritm to search a node in a binary search

tree. 5
er.

10. a) Define ‘Hashing’. 2

wb

b) Explain with a suitable example the collision resolution

scheme using linear probing with open addressing. 5

c) What is index ? What are the various types of indexing ?

ut .

State the advantages of using indexing over a sequential

file. 5
a c.

d) Discuss the differences between command file and

executable file. 3
in

3001 6
 CS/B.TECH (CSE,IT,ECE,EE(N),EEE,ICE)/SEM-3/CS-302/2010-11

11. Write short notes on any three of the following : 3∞5

htt
a) Radix sort

b) Index sequential file ordering

p:/
c) Tail recursion

d) Threaded binary tree

/q
e) BFS vs DFS.
pap
er.
wb
ut .
a c.
in

3001 7 [ Turn over