*SP-1944*

SP-1944 Seat No.__________

B. Sc. (IT) (Sem. II) Examination
April / May – 2006
Data & File Structure
Time : 3 Hours] [Total Marks : 100
1 Attempt : (any two) 20
(a) Define following terms : (any ten)
(i) Graph (ii) Initial node
(iii) Isolated node (iv) Outdegree
(v) Path (vi) Acyclic Graph
(vii) Loop (viii) m-ary tree
(ix) Leaf node (x) Elementary path
(xi) Branch node (xii) Ordered tree.
(b) Explain applications of trees in arithmetic expression
and symbol table construction.
(c) Explain any two tree traversing algorithms with
example :
(i) In order
(ii) Pre order
(iii) Post order.

2 Attempt any four : 20

(a) Write program/algorithm to sort an array using Bubble
sort.
(b) Explain the Binary search method using suitable
example.
(c) Explain selection. Sort method using suitable example.
(d) What is Data-structure? Explain non-premetive data
structures in detail.
(e) Explain the storage representation of two dimensional
Array.

3 Attempt any two : 20

(a) What is stack? Write a program to reverse a given string
using stack.
SP-1944] 1 [Contd..
 (b) Write a program to implement PUSH ( ) and POP ( )
operations using Linked-list.
(c) Explain various applications of stack.

4 Attempt any four : 20

(a) What is the difference between LIFO and FIFO? Explain
manipulation of queue in array.
(b) What is circular queue? Explain how it resolves the
problem of overflow.
(c) Write an algorithm to insert an element in circular
queue.
(d) What is priority queue? Explain the use of it in
computer field.
(e) Explain the difference between array (static)
representation and linked (dynamic) representation of
data.

5 Write any two programs : 20

(a) A program to implement singly linked list with create,
insert, delete and display options.
(b) A program to create sorted doubly linked-list.
(c) A program to create circular linked list and print the
list 5 times using circular pointer.

______________

SP-1944] 2 [ 300 / 7-9 ]