Test Papers / Previous Question Papers of IGNOU CS04 Data Structures through C and PASCAL December 2006

Time : 2 hours
Maximum Marks : 60

Note: Question number 1 is compulsory. Answer any three questions from the rest. All algorithms should be written nearer to 'C' or 'PASCAL' language.

1 . (a) Write an algorithm and program code to implement merge sort technique. (10)

(b) Define solar system as two dimensional array whose elements can be accessed using STAR and PLANET for the first subscript and SUN, EARTH, VENUS, MOON, MERCURY as the second subscript. (5)

(c) Write a C-function to insert an element Into a AVL tree. (10)

(d) Find the value of the following : (5)

(i) abs (trunc (— 36.9))
(ii) round(+ 14.6)
(iii) trunc (sqrt (round (3.4)))
(iv) abs (round (13.46) — round (18.67))
(v) ord ('p')

2. (a) Write an algorithm which translates a postfix expression to a prefix expression. What is the time complexity of the algorithm? (6)

(b) Write a program to exchange values of two variables using pointers. (4)

3. (a) Write an algorithm to compute the height of a given Binary Tree. (3)

(b) Explain the indexed sequential file organization. Write a program to insert the following records into file 'PERSONAL'.

(i) Adam Bede, 47, Engineer
(ii) Silas Mamer, 50, Doctor

Use a name held of size 20, age field of size 2 and profession field of size 20. (7)

4. (a) Write a C-function to count the number of nodes in a linked list. (5)

(b) Explain the purpose of MACRO with the help of suitable example. (5)

5. Write short notes on the following

(a) Dynamic Memory Allocation (5)
(b) Sparse Matrix Representation (5)