Wednesday, December 23, 2015

MCS-021 : DATA AND FILE STRUCTURES IGNOU - MCA / BCA June 2014 Question Paper

Those who want to download IGNOU MCA / BCA Revised Old Question Paper for MCS-021 : DATA AND FILE STRUCTURES, can get June 2014 exam paper here under:

No. of Printed Pages : 2 MCS-021
MCA (Revised) / BCA (Revised)
Term-End Examination
June, 2014
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' are less than or equal to 2^h.
(ii) The number of nodes in a full binary tree of height 'h' are equal to (2^(h+1) - 1)
(b) Write an algorithm to implement Doubly Linked List. 10
(c) Compare Heap sort and Quick sort with each other. 10
(d) Write an algorithm for addition of two Sparse Matrices. 10
2. (a) Write an algorithm for insertion sort. Write step by step working of the algorithm for the following set of data. 43, 16, 11, 89, 32, 46, 1, 88
(b) What is a splay tree ? Write the steps involved in a top-down splaying procedure. 10

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!