Wednesday, December 23, 2015

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

Are you searching for IGNOU old question papers for MCA course revised ? You can here collect June 2012 question paper of term-end examinations for a subject "MCS-021 : DATA AND FILE STRUCTURES" . Read more details about this question paper below:

IGNOU MCA (Revised)
Term-End Examination
June, 2012
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) What are the pre conditions for applying binary search on any list containing Integer values ? Write the algorithm and manually run it on the following list of number : 10 27 2.3-56 38 66 45 . What is worst case complexity of the above algorithm ? 10 Marks

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!