∞◊x-•Ê⁄ y — ¬˝Êª˝ÊÁ◊¥ª ∞¥«U ¬˝ÊÚé‹◊ ‚ÊÚÁÀfl¥ª Õ˝Í ‘C’ ‹Ò¥Çfl¡

M3-R4 : PROGRAMMING & PROBLEM SOLVING

THROUGH ‘C’ LANGUAGE
•flÁœ — 03 ÉÊ¥≈U •Áœ∑§Ã◊ •¥∑§ — 100
DURATION : 03 Hours MAXIMUM MARKS : 100

•Ê∞◊•Ê⁄U ‡ÊË≈U ‚¥. —

OMR Sheet No. :
⁄UÊ‹ Ÿ¥. — ©ûÊ⁄U-¬ÈÁSÃ∑§ÊU ‚¥. —
Roll No. : Answer Sheet No. :
¬⁄UˡÊÊÕ˸ ∑§Ê ŸÊ◊ — ¬⁄UˡÊÊÕ˸ ∑§ „SÃÊˇÊ⁄U —
Name of Candidate : ____________________________________________; Signature of Candidate : __________________

¬⁄UˡÊÊÁÕ¸ÿÊ¥ ∑§ Á‹∞ ÁŸŒ¸‡Ê — Instructions for Candidate :

∑Χ¬ÿÊ ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê, •Ê∞◊•Ê⁄U ‡ÊË≈U ∞fl¥ ©ûÊ⁄U-¬ÈÁSÃ∑§Ê ◊¥ ÁŒÿ ª∞ Carefully read the instructions given on Question Paper,
ÁŸŒ¸‡ÊÊ¥ ∑§Ê äÿÊŸ¬Ífl¸∑§ ¬…∏¥– OMR Sheet and Answer Sheet.
¬˝‡Ÿ-¬ÈÁSÃ∑§Ê Á„ãŒË ∞fl¥ •¥ª˝¡Ë ÷Ê·Ê ◊¥ „Ò– ¬⁄UˡÊÊÕ˸ ©ûÊ⁄U Á‹πŸ ∑§ Question Paper is in Hindi and English language.
Á‹∞ Á∑§‚Ë ÷Ë ∞∑§ ÷Ê·Ê ∑§Ê øÿŸ ∑§⁄U ‚∑§ÃÊ „Ò– (•ÕʸÃ, ÿÊ ÃÊ Á„ãŒË Candidate can choose to answer in any one of the language.
ÿÊ •¥ª˝¡Ë) (i.e., either Hindi or English)
ß‚ ◊ÊÚ«˜UÿÍ‹/¬¬⁄U ∑§ ŒÊ ÷ʪ „Ò¥– ÷ʪ ∞∑§ ◊¥ øÊ⁄U ¬˝‡Ÿ •ÊÒ⁄U ÷ʪ There are TWO PARTS in this Module/Paper. PART ONE
ŒÊ ◊¥ ¬Ê°ø ¬˝‡Ÿ „Ò¥– contains FOUR questions and PART TWO contains FIVE
questions.
÷ʪ ∞∑§ ““flÒ∑§ÁÀ¬∑§”” ¬˝∑§Ê⁄U ∑§Ê „Ò Á¡‚∑§ ∑ȧ‹ •¥∑§ 40 „Ò¥ ÃÕÊ PART ONE is Objective type and carries 40 Marks.
÷ʪ ŒÊ ““√ÿÁÄì⁄U∑§”” ¬˝∑§Ê⁄U ∑§Ê „Ò •ÊÒ⁄U ß‚∑§ ∑ȧ‹ •¥∑§ 60 „Ò¥– PART TWO is Subjective type and carries 60 Marks.
÷ʪ ∞∑§ ∑§ ©ûÊ⁄U, ß‚ ¬˝‡Ÿ-¬òÊ ∑§ ‚ÊÕ ŒË ªß¸ •Ê∞◊•Ê⁄U PART ONE is to be answered in the OMR ANSWER
©ûÊ⁄-U ¬ÈÁSÃ∑§Ê ¬⁄U, ©‚◊¥ ÁŒÿ ª∞ •ŸÈŒ‡ÊÊ¥ ∑§ •ŸÈ‚Ê⁄U „Ë ÁŒÿ ¡ÊŸ „Ò¥– SHEET only, supplied with the Question Paper, as per the
÷ʪ ŒÊ ∑§Ë ©ûÊ⁄U-¬ÈÁSÃ∑§Ê ◊¥ ÷ʪ ∞∑§ ∑§ ©ûÊ⁄U Ÿ„Ë¥ ÁŒÿ ¡ÊŸ øÊÁ„∞– instructions contained therein. PART ONE is NOT to be
answered in the answer book for PART TWO.
÷ʪ ∞∑§ ∑§ Á‹∞ •Áœ∑§Ã◊ ‚◊ÿ ‚Ë◊Ê ∞∑§ ÉÊá≈UÊ ÁŸœÊ¸Á⁄Uà ∑§Ë ªß¸ Maximum time allotted for PART ONE is ONE HOUR.
„Ò– ÷ʪ ŒÊ ∑§Ë ©ûÊ⁄U-¬ÈÁSÃ∑§Ê, ÷ʪ ∞∑§ ∑§Ë ©ûÊ⁄U-¬ÈÁSÃ∑§Ê ¡◊Ê Answer book for PART TWO will be supplied at the table
∑§⁄UÊŸ ∑§ ¬‡øÊØ ŒË ¡Ê∞ªË– ÃÕÊÁ¬, ÁŸœÊ¸Á⁄Uà ∞∑§ ÉÊ¥≈U ‚ ¬„‹ when the Answer Sheet for PART ONE is returned.
÷ʪ ∞∑§ ¬Í⁄UÊ ∑§⁄UŸ flÊ‹ ¬⁄UˡÊÊÕ˸ ÷ʪ ∞∑§ ∑§Ë ©ûÊ⁄U-¬ÈÁSÃ∑§Ê ÁŸ⁄UˡÊ∑§ However, Candidates who complete PART ONE earlier
∑§Ê ‚ÊÒ¥¬Ÿ ∑§ ÃÈ⁄¥Uà ’ÊŒ, ÷ʪ ŒÊ ∑§Ë ©ûÊ⁄U-¬ÈÁSÃ∑§Ê ‹ ‚∑§Ã „Ò¥– than one hour, can collect the answer book for PART TWO
immediately after handing over the Answer Sheet for
PART ONE to the Invigilator.
¬⁄UˡÊÊÕ˸, ©¬ÁSÕÁÃ-¬ÁòÊ∑§Ê ¬⁄U „SÃÊˇÊ⁄U Á∑§∞ Á’ŸÊ •ÊÒ⁄U •¬ŸË Candidate cannot leave the examination hall/room
©ûÊ⁄U-¬ÈÁSÃ∑§Ê, ÁŸ⁄UˡÊ∑§ ∑§Ê ‚ÊÒ¬¥  Á’ŸÊ, ¬⁄UˡÊÊ „ÊÚ‹/∑§◊⁄UÊ Ÿ„Ë¥ ¿UÊ« ∏ without signing on the attendance sheet and handing over
‚∑§Ã „Ò–¥ ∞‚Ê Ÿ„Ë¥ ∑§⁄UŸ ¬⁄U, ¬⁄UˡÊÊÕ˸ ∑§Ê ß‚ ◊ÊÚ«U˜ ÿ‹Í /¬¬⁄U ◊¥ his/her Answer Sheet to the Invigilator. Failing in doing
•ÿÊÇÿ ÉÊÊÁ·Ã ∑§⁄U ÁŒÿÊ ¡Ê∞ªÊ– so, will amount to disqualification of Candidate in this
Module/Paper.

¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ∑§Ê πÊ‹Ÿ ∑§ ÁŸŒ¸‡Ê Á◊‹Ÿ ∑§ ¬‡øÊØ ∞fl¥ ©ûÊ⁄U Á‹πŸÊ After receiving the instruction to open the booklet and
•Ê⁄Uê÷ ∑§⁄UŸ ‚ ¬„‹ ©ê◊ËŒflÊ⁄U ¡Ê°ø ∑§⁄U ÿ„ ‚ÈÁŸÁ‡øà ∑§⁄U ‹¥ Á∑§ before starting to answer the questions, the candidate should
¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ¬˝àÿ∑§ ŒÎÁc≈U ‚ ‚¥¬Íáʸ „Ò– ensure that the Question Booklet is complete in all respect.

ŸÊ≈U — ÿÁŒ Á„ãŒË ‚¥S∑§⁄UáÊ ◊¥ ∑§Ê߸ òÊÈÁ≈U/Áfl‚¥ªÁà ¬Ê߸ ¡ÊÃË „Ò, ÃÊ ©‚ •flSÕÊ ◊¥ •¥ª¡
˝ Ë ‚¥S∑§⁄UáÊ „Ë ◊Êãÿ „ÊªÊ–
Note : In case of any discrepancy found in Hindi version, English version will be treated as final.

¡’ Ã∑§ •Ê¬‚ ∑§„Ê Ÿ ¡Ê∞, Ã’ Ã∑§ ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê Ÿ πÊ‹ ¥–

DO NOT OPEN THE QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO.
 ÷ʪ ∞∑§ / PART ONE 1.3 ÁS≈˛¥UÇ‚ ∑Ò§⁄UÄ≈U⁄U ∞⁄U „Ò¥ ÿ„ „◊‡ÊÊ ______ ∑§ ‚ÊÕ
