M.C.A. DEGREE EXAMINATION,
NOVEMBER 2017.
First Semester
Computer Application
C AND DATA STRUCTURES
(CBCS 2017 onwards)
(Common for M.C.A. (R)/M.C.A.
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. Write a note on C Data types.
2. What are arithmetic operators in
3. Define Array.
4. What are pointers?
5. What is stack?
6. Comment on polish notation.
7. Define Binary trees.
8. What are non-linear data structures?
9. What is searching?
10. What is Bubble sort?
Sub. Code
541102/
545102
RW-963
2
Ws9
Part B 5 25)
Answer all questions.
11. What are the rules for defining variables in Give
examples.
Or
Write about scanf and print functions with
examples.
12. What are functions? Discuss about different
categories of functions.
Or
Write about pointers and arrays in C with example.
13. How to insert an element in a singly linked list?
Give example.
Or
Discuss about queue and its operations.
14. Write short notes on Types of Binary trees.
Or
Explain about traversing binary trees.
15. What is linear search? Give an example.
Or
Write short notes on selection sort.
RW-963
3
Ws9
Part C 10 30)
Answer any three questions.
16. Explain about various control structures in C with
suitable examples.
17. Write a C program to perform addition and subtraction of
two input matrices.
18. Explain about various operations on a stack with
examples.
19. Describe any two hashing techniques with examples.
20. Explain the working of insertion sort with an example.
————————