My Profile
Active Members
TodayLast 7 Days
more...
Awards & Gifts
Online Exams
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian
cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
|
Download Model question papers & previous years question papers
|
Posted By: PRANAY Member Level: Silver Posted Date: 20 May 2008
|
2007 Indira Gandhi National Open University (IGNOU) M.C.A Computer Aplications MCS-021 €): DATA AND FILE STRUCTURES Question paper
Mcs-ozt@
MCA (Revised)
Term-End Examination
June, 2OtO7
MCS-021 €): DATA AND FILE STRUCTURES
Time : 3 hours Maximum Marks : 700
(Weishtage 750/o)
Note 3 Quesf ion number 1 is compulsory. Attempt any
three quesfions f rom the rest. AII algorithms
should be written nearer to 'C language.
l. (a)
3:i:: i,
multiple stack, Write algorithm for its
implementation.
(b) Write an algorithm to subtract two polynomials using
linked list.
(c) Write down the Quick Sort Algorithm and show each
step of it using the following l/P.
t 65 , 70, 75,80, 60, 65,50, 45 I
10
1 0
10
MCS-021 @ 1 P.T.O.
(d) Write down the Dijkstra's Algorithm and list the
shortest path from V0 to V' V 2, V3 and V4 using
the same algorithm . , 10
2.. (a) Write an algorithm to implement Queue using
Array
Linked List. 10
(b) Write an algorithm for insertion sort. Find the
best-case and worst-case time complexity for this
algorithm. Execute your algorithm manually on the
7 0 following list of numbers.
1 2 2 , 1 9 , 1 6 , 4 9 , g , L 7 , g l
(i)
(ii)
10 15
Mcs-021 @
3. (a) Write an algorithm to implement DFS and
BFS-spannin g tree. Also find out the spanning tree
for the graph shown below using the mentioned
methods. 10
(b) Show the working
following graph :
of Kruskal method on the
70
P.T.O.
1
4
( 2 3
7 5 6 )
MCS-021 o
4. (a)
5. (a)
(b)
Write an algorithm to perform following functions on
1 0 an AVL binary tree :
(i) Insert an element
(ii) Delete an element
Write recursive algorithm for in-order and pre-order
traversal of binary tree. Also, construct the binary
tree using the following pre-order and in-order
traversals :
Pre-order : A
In-order : B
70'
B G H M C D E F
H M G A D F E C
(b)
Write short notes on :
(i) Sequential File and Indexed File Structure
(ii) Asymptotic Notations
(iii) Sparse Matrix
(iv) Dynamic and Static Data Structure
Write an algorithm for evaluating postfix expression.
Show working of your algorithm on the following
expression
1 g , 5 , + , 6 , 8 , 2 , / , + , * J
10
rc
3,000 MCS-021 @
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.
|
Watch TV Channels
|