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
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

B.E Civil Engineer Graduated from Government College of Engineering Tirunelveli in the year 2016. She has developed this website for the welfare of students community not only for students under Anna University Chennai, but for all universities located in India. That's why her website is named as . If you don't find any study materials that you are looking for, you may intimate her through contact page of this website to know her so that it will be useful for providing them as early as possible. You can also share your own study materials and it can be published in this website after verification and reviewing. Thank you!


Pen down your valuable important comments below