Wednesday, December 23, 2015

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

IGNOU Question Papers / Previous Years Question Paper / Old Question Paper of MCS-021 : DATA AND FILE STRUCTURES
IGNOU University
No. of Printed Pages : 2
MCA (Revised)
Term-End Examination
December, 2013
MCS-021 : DATA AND FILE STRUCTURES
Time : 3 hours Maximum Marks : 100
(Weightage 75%)
Note : Question number 1 is Compulsory. Attempt any three questions from the rest. All algorithms should be written nearer to 'C' language.
1. (a) Write an algorithms for the insertion and deletion operations on the circular queue. 10
(b) Write a procedure to create, insert and display the content of a doubly linked list 10
(c) Explain "Depth First Search" Algorithm with an example. 10
(d) What is the need for external sorting ? Explain any one method to perform external sorting. 10
2. (a) Is it possible to implement multiple stocks using a Single Dimensional Array ? Justify your answer. 10
(b) Write an algorithm for sorting whose average and best time complexities are same. 10
3. (a) Create a binary search tree for following numbers start from empty BST 45, 26, 10, 60, 70, 30, 40. [10 Marks]

Scanned Copies of Question Paper :

Duraimani

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 www.IndianUniversityQuestionPapers.com . 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!