Question Papers of IGNOU MCA-NEW MCS021


MCS021: Data and File Structure
Year: 2005 TEE: December Time 3 Full Marks 100
Note: Question 1 is compulsory. Answer any three from the rest. All algorithm shuld be written neerer to 'C' Language.

Q.2(a): Give simplified big-O notaion for the following functions:
(i) 30 n2 (ii) log n + 3n

Q.2(b): Define dequeve. Write an algorithm for the implementation of a dequee using arrays.: [15]

Q.3(a): Define a tree, and binary tree. What are the different ways of traversing a binary tree? Write an algorithm for any one of the traversal methods.: [14]

Q.3(b): Write an algorithm for the implementaion of Binary Search. What are its Space and Time complexities.?: [6]


home || << Previous || Next >>