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

PGDCA / MCA (I Yr)
Term-End Examination

June, 2007

CS04: Data Structures through "C" and "PASCAL"

Time: 2 hours
Maximum Marks: 60

Note : There are five questions in this paper Question No. 1 is compulsory. Answer any three questions from the rest. All algorithms should be written nearer to 'C' or Pascal Language.

1.(a) Give a recursive Pascal (or C) procedure (or function) to insert the node in a linked list. (7)

(b) When is the binary search technique used for searching in a list ? Give the binary search algorithm. Compare the performance of binary search with linear search. (8)

(d) Find the allocation formula of a lower triangular matrix, which can be used to find the value of A[i, j]^th element, provided the starting element A[0,0]=100 and successive element is a unit increment to the Previous one. Using the formula find the value of A[3,1]. (7)
A=_________(matrix)________

2. (a) Generate a binary tree by traversing inorder and preorder sequences given below : (4)
Inorder : B, E, D, A, G, F, H, C
Preorder r A, B, D, E, C, F, G, H

(b) Insert the keys given below, in the order shown, to build them into an AVL tree : (4)
A, M, Z, E, C, X, P

3. (a) Find out minirnal spanning tree for the following graph : (6)
________(diagram)________
(Weights have been shown along the edges)

(b) Which of the algorithms out of insertion sort and selection sort would you prefer to use on random data ? Justify your answer.

4. (a) rite a function for adding and removing element from a Queue.

(b) Write short notes on the following :
(i) Indexed sequential file organization
(ii) Sequential file organization

5. (a) It is intended to sort the following data using heap sort technique : (7)
6, 20,3, 16, 24, 9, 72,7.
If the resulting data is to appear in ascending order, show using tree structure, how the heap would appear initially and after deletion of each item.

(b) Write a function in C-language to perform PUSH and POP operation on a STACK.(3)

Note: The above courses are picked automatically by the website for indicative purpose only. However, students are requested to check with the University for the similarity of the course or for any other information in regard to the course.