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




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