Q.P.
Code : 15121
First Semester B.C.A. Degree Examination,
November/December 2O19
(CBC!S Scheme — Freehers âs Repeaters }
Computer Science
Paper BCA 103 T — PROBLEM SOLVING TECHNIQUES U8ING C
Time : 3 HoursJ {Mox. Marks : TO
Instruction to Candidates : Answer all Parts.
PART — A
I. Answer any TEN questions. Each question carries Z marks : 10 2 = ZO}
1. Define algorithm.
2. What is structured programming9
3. Explain ternary operator.
4. Define the different types of type conversion with example.
5. Explain break and continue.
6. What is function prototype?
7. Define array. How can an array be initializedP
8. Write any four mathematical functions available in ‘C’.
9. Define pointer with example.
10. What is enumerated data type?
11. Write any four file functions.
12. How does structure differ from Union?
PART — B
II. Answer any PIVE questions. Each question carries 10 marks : JS x 10 = 5OJ
13. (a) Explain the structures of ‘C’ program with an example.
(b) What is software7 Mention the classification of software.
1/
Q.P. Code : 15121
14, (a) Explain the different data types supported by ‘C’.
(b) Explain arithmetic operators with an example. (5)
15, (a) Explain the different looping statements with an example.
(b) What are formatted 1/0 functions in ‘C7
16, (aJ Write a O Progyam to display fibonaeci series using recursive function {5}
(b) What is a function? Explain with an example passing of arguments to
functions. {5J
17, (a] Write a C program to find the product of two matrices.
tsj
(b) Explain different storage classes in ‘C’ language.
(5)
18. (aJ Explain string operations with an example.
(5}
(bJ Explain switch statement in ‘C’ with an example.
(5)
19. (a) Write a note on call by value and call by reference with an example. {5]
(b) Explain command line argument.
ts)
20. (a) What are preprocessor directives?
(b) Explain static and dynamic memory allocation.
2/