Questions Search

This website covers previous years question papers of various universities and colleges in India. Moreover, the information on admission to various courses from various universities/institutes/colleges are also available. Also the latest teaching faculty plus teachers jobs, Government jobs, Banking Jobs, and other jobs are regularly updated to help jobless candidates. Admit cards of various recruitment of Govt organisation are updated. Search your terms using the search box provided.

Follow by Email

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

No comments:

Post a Comment

Pen down your valuable important comments below