‚◊Êåà „ÊÃ „Ò¥–
(‚÷Ë ¬˝‡ŸÊ¥ ∑§ ©ûÊ⁄U Œ¥ /Answer all the questions)
(A) \n (B) \t
1. ŸËø ¬˝àÿ∑§ ¬˝‡Ÿ ∑§ ©ûÊ⁄U ∑§ ∑§ß¸ Áfl∑§À¬ ÁŒ∞ ª∞ (C) \0 (D) \1
„Ò¥– ∞∑§ ‚’‚ ©¬ÿÈÄà Áfl∑§À¬ øÈŸ¥ •ÊÒ⁄U ©‚
Strings are character arrays it always ends
¬˝‡Ÿ-¬òÊ ∑§ ‚ÊÕ ©¬‹éœ ∑§⁄UÊÿ ª∞ ““•Ê∞◊•Ê⁄U””
with ______.
©ûÊ⁄U-¬òÊ∑§ ◊¥, ©‚◊¥ ÁŒ∞ ª∞ ÁŸŒ¸‡ÊÊ¥ ∑§ •ŸÈ‚Ê⁄U,
Œ¡¸ ∑§⁄¥U– (A) \n (B) \t

(C) \0 (D) \1
Each question below gives a multiple
choice of answers. Choose the most
appropriate one and enter in the “OMR”
answer sheet supplied with the question 1.4 ¬ÍáÊÊZ∑§ ÁSÕ⁄UÊ¥∑§ ôÊÊà ∑§⁄¥U–
paper, following instructions therein.
(1x10) (A) 3.145
1.1 ÁŸêŸÁ‹Áπà ◊¥ ‚ ∑§ÊÒŸ ‘C’ ◊¥ •◊Êãÿ „Ò«U⁄U »§Êß‹
(B) 34
„Ò ?
(C) "125"
(A) math.h (B) mathio.h
(D) ©¬⁄UÊÄà ∑§Ê߸ Ÿ„Ë¥
(C) string.h (D) ctype.h
Find an integer constant
What is the following is invalid header file
(A) 3.145
in C ?
(B) 34
(A) math.h (B) mathio.h
(C) "125"
(C) string.h (D) ctype.h
(D) None of the above

1.2 ÁŸêŸÁ‹Áπà ◊¥ ‚ ∑§ÊÒŸ ‘C’ ∑§Ê ∞∑§ ∑§Ëfl«¸U Ÿ„Ë¥ „Ò? 1.5 ◊ÊŸ∑§ ANSI C, ∑§Ëfl«¸U ∑§Ë ______ ‚¥ÅÿÊ ∑§Ê
¬„øÊŸÃÊ „Ò–
(A) •ÊÚ≈UÊ (B) ∑§‚
(A) 16 (B) 32
(C) ’˝∑§ (D) »¥§Ä‡ÊŸ
(C) 64 (D) 128
Which of the following is not a keyword
Standard ANSI C recognizes ______
of 'C' ?
number of keywords.
(A) auto (B) case (A) 16 (B) 32

(C) break (D) function (C) 64 (D) 128

Page 2 SPACE FOR ROUGH WORK M3-R4-01-20

1.6 ∑§ÊÒŸ ‚Ê ∞∑§◊ÊòÊ »¥§Ä‡ÊŸ „Ò ¡Ê ‚÷Ë C ¬˝Êª˝Ê◊ ◊¥ „ÊŸÊ 1.8 ÁŸêŸÁ‹Áπà ¬˝Êª˝Ê◊ ∑§Ê •Ê©≈U¬È≈U ôÊÊà ∑§⁄¥U —
øÊÁ„∞? #include <stdio.h>
#include<conio.h>
(A) start() (B) system() void main()
(C) main() (D) scanf() {
char ch;
Which is the only function that all C
int i;
program must contain?
ch = 'G';
(A) start() (B) system() i = ch-'A';
(C) main() (D) scanf() printf("%d", i);
}
(A) 5 (B) 6
1.7 ÁŸêŸÁ‹Áπà ¬˝Êª˝Ê◊ ∑§Ê •Ê©≈U¬È≈U ôÊÊà ∑§⁄¥U — (C) 7 (D) 8
Find output of the following program
#include<stdio.h> #include <stdio.h>
#include<conio.h> #include<conio.h>
void main()
void main()
{
{ char ch;
char a[] = { 'A', 'B', 'C', 'D' }; int i;
ch = 'G';
char* ppp = &a[0]; i = ch-'A';
*ppp++; printf("%d", i);
}
printf("%c %c ", *++ppp, --*ppp);
(A) 5 (B) 6
} (C) 7 (D) 8
(A) CA (B) CB
(C) BC (D) BA
1.9 ∞∑§ «ÍU √„Êß‹ ‹Í¬ Á∑§ÃŸË ’Ê⁄U ‹Í¬ ∑§ Á‹∞ ªÊ⁄¥U≈U«U
„Ò?
Find output of the following program
(A) 0 (B) •‚Ë◊
#include<stdio.h>
(C) 1 (D) ¬Á⁄UfløŸ‡ÊË‹
#include<conio.h> How many times is a do while loop
void main() guaranteed to loop ?
(A) 0 (B) Infinitely
{
(C) 1 (D) Variable
char a[] = { 'A', 'B', 'C', 'D' };
char* ppp = &a[0]; 1.10 ÁŸêŸÁ‹Áπà ◊¥ ‚ ∑§ÊÒŸ ‘C’ ◊¥ ©¬ÿÈÄà S≈UÊ⁄U¡ Ä‹Ê‚
*ppp++; Ÿ„Ë¥ „Ò?
(A) auto (B) dec
printf("%c %c ", *++ppp, --*ppp); (C) static (D) extern
} Which of the following is not a proper
storage class in 'C'?
(A) CA (B) CB
(A) auto (B) dec
(C) BC (D) BA (C) static (D) extern
Page 3 SPACE FOR ROUGH WORK M3-R4-01-20
2. ŸËø ÁŒÿÊ ªÿÊ ¬˝àÿ∑§ Áflfl⁄UáÊ ÿÊ ÃÊ ‚„Ë „Ò •ÕflÊ 2. Each statement below is either TRUE or
FALSE. Choose the most appropriate one
ª‹Ã– ∞∑§ ‚’‚ ©¬ÿÈÄà Áfl∑§À¬ øÈŸ¥ •ÊÒ⁄U ©‚
and ENTER in the “OMR” answer sheet
¬˝‡Ÿ-¬òÊ ∑§ ‚ÊÕ ©¬‹éœ ∑§⁄UÊÿ ª∞ ““•Ê∞◊•Ê⁄U”” supplied with the question paper,
©ûÊ⁄-U¬òÊ∑§ ◊¥, ÁŒ∞ ª∞ ÁŸŒ¸‡ÊÊ¥ ∑§ •ŸÈ‚Ê⁄U, Œ¡¸ following instructions therein.
(1x10=10)
∑§⁄¥U– (1x10=10)
2.1 In C, upper and lower cases letter are
2.1 ‘C’ ◊¥, •¬⁄U •ÊÒ⁄U ‹Ê•⁄U ∑§‚ •ˇÊ⁄U ‚◊ÊŸ „Ò¥– same.

