Questions Search

This website covers previous years question papers of various universities and colleges in India. Moreover, the information on admission to various courses from various universities/institutes/colleges are also available. Also the latest teaching faculty plus teachers jobs, Government jobs, Banking Jobs, and other jobs are regularly updated to help jobless candidates. Admit cards of various recruitment of Govt organisation are updated. Search your terms using the search box provided.

Follow by Email

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

No comments:

Post a Comment

Pen down your valuable important comments below