Test Papers / Previous Question Papers of IGNOU CS04 Data Structures through C and PASCAL (S) 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' & 'PASCAL' language.

1. (a). Write a program in C/PASCAL to create a doubly linked list in ascending order of information. The information field is of type integer. (Assume the value of integer yourself). 10

(b). Write a program and algorithm to sort a given list using "Heap Sort" method. 10

(c) Develop a program which reads a hexadecimal digit and returns its decimal equivalent number. 10

2. Write a 'function to evaluate the postfix expression using stack. Explain how priorities of the operators are taken care of during the process of converting an infix to Postfix form.

3. (a) How do you represent a stack and a queue by using one-dimensional array? 2

(b) Write a function for pushing into or popping from a stack. 4

(c) Write a function for adding an element to a Queue and removing an element from a Queue. 4

4. (a) Build a B-tree for the following data: DHKZBPOQEASWTCLNYM 5

(b) Write a program to count the number of words and lines in a text file, whose name is supplied in the command line. 5

5. (a) Write a ‘C’ language program to print a file backwards. 5

(b) Differentiate between sequential and indexed sequential file organisation. 5