DISTANCE EDUCATION
M.Sc. (Software Engineering) Year Integrated) DEGREE
EXAMINATION, DECEMBER 2017.
C AND DATA STRUCTURES
Time Three hours Maximum 100 marks
SECTION A — × 8 40 marks)
Answer any FIVE questions.
1. Explain about various data types in C.
2. Discuss in detail about the multi dimensional arrays in
C. Give example.
3. Explain the concept of 'structure' within the 'structure'.
Give example.
4. Write a program to find the factorial of N using recursion.
5. Describe the concept of passing pointers to function.
6. Explain the representation of Queue. What are its
applications?
7. Discuss about the singly linked list with example.
8. Define Tree. What are the applications of Tree?
SECTION B — × 15 60 marks)
Answer any FOUR questions.
9. Explain about and and statements
with suitable example.
10. Distinguish between and 'continue'
statements.
Explain about 'switch' statement. Give example.
Sub. Code
14
DE-3033
2
wk10
11. Discuss about various library functions in C.
Write a program to check the given string is
palindrome or not.
12. Write short note on:
Dynamic Memory Allocation
Opening and closing a file.
13. Define Stack. Explain the algorithm to perform the infix
to postfix conversion.
14. What is Binary tree? Explain the linked representation of
Binary tree. Give examples.
15. Define Circular Queue. Explain the algorithm to perform
the operations of Circular Queue.
————————