MCA Revised Exam Paper

IGNOU Question Paper

No. of Printed Pages : 2

MCA (Revised)

End Term-End Examination

June, 2011

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) Elaborate various asymptotic notations used to evaluate the efficiency of the algorithm. 10

(b) Explain in detail the push and pop operations in a stack. 10

(c) Explain in brief the AVL tree rotations. 10

(d) Solve the following instance of single source shortest paths problem with vertex 'a' as the source. 10

IGNOU Question Paper

No. of Printed Pages : 2

MCA (Revised)

End Term-End Examination

June, 2011

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) Elaborate various asymptotic notations used to evaluate the efficiency of the algorithm. 10

(b) Explain in detail the push and pop operations in a stack. 10

(c) Explain in brief the AVL tree rotations. 10

(d) Solve the following instance of single source shortest paths problem with vertex 'a' as the source. 10

## 0 comments:

Pen down your valuable important comments below