Saurastra University 2006 B.C.A Computer Application Data Structure Through 'C' - Question Paper

SD-1872]
1
[Contd..
*SD-1872*
SD-1872
Seat No.__________B. C. A. (Sem. III) ExaminationMarch
/
April – 2006Data Structure Through 'C'
Time :
3
Hours]
[Total Marks : 100
1
ans any 4 of the subsequent ques. :
20
(i)
What is data structure? Highlight its importance in thefield of programming.
(ii)
What do you mean by memory allocation? Specify the typesof memory allocation and discuss every in detail.
(iii)
What is binary tree? discuss with suitable programexample how you will create a binary tree in ‘C’ language.
(iv)
What is traversal? Write algorithm for in-order, pre-orderand post-order traversal of binary tree.
(v)
Write an algorithm that will split a linked list into two-linked list, so that successive nodes go to various lists (i.e.The first, 3rd and all odd-numbered nodes to the firstlist and the second, 4th and all even-numbered nodesgo to the second).
2
Attempt any 4 of the subsequent :
20
(i)
Write ‘c’ program to multiply 2 matrices.
(ii)
Write algorithm/program to insert node in queue.
(iii)
Write algorithm/program to pop element from stack inlinked allocation.
(iv)
Write algorithm/program to reverse a string using stacktechnique.
(v)
Write algorithm/program to create ordered linked list.
3
(a)
ans any 2 of the following:
10
(i)
Show pictorial representation of queue after every pop/push operations on queue(1)
push values 6,4,5,6
(2)
pop 2 values
(3)
push 5,9,6
(4)
pop 1 value.
(ii)
Create Binary trees for subsequent expressions:
(1)
((a+b)-c) * d – e + f
(2)
A * (-b) / (c+d) $ e (‘$’ indicates exponent).
(iii)
provided a linked list whose typical node consists of anINFO and LINK field, prepare ‘C’ program which willcount number of nodes in list.
(b)
Write short notes on subsequent : (any two)
10
(i)
Linked dictionary
(ii)
Application of binary tree
(iii)
Graph.
4
discuss the subsequent terms : (any ten)
20
(i)
Header node
(ii)
Node
(iii)
Binary tree
(iv)
Root node
(v)
Terminal node
(vi)
Non-terminal node
(vii)
Indegree
(viii)
Outdegree
(ix)
Complete binary tree
(x)
Strictly binary tree
(xi)
Mix graph
(xii)
Directed edge.
5
Attempt any 4 of the subsequent :
20
(i)
discuss procedure to insert element into an array with anexample.
(ii)
What is stack? provide & discuss application areas of stack.
(iii)
discuss with example how array of structure (‘C’ language)is stored in memory.
(iv)
discuss circular queue. discuss position of empty circularqueue with six rooms after every of subsequent operation :
(a)
insert 99
(b)
Insert 88
(c)
Insert 66
(d)
Insert 55
(e)
insert 44
(f)
delete 99
(g)
Delete 88
(h)
Insert
33
(i)
Insert 22
(j)
Insert 11
(v)
discuss doubly link list with example. How it differs fromsingly link list ?
____________
SD-1872]
2
[ ]

Earning:   Approval pending.