Wednesday, December 23, 2015

MCS-021 : DATA AND FILE STRUCTURES Dec 2012 IGNOU Question Paper

Are you looking for MCA revised IGNOU previous years question papers ? You can here download 2012 old question paper of MCS-021 : DATA AND FILE STRUCTURES . Image files of question paper are ready to download here under.

IGNOU Question Paper
MCA (Revised)
Term-End Examination
December, 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) Prove by Induction that :
(i) The number of leaves in a binary tree of height "h" is less than or equal to 2^h




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