2.2 = ∑§Ê ¬˝ÿÊª ÃÈ‹ŸÊ ∑§ Á‹∞ Á∑§ÿÊ ¡ÊÃÊ „Ò, ¡’Á∑§ 2.2 = is used for comparison, whereas, ==
== ∑§Ê ¬˝ÿÊª ŒÊ ◊ÊòÊÊ•Ê¥ ∑§ •‚Êߟ◊¥≈U ∑§ Á‹∞ is used for assignment of two quantities.
Á∑§ÿÊ ¡ÊÃÊ „Ò–
2.3 A function can be defined inside another
2.3 ∞∑§ »¥§Ä‡ÊŸ ∑§Ê ŒÍ‚⁄U »¥§Ä‡ÊŸ ∑§ •ãŒ⁄U ¬Á⁄U÷ÊÁ·Ã function.
Á∑§ÿÊ ¡Ê ‚∑§ÃÊ „Ò–
2.4 In switch statement, the default case is
optional.
2.4 ÁSflø S≈U≈U◊¥≈U ◊¥, Á«U$»§ÊÚÀ≈U ∑§‚ flÒ∑§ÁÀ¬∑§ „Ò–

2.5 strlen() function counts the number of

2.5 strlen() $»¥§Ä‡ÊŸ Á∑§‚Ë ÁŒ∞ ª∞ ÁS≈˛¥Uª ◊¥ fláÊÊZ ∑§Ë characters in a given string and returns
‚¥ÅÿÊ ∑§Ê ÁªŸÃÊ „Ò •ÊÒ⁄U ¬ÍáÊÊZ∑§ ◊ÊŸ ‹ÊÒ≈UÊÃÊ „Ò– the integer value.

2.6 ∑¥§Á≈UãÿÍ S≈U≈U◊¥≈U ∑§Ê ¬˝ÿÊª ÁSflø S≈U≈U◊¥≈U ∑§ ‚ÊÕ Ÿ„Ë¥ 2.6 The continue statement cannot be used
Á∑§ÿÊ ¡Ê ‚∑§ÃÊ „Ò– with switch statement.

2.7 ‘C’ ∑§Ëfl«¸U ∑§Ê ◊Í‹ •Õ¸ ’Œ‹Ê ¡Ê ‚∑§ÃÊ „Ò– 2.7 The basic meaning of the C keywords can
be changed.

2.8 $»¥§Ä‡ÊŸÊ¥ ∑§Ê flÒÀÿÍ ÿÊ ‚ãŒ÷¸ Œ˜flÊ⁄UÊ ÷Ë ∑§„Ê ¡Ê ‚∑§ÃÊ

2.8 Functions can be called either by value or
„Ò– reference.

2.9 ++ •ÊÚ¬⁄U≈U⁄U •ÊÚ¬⁄¥U«U ∑§Ê 1 ‚ ’…∏ÊÃÊ „Ò, ¡’Á∑§ 2.9 The ++ operator increments the operand
−− •ÊÚ¬⁄U≈U⁄U ß‚ 1 ‚ ÉÊ≈UÊÃÊ „Ò– by 1, whereas, the -- operator decrements
it by 1.

2.10 #define ‹Êߟ¥ ∞∑§ •œ¸Áfl⁄UÊ◊ ∑§ ‚ÊÕ ‚◊Êåà „ÊŸË

øÊÁ„∞– 2.10 #define lines should end with a semicolon.

Page 4 SPACE FOR ROUGH WORK M3-R4-01-20

