B.Sc. DEGREE EXAMINATION, APRIL 2018
Second Semester
Information Technology
PROGRAMMING IN C AND DATA STRUCTURES
(CBCS 2017 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. What is Constant?
2. What is Macros?
3. How are multi -dimensional arrays declared?
4. What is meant by dynamic memory allocation?
5. Differentiate structure and union.
6. What are the uses of structure data type?
7. Write the advantages of linked lists.
8. What is Queue?
9. Define binary search tree.
Sub. Code
7BIT2C1
AFS-0393
2
wk 16
Part B x 5 25)
Answer all questions, choosing either or
11. Describe the different types of Function.
Or
Explain the bitwise operators available in C.
12. What is character array? How will you initialize a
character array?
Or
Differentiate between static and dynamic memory
allocation.
13. Explain the operations used on pointers.
Or
Explain the usage of command line parameters with
an example.
14. Describe the basic operations performed on Queue.
Or
Explain the algorithm for evaluating a postfix
operation.
15. Write short notes on Binary tree representation.
Or
Write briefly about binary tree and its traversal.
AFS-0393
3
wk 16
Part C x 10 30)
Answer any three questions.
16. Describe the branching and looping Structure in
17. Illustrate in detail on passing function to other functions.
18. Describe how to open a file, close a file and its processing
a data file.
19. Explain singly linked list and its primitive operations
algorithms.
20. Describe the application of trees.
————————