Madras University (UnOM) 2006 B.C.A Computer Application DataStructures Using C - Question Paper

Time: 3 hours
Maximum: 100 marks

PART A - [5 x eight = Marks 40]
ans any 5 ques..
All ques. carry equal marks.

1. Write a C program to learn the value of sales of 3 items by 4 sales representatives and print the subsequent.

(a) Total values of sales by every girl
(b) Total value of every item sold
(c) Grand total of sales of all items by all girls.

2. define different storage classes of variables.

3. define the syntax of structure definition in C? discuss how the members of the structure can be accessed with structure variables and with pointers.

4. discuss the syntax and usage of get C, put C, get W, put W functions.

5. Convert the subsequent infix expressions to postfix and prefix form:

(a) aTbTc+d*eTa
(b) a+b*c/d-d
(c) aT'b+cTd*e.

6. Write C functions to insert and delete elements from a queue.

7. Write an algorithm to add an element into a sorted list.

8. What is a binary tree? Write algorithms for traversals of binary trees.

PART B - [3 x 20 = Marks 60]

ans any 3 ques..
All ques. carry equal marks.

9. (a) Write a C program that uses a function to sort an array of integers.
(b) Write note on dynamic memory allocation. explain on its implementation in C with examples.

10. (a) Write a C program to learn a set of strings into an array and check whether a provided string is current.
(b) discuss the preprocessor directives # define, # include, # ifflef, # if with examples.

11. (a) Write algorithms to push, pop element and to determine whether the stack is empty.
(b) Suggest a suitable storage representation for a lower triangular matrix in a single dimensional array. Write its addressing function.

12. define representation of polynomials in a linked list. Write algorithms to add two polynomials and to multiply a polynomial with a constant.

13. define representation of graphs. Write algorithms for graph traversal.

Earning:   Approval pending.