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
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
0 comments:
Pen down your valuable important comments below