3. ∑§ÊÚ‹◊ X ◊¥ ÁŒ∞ ª∞ ‡ÊéŒÊ¥ •ÊÒ⁄U flÊÄÿÊ¥ ∑§Ê Á◊‹ÊŸ ∑§ÊÚ‹◊ Y ◊¥ ÁŒ∞ ª∞ ÁŸ∑§≈UÃ◊ ‚ê’¥ÁœÃ •Õ¸ / ‡ÊéŒÊ¥ /
flÊÄÿÊ¥ ‚ ∑§⁄¥U– •¬Ÿ Áfl∑§À¬ ¬˝‡Ÿ-¬òÊ ∑§ ‚ÊÕ ÁŒ∞ ª∞ ““•Ê∞◊•Ê⁄U”” ©ûÊ⁄U-¬òÊ∑§ ◊¥, ©‚◊¥ ÁŒ∞ ª∞ •ŸÈŒ‡ÊÊ¥
∑§Ê ¬Ê‹Ÿ ∑§⁄UÃ „È∞, Œ¡¸ ∑§⁄¥U– (1x10=10)

X Y

3.1 ÿ„ Á’ŸÊ ‡Êø ¡¥¬ S≈U≈U◊¥≈U „Ò A. ∞ÁÇ¡≈U ∑¥§≈˛UÊÀ«U ‹Í¬

3.2 »¥§Ä‡ÊŸ ¡Ê ÁS≈˛¥UÇ‚ ∑§Ê ‚¥ÿÊÁ¡Ã ∑§⁄UÃÊ „Ò B. Á‡Êç≈U ’Ê∞¥

Á‡Êï≈U
3.3 ß‚∑§Ê ©¬ÿÊª ‚¥’¥ÁœÃ •Á÷√ÿÁÄà ∑§Ê ∞∑§ ‚ÊÕ C. sizeof

¡Ê«∏Ÿ ∑§ Á‹∞ Á∑§ÿÊ ¡ÊÃÊ „Ò–

3.4 Symbol '=' D. ∑Ò§⁄ÒUÄ≈U⁄U ≈US≈U »¥§Ä‡ÊŸ

3.5 getw() E. ∞¥≈˛UË ∑¥§≈˛UÊÀ«U ‹Í¬

3.6 int*p F. ¬ÊÚߥ≈U⁄U ÉÊÊÁ·Ã ∑§⁄UÃÊ „Ò

3.7 While G. •‚Êߟ◊¥≈U •ÊÚ¬⁄U≈U⁄U
3.8 isalpha() H. Comma

3.9 do …. While I. strcat ()

3.10 << J. goto

K. ∞∑§ ¬ÍáÊÊZ∑§ ∑§Ê »§Êß‹ ‚ ¬…∏ÃÊ „Ò

L. ∞∑§ ∞⁄U ÉÊÊÁ·Ã ∑§⁄UÃÊ „Ò

M. strlen()

Page 5 SPACE FOR ROUGH WORK M3-R4-01-20

3. Match words and phrases in column X with the closest related meaning/ word(s)/phrase(s)
in column Y. Enter your selection in the "OMR" answer sheet supplied with the question
paper, following instructions therein. (1x10=10)

X Y

3.1 It is an unconditional jump statement. A. Exit controlled loop

3.2 Function that concatenate strings. B. Shift Left

It is used to link the related expression

3.3 C. sizeof
together.

3.4 Symbol '=' D. Character test function

3.5 getw() E. Entry controlled loop

3.6 int*p F. Declare a pointer

3.7 While G. Assignment operator

3.8 isalpha() H. Comma

3.9 do….while I. strcat()

3.10 << J. goto

K. Read an integer from a file

L. Declare an array

M. strlen()

Page 6 SPACE FOR ROUGH WORK M3-R4-01-20

4. ŸËø ¬˝àÿ∑§ flÊÄÿ ◊¥ ŸËø ŒË ªß¸ ‚ÍøË ‚ ∞∑§ ‡ÊéŒ ÿÊ flÊÄÿ ∑§Ê Á‹πŸ ∑§ Á‹∞ Á⁄UÄà SÕÊŸ „Ò– ‚’‚
©¬ÿÈÄà Áfl∑§À¬ øÈŸ¥ •ÊÒ⁄U ©‚ ¬˝‡Ÿ-¬òÊ ∑§ ‚ÊÕ ÁŒ∞ ª∞ ““•Ê∞◊•Ê⁄U”” ©ûÊ⁄U-¬òÊ∑§ ◊¥, ©‚◊¥ ÁŒ∞ ª∞ •ŸÈŒ‡ÊÊ¥
∑§ •ŸÈ‚Ê⁄U, Œ¡¸ ∑§⁄¥U– (1x10=10)

A. ãÿÍ‹Êߟ B. ßã∑˝§Ë◊¥≈U C. sizeof

D. •Êfl⁄U‹ÈÁ∑¥§ª E. ’‹ F. math.h

G. «UÊÚ≈U H. S≈˛UÄø«¸U I. islower()

J. ∞¥«U K. ÿÍÁŸÿŸ L. Á‹¥∑§

