Wednesday, December 23, 2015

IGNOU MCS-021 : DATA AND FILE STRUCTURES - MCA June 2013 Question Paper

Old question paper of IGNOU
MCA (Revised)
Term-End Examination
June, 2013
MCS-021 : DATA AND FILE STRUCTURES
Time : 3 hours Maximum Marks : 100
(Weightage 75%)

1. (a) Design algorithms for various operations performed on circularly linked list. 10
(b) What are the advantages of using lists than arrays while implementing a stack ? Explain. 10
(c) Write a procedure to find minimum cost spanning tree for a graph using Prim's algorithm. 10
(d) Explain the process of creating a Splay Tree using an example. 10
2. (a) Write a procedure to create, insert and display the content of a singly linked list. 10
(b) Propose any two representations for Sparse Matrices and compare them. 10
3. (a) Write a procedure to create, insert and delete an element in queue. 10



Share This
Previous Post
Next Post

Pellentesque vitae lectus in mauris sollicitudin ornare sit amet eget ligula. Donec pharetra, arcu eu consectetur semper, est nulla sodales risus, vel efficitur orci justo quis tellus. Phasellus sit amet est pharetra

0 comments:

Pen down your valuable important comments below