B.Sc. DEGREE EXAMINATION, NOVEMBER 2017
Second Semester
Information Technology
PROGRAMMING IN C AND DATA STRUCTURES
(CBCS 2014 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. What do you mean by character set?
2. Define Recursion.
3. What is an array?
4. What is dynamic memory allocation?
5. Define Bit fields.
6. Write the syntax for closing a data file.
7. Write an example for Infix.
8. What are Linked Lists?
9. What is a tree?
10. What are the applications of trees?
Sub. Code
4BIT2C1
AFF-4545
2
Ws1
Part B x 5 25)
Answer all questions.
11. How can you declare and initialize variables?
Explain.
Or
Explain switch statement with an example.
12. Write a program that uses a function to sort and
array of integers.
Or
Write down the rules of pointer operations.
13. Explain how to declare and initialize structure
variables.
Or
Write a program to read data from the keyboard,
write it to a file called INPUT, again read the same
data from the INPUT file, and display it on the
screen.
14. Define stack. Explain the representation of stacks
in C.
Or
Explain Postfix and Prefix with examples.
15. What are the important terms in Tree? Explain.
Or
Explain Postorder Traversal with an algorithm.
AFF-4545
3
Ws1
Part C 10 30)
Answer any three questions.
16. Explain the various types of if statements with examples.
17. Write a program to find the product of two matrices.
18. Describe the concept of passing structures to functions.
19. What are queues? How can you add and delete an item
from the queue?
20. What is Binary Tree? How can you represent a Binary
Tree? Give an example.
————————