DISTANCE EDUCATION
P.G.D.C.A EXAMINATION, MAY 2018.
First Semester
C AND DATA STRUCTURES
(2011 Calendar Year onwards)
Time Three hours Maximum 100 marks
SECTION A — x 8 40 marks)
Answer any FIVE questions.
1. Describe the fundamental data types supported by C.
2. What are user defined functions? State the rules that
should be followed while defining user-defined function.
3. State the various file I/O functions and explain them.
4. Write a program which would sort a list of names in
alphabetical order.
5. Write a program to merge two numeric arrays using
pointers.
6. Describe the basic operations performed on queues.
7. Explain the binary tree representations in detail.
8. Explain the doubly linked list concept and its benefits.
Sub. Code
12
DE-3430
2
wk7
SECTION B — × 15 60 marks)
Answer any FOUR questions.
9. Describe the loop structures available in C.
10. What is a preprocessor? Describe the facilities offered by
the preprocessor.
11. Explain how structures are defined in C. How will you
access the individual members in a structure?
12. Write a program to compute and print all possible roots of
a quadratic equation.
13. What is stack? Describe the operations that can be
performed on stack. Also explain how the stacks are
useful to evaluate the expression.
14. Describe the procedure for polynomial addition using
linked list. Also write an algorithm for the same.
———————