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.4(a): Difine an AVL tree. In case an AVL tree becomes unbalanced, how will you balance it? Explain with example(s).

This is Demo only. To get complete question paper Order Online


home || << Previous ||