MCS011 - June 2022
MCS011 - June 2022
MCS011 - June 2022
om
MCA (Revised) / BCA (Revised)
Term-End Examination
June, 2022
.c
ru
MCS-011 : PROBLEM SOLVING
AND PROGRAMMING
u
Time : 3 hours Maximum Marks : 100
tG
(Weightage : 75%)
en
Note : Question no. 1 is compulsory. Answer any
three questions from the rest.
m
IN
INF
INFI
NO
INFIN
INFINI
INFINIT
IG
INFINITY
MCS-011 1 P.T.O.
(c) Write a program to generate Fibonacci
series using recursion. 10
om
(d) Write an interactive C program for each to
illustrate the following concepts : 10
.c
(i) Enumerated data type
ru
(ii) Macros in C
(iii) Typedef
u
tG
(iv) Goto statement
operation on matrices :
D = (A*B) + C
20 students. 10
MCS-011 2
4. (a) Define function. How are functions
om
declared in C language ? What are function
prototypes and what is the use of return
statements ? 10
.c
(b) Explain the function ‘‘call by reference’’ in
C language. Give advantages and
ru
disadvantages of it. 10
u
5. (a) Explain the following statements with the
tG
help of an example for each : 10
(i) Break
en
(ii) Goto
m
(iii) Continue
with an illustration. 5
UA
NO
IG
MCS-011 3 P.T.O.