St. Xaviers College 2009 B.Sc Computer Science Data Structures - Question Paper

St Xavier's College(Autonomous)
Palayamkottai -627 002

DATA STRUCTURES
Internal Test
Time : 1.1/2 hrs
Max Marks:50
SECTION A

ans ALL the ques. 5*1 = 5

1. The link field in a linked list is used for
a)storing data values b) storing address c) address of storage pool d) all
2.If ptr points to any arbitrary node in linked list then which of the subsequent is accurate
a)ptr = ptr + one b) while ptr = five c) ptr = 10*2 d) ptr=0
3.The storage pool acts as
a) stack b) Queue c) linked list d) none
4. Number of nodes of full binary tree of depth five is
a) five b) 25 c) 32 d) none
5. Tree INORDER traversal is in correspondence with
a) postfix form b) infix form c) prefix form d) all

part B
ans Any 4 ques. 4*5 =20

6. discuss about the analysis of algorithm.
7. provide the procedures for adding and deleting item in a Stack.
8. How arrays are represented in memory?
9. provide the algorithm for polynomial addition using circular linked list
for EXP(A) = EXP(B) = -1.
10 How SPARSE matrix is represented with circular linked list? .
11. Write note on storage pool.

part C
ans Any 1 ques. 1*10 = 10

12 discuss different forms of SORT algorithm.
13 explain the MAZE issue with algorithm.

part D
ans Any 1 ques. 1*15 = 15

14 discuss about EQUIVALENCE procedure with example.
15. discuss about Aplication of Binary trees.

Earning:   Approval pending.