Part-A (10 X 1=10 Marks) Marks CO(s) BTL
1 a) Syntax - 1 Mark [1M] CO1 L2
b) Explanation – 1 Mark [1M] CO1 L1
c) Pointer Declaration - 1 Mark [1M] CO2 L4
d) Differences - 1 Mark [1M] CO2 L2
e) Definition- 1 Mark [1M] CO3 L6
f) Definition - 1 Mark [1M] CO3 L3
g) Advantages – 0.5 Mark and Disadvantages- 0.5 Mark [1M] CO4 L4
h) Function calling- 1 Mark [1M] CO4 L5
i) Definition- 0.5 Mark, Example – 0.5 Mark [1M] CO5 L2
j) Reason- 1 Mark [1M] CO5 L4
Part-B (5 X 10=50 Marks)
2 a) Steps - 4 Marks, diagram – 1 Mark [5M] CO1 L2
b) Flowchart for MIN - 2.5 Marks, Flowchart for MAX - 2.5 Marks [5M] CO1 L4
OR
3 a) Flowchart - 5 Marks [5M] CO1 L5
b) Algorithm - 5 Marks [5M] CO1 L5
4 a) Procedure/Program - 5 Marks [5M] CO2 L3
b) enum Data type explanation with syntax – 2 Marks; Example – 3 Marks. [5M] CO2 L2
OR
5 Pointers, Explanation – 4 Marks; Program-5 Marks, Pointer Arithmetic - 1 Mark. [10 M] CO2 L2
6 Explanation – 2 Marks, Program - 8 Marks [10 M] CO3 L5
OR
7 Explanation – 2 Marks; Program – 8 Marks. [10 M] CO3 L3
8 Explanation – 1 Mark; Program - 7 Marks, Advantages & Limitations – 2 Marks. [10 M] CO4 L3
OR
9 Explanation – 2 Marks; Program – 8 Marks. [10 M] CO4 L3
10 Program - 6 Marks, Advantages & Disadvantages, Running time Complexity – 4 [10 M] CO5 L2
Marks.
OR
11 a) Explanation & Example – 2 Marks; Algorithm – 3 Marks [5M] CO5 L5
b) Explanation – 1 Mark; Program – 4 Marks [5M] CO5 L3
