B.Sc. DEGREE EXAMINATION, NOVEMBER 2017
Second Semester
Information Technology
PROGRAMMING IN C AND DATA STRUCTURES
(CBCS 2011 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. What are constants?
2. List out bit-wise operators.
3. Define array.
4. Specify the advantages of pointers.
5. Differentiate structure and union.
6. State the procedures to open and close a file.
7. What is stack?
8. How to represent the linked list?
9. Define tree.
10. State any two applications of binary tree.
Sub. Code
1BIT2C1
AFC-10398
2
Ws5
Part B x 5 25)
Answer all questions choosing either or
11. Explain the structure of a program.
Or
Discuss the various types of keywords and Data
types.
12. How to pass an array to a function? Explain with
suitable example.
Or
Write a short note on array of pointers.
13. Illustrate the procedures to define the structure
within another structure.
Or
How to use the functions fseek() and fwrite()? Give a
sample program.
14. Write C program to implement the infix, postfix and
prefix using stack.
Or
Write an algorithm to traverse in a Linked list.
15. How do you represent the binary tree? Give a
sample program.
3
Ws5
Part C x 10 30)
Answer any three questions.
16. Describe the various looping statements available in C
language.
17. How to allocate the memory dynamically? Illustrate with
a sample program.
18. Write a C program to store the employee details using
Structure.
19. Write a C program to implement the queue operations.
20. How to represent the lists? Give a sample program.
————————