M. &&

4.1 ‘C’ ‹Ò¥Çfl¡ ∑§Ê __________ ¬˝ÿÊª‡ÊÊ‹Ê•Ê¥ ◊¥ ∑§ÊÿʸÁãflà Á∑§ÿÊ ªÿÊ ÕÊ–

4.2 ‘C’ ‹Ò¥Çfl¡ __________ ¬˝Êª˝ÊÁ◊¥ª ∑§ Á‹∞ ’„Èà ©¬ÿÈÄà „Ò–

4.3 •ÊÚ¬⁄U≈U⁄U “++” ∑§Ê __________ •ÊÚ¬⁄U≈U⁄U ∑§ M§¬ ◊¥ ¡ÊŸÊ ¡ÊÃÊ „Ò–
4.4 __________ •ÊÚ¬⁄U≈U⁄U ©¬ÿÊª ∞⁄U ∑§Ë ‹¥’Ê߸ •ÊÒ⁄U ‚¥⁄UøŸÊ ÁŸœÊ¸Á⁄Uà ∑§⁄UŸ ∑§ Á‹∞ Á∑§ÿÊ ¡Ê ‚∑§ÃÊ „Ò–

4.5 ◊ÊŸ∑§ ªÁáÊÃËÿ $»¥§Ä‡ÊŸ __________ „«U⁄U $»§Êß‹ ◊¥ ‡ÊÊÁ◊‹ „Ò¥–

4.6 __________ π¥«U ‚¥∑§‹∑§ ∑§Ê Á‚S≈U◊ ‹Êß’˝⁄UË ‚ ∑§ÊÿÊZ ∑§Ê ¡Ê«∏Ÿ ∑§ Á‹∞ ÁŸŒ¸‡Ê ¬˝ŒÊŸ ∑§⁄UÃÊ „Ò–

4.7 __________ •ÊÚ¬⁄U≈U⁄U ∑§fl‹ Ã÷Ë ‚„Ë „ÊÃÊ „Ò ¡’ ŒÊŸÊ¥ •ÊÚ¬⁄¥U«U ‚„Ë „ÊÃ „Ò¥–

4.8 __________ •ÊÚ¬⁄U≈U⁄U ∑§Ê ©¬ÿÊª ‚¥⁄UøŸÊ ŸÊ◊ ∑§Ê ©‚∑§ ‚ŒSÿ ŸÊ◊ ‚ ¡Ê«∏Ÿ ∑§ Á‹∞ Á∑§ÿÊ ¡ÊÃÊ „Ò–

4.9 __________ $»¥§Ä‡ÊŸ ÿ„ ¡Ê°ø ∑§⁄UÃÊ „Ò Á∑§ Œ¡¸ Á∑§∞ ª∞ •ˇÊ⁄U ‹Ê•⁄U ∑§‚ •ˇÊ⁄U „Ò¥ ÿÊ Ÿ„Ë¥–

4.10 __________ ∞∑§ fláʸ „Ò Á¡‚∑§Ê ¬˝ÿÊª ¬Ê∆U ∑§Ë ∞∑§ ¬¥ÁÄà ∑§ •¥Ã •ÊÒ⁄U ∞∑§ Ÿß¸ ¬¥ÁÄà ∑§Ë ‡ÊÈL§•Êà ÁŸL§Á¬Ã
∑§⁄UŸ ∑§ Á‹∞ Á∑§ÿÊ ¡ÊÃÊ „Ò–
Page 7 SPACE FOR ROUGH WORK M3-R4-01-20
4. Each statement below has a blank space to fit one of the word(s) or phrase(s) in the list
below. Enter your choice in the “OMR” answer sheet supplied with the question paper,
following instructions therein. (1x10=10)

A. Newline B. Increment C. sizeof

D. Overlooking E. Bell F. math.h

G. Dot H. Structured I. islower()

J. And K. Union L. Link

M. &&

4.1 C language was implemented at the __________ laboratories.

4.2 C language is well suited for __________ programming.

4.3 The operator "++'' is known as __________ operator.

4.4 The __________ operator can be used to determine the length of array and structures.

4.5 The standard mathematical functions are included in the __________ header file.

4.6 The ________ section provides instruction to the compiler to link functions from system
library.

4.7 The ________ operator is true only when both the operands are true.

4.8 __________operator is used to connect structure name to its member name.

4.9 __________ function checks whether the entered alphabets are lower case letter or not.

4.10 ______is a character used to represent the end of a line of text and the beginning of a new
line.

Page 8 SPACE FOR ROUGH WORK M3-R4-01-20

 ÷ʪ ŒÊ / PART TWO 6. (A) ©¬ÿÊª∑§Ãʸ Œ˜flÊ⁄UÊ ÁŸœÊ¸Á⁄Uà $»¥§Ä‡ÊŸ ∑§Ê ÄÿÊ
