M.C.A. DEGREE EXAMINATION, APRIL 2016
Computer Application
C AND DATA STRUCTURES
(2012 onwards)
(Common for MCA WE)
Time 3 Hours Maximum 75 Marks
Section A (10 2 20)
Answer all the questions.
1. Define Constants.
2. What is meant by Keyword?
3. Define Array.
4. What are Function?
5. Define Data Structures.
6. What is meant by List?
7. Define Tree.
8. Mention the types of Binary Trees.
9. What is meant by Sorting?
10. What is the Best case Complexity of Linear Search?
Sub. Code
541102/
545102
RW-10960
2
Sp 1
Section B 5 25)
Answer all the questions, choosing either or
11. What are Variables? Mention the Rules for defining
Variables with examples.
Or
Write short notes on Type conversions in C.
12. What is meant by Recursion? Explain it with an
Example.
Or
Write a C program to illustrate the concept of
"Array of Pointers".
13. Write a short notes on: Singly Linked list.
Or
Briefly explain Polish Notation with examples.
14. Write a short notes on: Binary Tree
Representations.
Or
Describe about any TWO Hashing Techniques.
15. Briefly explain about Binary Search.
Or
Elaborate Quick Sort with example.
RW-10960
3
Sp 1
Section C 10 30)
Answer any three questions.
16. Explain Formatted Unformatted I/O Functions with
examples.
17. Describe any FIVE String Handling Functions in C with
Examples.
18. Discuss about Implementation of Stack.
19. Explain Insertion Deletion operations in Binary Search
Tree with examples.
20. Write short notes on:
Bubble Sort
Selection Sort.