Wednesday, December 23, 2015

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

MCA Revised Exam Paper
IGNOU Question Paper
No. of Printed Pages : 2
MCA (Revised)
End Term-End Examination
June, 2011
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) Elaborate various asymptotic notations used to evaluate the efficiency of the algorithm. 10
(b) Explain in detail the push and pop operations in a stack. 10
(c) Explain in brief the AVL tree rotations. 10
(d) Solve the following instance of single source shortest paths problem with vertex 'a' as the source. 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


Pen down your valuable important comments below