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

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!

0 comments:

Pen down your valuable important comments below

Search Everything Here