•Õ¸ „Ò? $»¥§Ä‡ÊŸ ¬Á⁄U÷Ê·Ê, »¥§Ä‡ÊŸ Á«UÄ‹⁄U‡ÊŸ
(Á∑§ã„Ë¥ øÊ⁄U ¬˝‡ŸÊ¥ ∑§ ©ûÊ⁄U Œ¥ /
Answer any FOUR questions) •ÊÒ⁄U $»¥§Ä‡ÊŸ ∑§ÊÚ‹ ∑§Ë Á‚¥≈UÄ‚ •ÊÒ⁄U ©¬ÿÈÄÃ

©ŒÊ„⁄UáÊ ∑§ ‚ÊÕ √ÿÊÅÿÊ ∑§⁄U¥?

5. (A) ç‹Ê øÊ≈¸U ÄÿÊ „Ò? ©Ÿ ¬˝ÃË∑§Ê¥ ∑§Ë ‚ÍøË ’ŸÊ∞¥

Á¡Ÿ∑§Ê ©¬ÿÊª ç‹Ê øÊ≈¸U ’ŸÊŸ ∑§ Á‹∞ ¡ÊÃÊ (B) ∞∑§ ∞⁄U ‚ •Ê¬∑§Ê ÄÿÊ •Á÷¬˝Êÿ „Ò? ‘C’ ◊¥
„Ò– ÁŒ∞ ª∞ ÃËŸ Ÿ¥’⁄UÊ¥ ∑§Ê ãÿÍŸÃ◊ ¬ÃÊ ‹ªÊŸ 1-D ∞⁄U ∑§Ê ∑Ò§‚ Á«UÄ‹•⁄U •ÊÒ⁄U ßÁŸÁ‡Êÿ‹Êß$¡

∑§ Á‹∞ ∞∑§ ç‹ÊøÊ≈¸U Áfl∑§Á‚à ∑§⁄¥U– ∑§⁄UÃ „Ò¥? ∞∑§ ∞⁄U ∑§Ë ‚Ë◊Ê ÄÿÊ „Ò? ∞∑§ ∞⁄U

(B) ‘C’ ◊¥ ÁŸáʸÿ ‹Ÿ ∑§Ê ÄÿÊ •Õ¸ „Ò? ‘C’ ◊¥ ∑§Ê ©¬ÿÊª ∑§⁄U∑§ 3x3 ◊ÚÁ≈˛U‚‚ ∑§Ê ¡Ê«∏Ÿ ∑§

∞‚ ∑§ÊÒŸ ‚ S≈U≈U◊¥≈˜U‚ „Ò¥ ¡Ê ÁŸáʸÿ ‹Ÿ •ÊÒ⁄U Á‹∞ ∞∑§ ¬˝Êª˝Ê◊ Á‹π¥–
’˝Ê¥Áø¥ª ∑§Ë ‚ÈÁflœÊ∞¥ ¬˝ŒÊŸ ∑§⁄UÃ „Ò¥? ŸS≈U«U
ß»§ ∞À‚ S≈U≈U◊¥≈U ∑§Ë ©¬ÿÈÄà ©ŒÊ„⁄UáÊ ∑§
(A) What do you mean by user defined
‚ÊÕ √ÿÊÅÿÊ ∑§⁄¥U– Function ? Explain the function

(A) What is flow chart ? List the symbols definition, function declaration and

that are used to draw a flow chart. function call with syntax and

Develop a flowchart to find out the suitable example ?

minimum of the given three
numbers.
(B) What do you mean by an Array ?
(B) What do you mean by decision
How to declare and initialize 1-D
making in C? Which are the
array in C ? What is a limitation of
statements in C that provide the
an array? Write a program to
facilities of decision making and
Branching ? Explain nested if else perform the addition of 3x3 matrices

statement with suitable example. using an array.

(7+8)
(7+8)
Page 9 SPACE FOR ROUGH WORK M3-R4-01-20
7. (A) ⁄UÊ‹
 Ÿ¥., ŸÊ◊ •ÊÒ⁄U ¬˝ÁÇÊà ∑§ ‚ÊÕ ““S≈ÍU«U¥≈U”” 9. ÁŸêŸÁ‹Áπà ◊¥ ‚ Á∑§ã„Ë¥ ÃËŸ ∑§Ë ‚¥ˇÊ¬ ◊¥ √ÿÊÅÿÊ
