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 :


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