Saurastra University 2006 B.Sc Information Technology Data & File Structure - Question Paper

B. Sc. (IT) (Sem. II) exam
April / May – 2006

Time : three Hours]
[Total Marks : 100

1
Attempt : (any two) 20

(a)
describe subsequent 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)
discuss applications of trees in arithmetic expression
and symbol table construction.
(c)
discuss any 2 tree traversing algorithms with
example :
(i)
In order
(ii)
Pre order
(iii)
Post order.
2
Attempt any 4 : 20

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

(a)
What is stack? Write a program to reverse a provided string
using stack.
SP-1944]
1
[Contd.
.




(b)
Write a program to implement PUSH ( ) and POP ( )
operations using Linked-list.
(c)
discuss different applications of stack.
4
Attempt any 4 : 20

(a)
What is the difference ranging from LIFO and FIFO? discuss
manipulation of queue in array.
(b)
What is circular queue? discuss how it resolves the
issue of overflow.
(c)
Write an algorithm to insert an element in circular
queue.
(d)
What is priority queue? discuss the use of it in
computer field.
(e)
discuss the difference ranging from array (static)
representation and linked (dynamic) representation of
data.
5
Write any 2 programs : 20

(a)
A program to implement singly linked list with create,
insert, delete and display choices.
(b)
A program to create sorted doubly linked-list.
(c)
A program to create circular linked list and print the
list five times using circular pointer.
SP-1944]
2 [ 300 / 7-9

Earning:   Approval pending.