ŸÊ◊∑§ ∞∑§ ‚¥⁄UøŸÊ ∑§Ê ¬Á⁄U÷ÊÁ·Ã ∑§⁄U¥, ¡Ò‚ Á∑§
∑§⁄¥U—
‚ŒSÿ ©¬ÿÊª∑§Ãʸ ‚ 3 ¿UÊòÊÊ¥ ∑§ «U≈UÊ ∑§Ê ¬…∏Ã „Ò¥
•ÊÒ⁄U ©ã„¥ ©Áøà ¬˝ÊM§¬ ◊¥ ¬˝ŒÁ‡Ê¸Ã ∑§⁄UÃ „Ò–¥ (A) «UÊÿŸÊÁ◊∑§ ◊◊Ê⁄UË ∞‹Ê∑§‡ÊŸ ◊¥ malloc() •ÊÒ⁄U
(B) ‘C’ ◊¥ ©¬‹éœ ÁflÁ÷ÛÊ ¬˝∑§Ê⁄U ∑§ ‹Í¬ ∑§Ë ‚ÍøË
calloc() ∑§ ©¬ÿÊª ∑§Ë √ÿÊÅÿÊ ∑§⁄¥U
’ŸÊ∞¥ •ÊÒ⁄U Á∑§‚Ë ∞∑§ ∑§Ê Á‚¥≈UÄ‚ •ÊÒ⁄U ©¬ÿÈÄÃ
©ŒÊ„⁄UáÊ ∑§ ‚ÊÕ ‚◊¤ÊÊ∞¥– (B) ¬ÊÚߥ≈U⁄U ∑§Ë ¬Á⁄U÷Ê·Ê Á‹π¥– ¬ÊÚߥ≈U⁄U ∑§Ê ∑Ò§‚
(C) ∞∑§ ÁS≈˛¥Uª ÄÿÊ „Ò? ∞∑§ ÁS≈˛¥Uª ∑§Ê Á«UÄ‹•⁄U Á«UÄ‹•⁄U •ÊÒ⁄U ßÁŸÁ‡Êÿ‹Êß$¡ ∑§⁄UÃ „Ò¥? ¬ÊÚߥ≈U⁄U
•ÊÒ ⁄ U ßÁŸÁ‡Êÿ‹Êß$ ¡ ∑Ò § ‚ ∑§⁄UÃ „Ò ¥ ?
strcpy(),strcat() »¥§Ä‡ÊŸ ∑§ ©¬ÿÊª ∑§ ’Ê⁄U ∑§ ∑§Ê߸ ŒÊ ‹Ê÷ ’ÃÊ∞¥–
◊¥ ’ÃÊ∞°– (C) ÁŸêŸÁ‹Áπà »§Êß‹ „Ò¥«UÁ‹¥ª $»¥§Ä‡ÊŸ ∑§ ÄÿÊ
(A) Define a Structure named "Student"
with roll_no,name and percentage ©¬ÿÊª „Ò¥—
as members read the data of 3
students from user and display them fopen(), fclose(), fseek(), ftell(), rewind()
in proper format.
(B) List the various types of loop (D) ÃË‚⁄U flÁ⁄U∞’‹ ∑§Ê ©¬ÿÊª Á∑§ÿ Á’ŸÊ ŒÊ Ÿ¥’⁄U
available in C and explain any one SflÒ¬ ∑§⁄UŸ ∑§ Á‹∞ ∞∑§ ¬˝Êª˝Ê◊ Á‹π¥–
with the syntax and suitable
example. Explain briefly any three from the
(C) What is a string? How to declare
following :
and initialize a string? Explain the
use of strcpy(),strcat() function. (A) Explain the use of malloc() and
(5+5+5)
calloc() in dynamic memory
8. (A) Á⁄U∑§‡Ê¸Ÿ ‚ •Ê¬∑§Ê ÄÿÊ •Á÷¬˝Êÿ „Ò? Á⁄U∑§Á‚¸fl
allocation.
$»¥§Ä‡ÊŸ ∑§Ê ©¬ÿÊª ∑§⁄U∑§ ŒË ªß¸ ‚¥ÅÿÊ ∑§
$»Ò§Ä≈UÊÁ⁄Uÿ‹ ∑§Ê ôÊÊà ∑§⁄UŸ ∑§ Á‹∞ ∞∑§ ¬˝Êª˝Ê◊ (B) Define pointer. How to declare and
Á‹π¥– initialize pointer? Narrate any two
(B) ∞∑§ ∞⁄U ◊¥ ‚’‚ ’«∏Ë ‚¥ÅÿÊ πÊ¡Ÿ ∑§ Á‹∞ advantages of pointer.
¬ÊÚߥ≈U⁄U ∑§Ê ©¬ÿÊª ∑§⁄U∑§ ∞∑§ ¬˝Êª˝Ê◊ Á‹π¥– (C) What are the uses of following file
(C) ≈UÊ߬ M§¬Ê¥Ã⁄UáÊ ÄÿÊ „Ò? ßÁêå‹Á‚≈U •ÊÒ⁄U handling function:
∞Ä‚Áå‹Á‚≈ ≈UÊ߬ M§¬Ê¥Ã⁄UáÊ ∑§Ë ©¬ÿÈÄÃ
©ŒÊ„⁄UáÊ ∑§ ‚ÊÕ √ÿÊÅÿÊ ∑§⁄¥U– fopen(), fclose(), fseek(), ftell(),
(A) What do you mean by Recursion? rewind()
Write a program to find factorial of
(D) Write a program to swap two
given number using recursive
function. numbers without using third
(B) Write a program using pointer to variable.
(3x5)
find greatest number in an array.
(C) What is type conversion? Explain
Implicit and Explicit type conversion -o0o-
with suitable example.
(5+5+5)

Page 10 SPACE FOR ROUGH WORK M3-R4-01-20

 SPACE FOR ROUGH WORK

Page 11 SPACE FOR ROUGH WORK M3-R4-01-20

 SPACE FOR ROUGH WORK

Page 12 SPACE FOR ROUGH WORK M3-R4-01-20