Download Model question papers & previous years question papers
|
Posted By: PRANAY Member Level: Gold Posted Date: 19 May 2008
|
2007 Indira Gandhi National Open University (IGNOU) M.C.A Computer Aplications CS-04 €) : DATA STRUCTURES TI-IROUGH Question paper
|
|
|
PGDCA / McA (I Yr)
Term-End Examination
June, 2,OO7
CS-04 €) : DATA STRUCTURES TI-IROUGH
"c" & "PASCAL"
Time : 2 hours Maximum Marks : 60
Note t Question number 1 is compulsory. Answer any
three questions f rom the rest. All algorithms
should be writt;en nesrer to C or PASCAL
language.
l. (a) Write an algorithm to implement quick sort
technique. Also, show the steps of quick sort on
the following given numbers : 70
" 1 4 , 7 , 1 1 , 3 5 , g , 4 ! , 19"
cs-04@ P.T.O.
(b) A traditional tridiagonal matrix A is a square
matrix in which all elements other than those on
the major-diagonal and on the diagonals
immediately above and below this diagonal formed
by non-zero elements in the diagonals are stored
row-wise in a linear array B - the element Al1, 1l
being stored at B[1J. Obtain an access formula to
determine the position of element A[i, jl in the
array B. Asterisks in the 4 x 4 tridiagonal array
shown below mark the position of non-zero
elements.
Lll
the following items
h, r , P, d
sequence :
0
:r
I
I
(c) Write a program to count the nodes of a Binary tree. 70
2. It is intended to insert the following data item in a B-tree
of order 5
a g f b k d h m j e s i r x c l n t u p
Show how the tree would appear on deletion of each of
10
ln
cs-04@
10
3. (a) Find minimal spanning tree for the following graph.
Also show the steps involved in it,
(b)
4. (a)
(Weights have been shown along with the edges)
Differentiate between Depth first search and Breadth
first search techniqlnr.
Write an algorithm which translates an infix
expression to a postfix expression. What is the time
complexity of this algorifhm ?
Write a function in C language to insert the element
in Circular Queue.
5. Write short notes on the following (with their advantages
and disadvantages) :
(a) Direct File Organization
(b) Dynamic Memory Allocation
(b)
5
5
cs-o4o 2,000
Return to question paper search
|
|
|
Submit Previous Years University Question Papers and
make money from adsense revenue sharing program
Are you preparing for a university examination? Download model question papers
and practise before you write the exam.