Scribd
Upload
73 views3 pages

Dec - 2021 MCS-21

Uploaded by

sky200417
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
73 views3 pages

Dec - 2021 MCS-21

Uploaded by

sky200417
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

No.

of Printed Pages : 3 MCS-021

om
MCA (Revised) / BCA (Revised)

Term-End Examination

.c
December, 2021

ru
MCS-021 : DATA AND FILE STRUCTURES

u
tG
Time : 3 hours Maximum Marks : 100
en (Weightage : 75%)

Note : Question number 1 is compulsory. Attempt any


three questions from the rest. All algorithms
m
should be written near to ‘C’ language.
ign

1. (a) What is sparse matrix ? Explain 3-tuple


representation of sparse matrix with the
ss

help of a suitable example. 10


UA

(b) Write the process for converting the following


infix expression into postfix expression using
NO

stack : 10
X * Y * (Z|P – Q) * T + R
IG

MCS-021 1 P.T.O.
(c) Find the Adjacency Matrix for the
following graph : 5

.c om
uru
tG
(d) Write an algorithm to create a doubly-linked
list and addition of elements to it. 5
en
(e) Find the minimum cost spanning tree for
the following graph using Prim’s algorithm :
m
ign
ss
UA

3
NO

Show all the intermediate steps of the


IG

process. 10

MCS-021 2
2. (a) Write the Depth First Search (DFS)
algorithm and travel the following graph

om
using DFS algorithm : 10

.c
ru
(b) Explain Indexed Sequential File
organization with the help of an example.

u
Also write its advantages. 10

tG
3. (a) Write an algorithm for addition of two
polynomials. en 10
(b) What is Heap Sort ? What is its complexity ?
Explain how a heap is created using an
example. 10
m

4. (a) Explain how Static memory allocation is


ign

different from Dynamic memory allocation.


In which situation is Static memory
allocation a better choice ? Explain briefly. 10
ss

(b) Briefly explain AA-Trees. 10

5. (a) Write an algorithm to add two matrices


UA

using arrays. Also find the time complexity


of this algorithm. 10
(b) Write short notes on the following : 25=10
NO

(i) Forest
(ii) Priority Queue
IG

MCS-021 3 P.T.O.

You might also like