A 1

1. The following box denote :

(1) Decision (2) Input/Output

(3) Start (4) Initialization
fuEufyf[kr ckDl fu:fir djrk gS %

(1) fu.kZ; (2) buiqV/vkmViqV

(3) 'kq# (4) çkjaHk

2. Which of the following is not an advantage of a flowchart ?

(1) Efficient coding (2) Better communication
(3) Systematic testing (4) Improper documentation
fuEu esa ls dkSu ¶ykspkVZ dk ykHk ugha gS \
(1) dq'ky dksfMax (2) csgrj lapkj
(3) O;ofLFkr ijh{k.k (4) vuqfpr çys[ku

3. Which is the correct name of a variable ?

dkSu-lk ,d pj dk lgh uke gS \
(1) + Ram (2) Ram − 1 (3) Ram 1 (4) Ram _ 1

4. What will be the output of the following program ?

# include <stdio.h>
void main ()
{
int a = 10, b = 2, x = 0;
x = a + b * a;
printf("value is =%d", x);
}
(1) 10 (2) 30 (3) 2 (4) None of these

93323/(A) P. T. O.
2 A
fuEufyf[kr çksxzke dk vkmViqV D;k gksxk \
# include <stdio.h>
void main ()
{
int a = 10, b = 2, x = 0;
x = a + b * a;
printf("value is =%d", x);
}
(1) 10 (2) 30 (3) 2 (4) buesa ls dksbZ ugha

5. What is output of below program ?

uhps çksxzke dk vkmViqV D;k gS \
int main ()
{
int i, j, count ;
count = 0;
for (i = 0; i < 5; i ++)
{
for (j = 0; j < 4; j ++)
{
count ++;
}
}
printf ("%d", count);
return 0;
}
(1) 9 (2) 10 (3) 20 (4) 30

6. What is output of below program ?

uhps çksxzke dk vkmViqV D;k gS \
int main ()
{
int x, m = 8;
x = ++m;
printf("x = %d, m = %d", x, m);
return 0;
}
(1) x = 8, m = 8 (2) x = 8, m = 9 (3) x = 9, m = 9 (4) x = 9, m = 8

93323/(A)
A 3

7. What is the output of below program ?

uhps çksxzke dk vkmViqV D;k gS \
# include <stdio.h>
void main ()
{
int a = 10;
while (a < 20);
{
printf("value of a : %d \n", a);
a ++;
if (a >15);
{
break
}
}
}
(1) value of a : 10 (2) value of a : 10
value of a : 11 value of a : 11
value of a : 12 value of a : 12
value of a : 13 value of a : 13
value of a : 14 value of a : 14
value of a : 15
value of a : 16
value of a : 17
value of a : 18
value of a : 19
(3) value of a : 10 (4) None of these
value of a : 11 buesa ls dksbZ ugha
value of a : 12
value of a : 13
value of a : 14
value of a : 15

93323/(A) P. T. O.
4 A

8. Which of the function does "returns the absolute value of i" and returns value in
integer ?
dkSu-lk QaD'ku i dk iw.kZ eku ykSVkrk gS vkSj eku baVhtj esa ykSVkrk gS \
(1) fabs (2) abs (3) floor (4) sqrt

What is the output of the following program ?

9. uhps çksxzke dk vkmViqV D;k gS \
# include <stdio.h>
int fibonacci (int i)
{
if (i == 0)
{
return 0;
}
if (i == 1)
{
return 1;
}
return fibonaci (i − 1) + fibonacci (i − 2);
}
int main ()
{
int i ;
for (i = 0; i < 10; i ++)
{
printf ("%d\t", fibonaci(i));
}
return 0;
}
(1) 0 1 1 2 3 5 8 13 21 (2) 1 1 2 3 5 8 13 21 34
(3) 0 1 1 2 3 5 8 13 21 34 (4) 1 1 2 3 5 8 13 21 34 55

10. What is use of strcat function in # include <string.h> ?

(1) Reading a line of text
(2) Join two strings
(3) Comparison of two strings
(4) None of the above
93323/(A)
A 5

# include <string.h> esa strcat QaD'ku dk D;k mi;ksx gS \

(1) VsDLV dh ,d iafä i<+uk
(2) nks fLVªUxksa dks tksM+uk
(3) nks fLVªUxksa dh rqyuk djuk
(4) mijksä esa ls dksbZ ugha

11. What is an array in C language ?

(1) An array contains more than one element

(2) A group of elements of same data type

(3) Array elements are stored in memory in continuous or contiguous locations

(4) All of the above

lh Hkk"kk esa ,d ,js D;k gS \

(1) ,d ,js esa ,d ls vf/kd rRo gksrs gSa

(2) leku MsVk çdkj ds rRoksa dk lewg

(3) ,js rRoksa dks fujarj ;k lfUufgr LFkkuksa esa eseksjh esa laxfz gr fd;k tkrk gS

(4) mijksä lHkh

12. An array index starts with ……….. .

,d ,js lwpdkad ---------- ds lkFk 'kq: gksrk gSA

(1) −1 (2) 0 (3) 1 (4) 2

13. How do you initialize an array in C ?

vki C esa ,js dks dSls bfuf'k;ykbt djrs gSa \

(1) int arr [4] = (1, 2, 3, 4); (2) int arr (4) = {1, 2, 3, 4};

(3) int arr [4] = {1, 2, 3, 4}; (4) int arr (4) = (1, 2, 3, 4);

93323/(A) P. T. O.
6 A

14. What will be the size of the following structure ?

fuEufyf[kr lajpuk dk vkdkj D;k gksxk \
# include <stdio.h>

struct temp

int a[10];

char p;

};

(1) 5 (2) 11 (3) 41 (4) 44

15. Which of the following operation is illegal in structures ?

(1) Typecasting of structure

(2) Pointer to a variable of same structure

(3) Dynamic allocation of memory for structure

(4) All of the mentioned

fuEufyf[kr esa ls dkSu-lk vkWijs'ku lajpukvksa esa voS/k gS \

(1) lajpuk dk VkbidkfLVax

(2) leku lajpuk ds ,d pj ds fy, IokWbUVj

(3) lajpuk ds fy, Le`fr dk xfr'khy vkoaVu

(4) mfYyf[kr lHkh

16. EOF is an integer type defined in stdio.h and has a value ………….. .

EOF, stdio.h esa ifjHkkf"kr ,d iw.kkaZd çdkj gS vkSj bldk eku ----------- gSA

(1) 1 (2) 0 (3) Null (4) −1

93323/(A)
A 7

17. What is the output of following program ?

fuEufyf[kr çksxzke dk vkmViqV D;k gS \

# include <stdio.h>

void main ()

{
int i = 20;
int *i, k ;
j = &i;
k = &j;

*j = 4;
printf("i =%d, *j=%d, k = %d\n", i, *j, k);

(1) i = 20, *j = 4, k = 20 (2) i = 4, *j = 20, k = 20

(3) i = 4, *j = 4, k = 4 (4) i = 4, *j = 4, k = 20

18. To find the root of equation f(x), Newton-Raphson method formula is :

lehdj.k f(x) dk ewy Kkr djus ds fy,] U;wVu-jSQlu fof/k lw= gS %

f ( xn ) f ( xn )
(1) xn +1 = xn − (2) xn +1 = xn +
f ′( xn ) f ′( xn )

f ′( xn ) f ′( xn )
(3) xn +1 = xn − (4) xn +1 = xn +
f ( xn ) f ( xn )
2
19. The next iterative value of the root of x − 4 = 0 using the Newton-Raphson method of
the initial guess is 3, is :
çkjafHkd vuqeku ds 3] U;wVu&jSQlu fof/k dk mi;ksx djds x 2 − 4 = 0 ds ewy dk
vxyk iqujko`fÙk eku gS %
(1) 1.5 (2) 2.067 (3) 2.167 (4) 3.000

93323/(A) P. T. O.
8 A

20. The Lagrange polynomial that passes through the 3 data points is given by :
ySxzsat cgqin tks 3 MsVk fcanqvksa ls gksdj xqtjrk gS] }kjk fn;k x;k gS %
x 15 18 22
y 24 37 25
f 2 ( x) = α 0 ( x)(24) + α1 ( x )(37) + α 2 ( x)(25)
The value of α1 (x) at x = 16 is most nearly :
x = 16 ij α1 dk eku fuEu ds lcls djhc gS %
(1) − 0.071430 (2) 0.500000 (3) 0.57143 (4) 4.3333

21. Gauss forward formula is useful when u :

(1) lies between 0 and 1 (2) lies between − 0.5 and 0.5
(3) lies between 0 and 1 (4) lies between −1 and 1
xkWl QkWjoMZ QkWewy
Z k mi;ksxh gS tc u %
(1) 0 vkSj 1 ds chp fLFkr gS (2) −0.5 vkSj 0.5 ds chp fLFkr gS
(3) 0 vkSj 1 ds chp fLFkr gS (4) −1 vkSj 1 ds chp fLFkr gS

22. Newton forward formula for interpolation is :

u u (u − 1) 2 u (u − 1)(u − 2) 3
(1) f (a + uh) = f (a ) + ∆f (a ) + ∆ f (a) + ∆ f (a ) + ........
1! 2! 3!
u u (u + 1) 2
(2) f (a + nh + uh) = f (a + nh) + ∇f (a + nh) + ∇ f (a + nh) + ........
1! 2!
u (u − 1) 2 u (u + 1)(u − 1) 3
(3) yu = y0 + u∆y0 + ∆ y −1 + ∆ y −1 + ........
2! 3!
(4) None of these
ç{ksi ds fy, U;wVu QkWjoMZ QkWewZyk gS %
u u (u − 1) 2 u (u − 1)(u − 2) 3
(1) f (a + uh) = f (a ) + ∆f (a ) + ∆ f (a) + ∆ f (a ) + ........
1! 2! 3!
u u (u + 1) 2
(2) f (a + nh + uh) = f (a + nh) + ∇f (a + nh) + ∇ f (a + nh) + ........
1! 2!
u (u − 1) 2 u (u + 1)(u − 1) 3
(3) yu = y0 + u∆y0 + ∆ y −1 + ∆ y −1 + ........
2! 3!
(4) buesa ls dksbZ ugha
93323/(A)
A 9

1
23. If f ( x) = , then find the divided difference of [a, b] :
x
1
;fn f ( x) = , rks [a, b] dk fMokbMsM fMQjsUl Kkr djsa %
x
−1 1
(1) ab (2) − ab (3) (4)
ab ab

3
3
24. Calculate by Trapezoidal rule an approximate value of ∫x dx by taking 7 equidistant
−3
ordinates :
3
3
VªSistkWbMy fu;e }kjk 7 lenwjLFk dksfV ysrs gq, ∫x dx ds vuqekfur ewY; dh x.kuk
−3
dhft, %
(1) 5 (2) −3 (3) 3 (4) 0

1
25. Simpson's rule is :
3
1
flEilu dk fu;e gS %
3
x0 + nh
h
(1) ∫ f ( x)dx ~ [( y0 + yn ) + 2( y1 + y2 + .... + yn −1 )]
x0
2

x0 + nh
3h
(2) ∫ f ( x)dx ~ [ y0 + 5 y1 + y2 + 5 y3 + y4 + 5 y5 + .......]
x0
10

x0 + nh
3h
(3) ∫ f ( x)dx ~ [( y0 + yn ) + 3( y1 + y2 + y4 + y5 + y7 + .... + yn −1 )
x0
8
+ 2( y3 + y6 + .... + yn − 3 )]

x0 + nh
h
(4) ∫ f ( x)dx ~ [( y0 + yn ) + 4( y1 + y3 + .... + yn −1 ) + 2( y2 + y4 + ..... yn − 2 )]
x0
3

93323/(A) P. T. O.
10 A

26. The algorithm provided to find the roots of the function using Bisection method is
given by ……………..
(1) Bolzano's theorem (2) Mean value theorem
(3) Bisection theorem (4) Secant theorem
ckblsD'ku fof/k dk mi;ksx djds] QaD'ku ds ewyksa dks Kkr djus ds fy, fn;k x;k
,YxksfjFe ----------- }kjk fn;k x;k gSA
(1) cksytkuks dh çes; (2) vkSlr ewY; çes;
(3) ckblsD'ku çes; (4) lsdSUV çes;

27. Find the second approximation for the following system : 3 x1 + 20 x2 − x3 = −18 ,
2 x1 − 3 x2 + 20 x3 = 25 , 20 x1 + x2 − 2 x3 = 17 using Gauss-Seidel iteration method with
initial approximation x1(0) = 0 , x2(0) = 0 , x3(0) = 0 :

fuEufyf[kr ç.kkyh ds fy, nwljk lfUudVu Kkr djsa % 3x1 + 20 x2 − x3 = −18,

2 x1 − 3 x2 + 20 x3 = 25, 20 x1 + x2 − 2 x3 = 17, xkWl&lhMsy iqujko`fÙk fof/k dk] çkjafHkd
lfUudVu x1(0) = 0 , x2(0) = 0 , x3(0) = 0 ds lkFk mi;ksx djrs gq, %
(1) x1( 2) = 1.0109, x2( 2) = −1.0275, x3( 2) = 2.00000

(2) x1( 2) = 1.0025, x2( 2) = −0.9998, x3( 2) = 0.9998

(3) x1( 2) = 1.0025, x2( 2) = −0.9998, x3( 2) = 2.00000

(4) x1( 2) = 1.0000, x2( 2) = −1.0000, x3( 2) = 1.0000

28. The most popular Runge-Kutta method is :

(1) First Order Runge-Kutta method (2) Second Order Runge-Kutta method

(3) Third Order Runge-Kutta method (4) Fourth Order Runge-Kutta method

lcls yksdfç; #axs&dqêk fof/k gS %

(1) QLVZ vkMZj #axs&dqêk fof/k (2) lsd.M vkMZj #axs&dqêk fof/k

(3) FkMZ vkMZj #axs&dqêk fof/k (4) QksFkZ vkMZj #axs&dqêk i)fr

93323/(A)
A 11

29. The convergence rate of the ………….. method is poor, when two largest eigen values
are nearly equal in magnitude.

(1) Power's (2) Newton's (3) Euler's (4) Bolzano's

----------- fof/k dh vfHklj.k nj [kjkc gS] tc nks lcls cM+s vkbZxsu eku ifjek.k
esa yxHkx cjkcj gSaA
(1) ikoj dh (2) U;wVu dh (3) ;wyj dh (4) cksytkuks dh
n +1
30. The iteration formula for Euler's modified method is y1 = y0 + ..... .
h
(1) f ( x.0 , y.0 ) + h (2) [ f ( x.0 , y.0 ) + f ( x1 , y1 )]
2
(3)
h
2
[
f ( x.0 , y.0 ) + f ( x1 , y1( n ) ) ] (4) None of these

;wyj ds la'kksf/kr fof/k ds fy, iqujko`fÙk lw= gS y1n +1 = y0 + ..... A

h
(1) f ( x.0 , y.0 ) + h (2) [ f ( x.0 , y.0 ) + f ( x1 , y1 )]
2
(3)
h
2
[
f ( x.0 , y.0 ) + f ( x1 , y1( n ) ) ] (4) buesa ls dksbZ ugha

31. What is the value of 4th Chebyshev polynomials if T0 ( x ) = 1 , T1 ( x) = x ?

;fn T0 ( x) = 1 , T1 ( x) = x , rks pkSFks psch'kso cgqin dk eku D;k gS \
(1) 8 x 4 + 8 x 2 + 1 (2) 8 x 4 − 8 x 2 − 1 (3) 8 x 4 − 8 x 2 + 1 (4) 16 x 5 − 20 x 3 + 5 x

32. Fit a straight line y = a + bx into the given data :

fn, x, MsVk esa ,d lh/kh js[kk y = a + bx fQV djsa %
x 5 10 15 20 25
y 12 13 14 15 16
(1) y = 11 (2) y = 0.2x (3) y = 11 + 0.2x (4) y = 1.1 + 0.2x
2
33. A polynomial of the form y = ax + bx + c is called :

(1) Linear equation (2) Second degree equation

(3) Reciprocal equation (4) Bi-quadratic equation

93323/(A) P. T. O.
12 A
QkWeZ y = ax 2 + bx + c dk ,d cgqin dks dgk tkrk gS %
(1) jSf[kd lehdj.k (2) lsd.M fMxzh lehdj.k
(3) ikjLifjd lehdj.k (4) prq?kkZr lehdj.k

34. The relationship between E and delta is :

E vkSj MsYVk ds chp laca/k gS %

(1) E = 1 − delta (2) E = delta − 1 (3) E = delta (4) E = 1 + delta

93323/(A)
B 1

1. What is output of below program ?

uhps çksxzke dk vkmViqV D;k gS \
int main ()
{
int x, m = 8;
x = ++m;
printf("x = %d, m = %d", x, m);
return 0;
}
(1) x = 8, m = 8 (2) x = 8, m = 9 (3) x = 9, m = 9 (4) x = 9, m = 8

2. What is the output of below program ?

uhps çksxzke dk vkmViqV D;k gS \
# include <stdio.h>
void main ()
{
int a = 10;
while (a < 20);
{
printf("value of a : %d \n", a);
a ++;
if (a >15);
{
break
}
}
}
(1) value of a : 10 (2) value of a : 10
value of a : 11 value of a : 11
value of a : 12 value of a : 12
value of a : 13 value of a : 13
value of a : 14 value of a : 14
value of a : 15
value of a : 16
value of a : 17
value of a : 18
value of a : 19

93323/(B) P. T. O.
2 B
(3) value of a : 10 (4) None of these
value of a : 11 buesa ls dksbZ ugha
value of a : 12
value of a : 13
value of a : 14
value of a : 15

3. Which of the function does "returns the absolute value of i" and returns value in
integer ?
dkSu-lk QaD'ku i dk iw.kZ eku ykSVkrk gS vkSj eku baVhtj esa ykSVkrk gS \
(1) fabs (2) abs (3) floor (4) sqrt

4. What is the output of the following program ?

uhps çksxzke dk vkmViqV D;k gS \
# include <stdio.h>
int fibonacci (int i)
{
if (i == 0)
{
return 0;
}
if (i == 1)
{
return 1;
}
return fibonaci (i − 1) + fibonacci (i − 2);
}
int main ()
{
int i ;
for (i = 0; i < 10; i ++)
{
printf ("%d\t", fibonaci(i));
}
return 0;
}
(1) 0 1 1 2 3 5 8 13 21 (2) 1 1 2 3 5 8 13 21 34
(3) 0 1 1 2 3 5 8 13 21 34 (4) 1 1 2 3 5 8 13 21 34 55

93323/(B)
B 3

5. What is use of strcat function in # include <string.h> ?

(1) Reading a line of text
(2) Join two strings
(3) Comparison of two strings
(4) None of the above
# include <string.h> esa strcat QaD'ku dk D;k mi;ksx gS \
(1) VsDLV dh ,d iafä i<+uk
(2) nks fLVªUxksa dks tksM+uk
(3) nks fLVªUxksa dh rqyuk djuk
(4) mijksä esa ls dksbZ ugha

6. What is an array in C language ?

(1) An array contains more than one element

(2) A group of elements of same data type

(3) Array elements are stored in memory in continuous or contiguous locations

(4) All of the above

lh Hkk"kk esa ,d ,js D;k gS \

(1) ,d ,js esa ,d ls vf/kd rRo gksrs gSa

(2) leku MsVk çdkj ds rRoksa dk lewg

(3) ,js rRoksa dks fujarj ;k lfUufgr LFkkuksa esa eseksjh esa laxfz gr fd;k tkrk gS

(4) mijksä lHkh

7. An array index starts with ……….. .

,d ,js lwpdkad ---------- ds lkFk 'kq: gksrk gSA

(1) −1 (2) 0 (3) 1 (4) 2

93323/(B) P. T. O.
4 B

8. How do you initialize an array in C ?

vki C esa ,js dks dSls bfuf'k;ykbt djrs gSa \
(1) int arr [4] = (1, 2, 3, 4); (2) int arr (4) = {1, 2, 3, 4};

(3) int arr [4] = {1, 2, 3, 4}; (4) int arr (4) = (1, 2, 3, 4);

9. What will be the size of the following structure ?

fuEufyf[kr lajpuk dk vkdkj D;k gksxk \
# include <stdio.h>

struct temp

int a[10];

char p;

};

(1) 5 (2) 11 (3) 41 (4) 44

10. Which of the following operation is illegal in structures ?

(1) Typecasting of structure

(2) Pointer to a variable of same structure

(3) Dynamic allocation of memory for structure

(4) All of the mentioned

fuEufyf[kr esa ls dkSu-lk vkWijs'ku lajpukvksa esa voS/k gS \

(1) lajpuk dk VkbidkfLVax

(2) leku lajpuk ds ,d pj ds fy, IokWbUVj

(3) lajpuk ds fy, Le`fr dk xfr'khy vkoaVu

(4) mfYyf[kr lHkh

93323/(B)
B 5

11. EOF is an integer type defined in stdio.h and has a value ………….. .
EOF, stdio.h esa ifjHkkf"kr ,d iw.kkaZd çdkj gS vkSj bldk eku ----------- gSA
(1) 1 (2) 0 (3) Null (4) −1

12. What is the output of following program ?

fuEufyf[kr çksxzke dk vkmViqV D;k gS \

# include <stdio.h>

void main ()

{
int i = 20;
int *i, k ;
j = &i;
k = &j;

*j = 4;
printf("i =%d, *j=%d, k = %d\n", i, *j, k);

(1) i = 20, *j = 4, k = 20 (2) i = 4, *j = 20, k = 20

(3) i = 4, *j = 4, k = 4 (4) i = 4, *j = 4, k = 20

13. To find the root of equation f(x), Newton-Raphson method formula is :

lehdj.k f(x) dk ewy Kkr djus ds fy,] U;wVu-jSQlu fof/k lw= gS %

f ( xn ) f ( xn )
(1) xn +1 = xn − (2) xn +1 = xn +
f ′( xn ) f ′( xn )

f ′( xn ) f ′( xn )
(3) xn +1 = xn − (4) xn +1 = xn +
f ( xn ) f ( xn )

93323/(B) P. T. O.
6 B

2
14. The next iterative value of the root of x − 4 = 0 using the Newton-Raphson method of
the initial guess is 3, is :
çkjafHkd vuqeku ds 3] U;wVu&jSQlu fof/k dk mi;ksx djds x 2 − 4 = 0 ds ewy dk
vxyk iqujko`fÙk eku gS %
(1) 1.5 (2) 2.067 (3) 2.167 (4) 3.000

15. The Lagrange polynomial that passes through the 3 data points is given by :
ySxzsat cgqin tks 3 MsVk fcanqvksa ls gksdj xqtjrk gS] }kjk fn;k x;k gS %
x 15 18 22
y 24 37 25
f 2 ( x) = α 0 ( x)(24) + α1 ( x )(37) + α 2 ( x)(25)
The value of α1 (x) at x = 16 is most nearly :
x = 16 ij α1 dk eku fuEu ds lcls djhc gS %
(1) − 0.071430 (2) 0.500000 (3) 0.57143 (4) 4.3333

16. Gauss forward formula is useful when u :

(1) lies between 0 and 1 (2) lies between − 0.5 and 0.5

(3) lies between 0 and 1 (4) lies between −1 and 1

xkWl QkWjoMZ QkWewy
Z k mi;ksxh gS tc u %
(1) 0 vkSj 1 ds chp fLFkr gS (2) −0.5 vkSj 0.5 ds chp fLFkr gS
(3) 0 vkSj 1 ds chp fLFkr gS (4) −1 vkSj 1 ds chp fLFkr gS

17. Newton forward formula for interpolation is :

u u (u − 1) 2 u (u − 1)(u − 2) 3
(1) f (a + uh) = f (a ) + ∆f (a ) + ∆ f (a) + ∆ f (a ) + ........
1! 2! 3!
u u (u + 1) 2
(2) f (a + nh + uh) = f (a + nh) + ∇f (a + nh) + ∇ f (a + nh) + ........
1! 2!
u (u − 1) 2 u (u + 1)(u − 1) 3
(3) yu = y0 + u∆y0 + ∆ y −1 + ∆ y −1 + ........
2! 3!
(4) None of these

93323/(B)
B 7
ç{ksi ds fy, U;wVu QkWjoMZ QkWewZyk gS %

u u (u − 1) 2 u (u − 1)(u − 2) 3
(1) f (a + uh) = f (a ) + ∆f (a ) + ∆ f (a) + ∆ f (a ) + ........
1! 2! 3!

u u (u + 1) 2
(2) f (a + nh + uh) = f (a + nh) + ∇f (a + nh) + ∇ f (a + nh) + ........
1! 2!

u (u − 1) 2 u (u + 1)(u − 1) 3
(3) yu = y0 + u∆y0 + ∆ y −1 + ∆ y −1 + ........
2! 3!

(4) buesa ls dksbZ ugha

1
18. If f ( x) = , then find the divided difference of [a, b] :
x

1
;fn f ( x) = , rks [a, b] dk fMokbMsM fMQjsUl Kkr djsa %
x

−1 1
(1) ab (2) − ab (3) (4)
ab ab

3
3
19. Calculate by Trapezoidal rule an approximate value of ∫x dx by taking 7 equidistant
−3
ordinates :

3
3
VªSistkWbMy fu;e }kjk 7 lenwjLFk dksfV ysrs gq, ∫x dx ds vuqekfur ewY; dh x.kuk
−3
dhft, %

(1) 5 (2) −3 (3) 3 (4) 0

93323/(B) P. T. O.
8 B

20. Simpson's 1 rule is :

3

1
flEilu dk fu;e gS %
3

x0 + nh
h
(1) ∫ f ( x)dx ~ [( y0 + yn ) + 2( y1 + y2 + .... + yn −1 )]
x0
2

x0 + nh
3h
(2) ∫ f ( x)dx ~ [ y0 + 5 y1 + y2 + 5 y3 + y4 + 5 y5 + .......]
x0
10

x0 + nh
3h
(3) ∫ f ( x)dx ~ [( y0 + yn ) + 3( y1 + y2 + y4 + y5 + y7 + .... + yn −1 )
x0
8

+ 2( y3 + y6 + .... + y n − 3 )]

x0 + nh
h
(4) ∫ f ( x )dx ~ [( y0 + yn ) + 4( y1 + y3 + .... + yn −1 ) + 2( y2 + y4 + .....yn − 2 )]
x0
3

21. The algorithm provided to find the roots of the function using Bisection method is
given by ……………..

(1) Bolzano's theorem (2) Mean value theorem

(3) Bisection theorem (4) Secant theorem

ckblsD'ku fof/k dk mi;ksx djds] QaD'ku ds ewyksa dks Kkr djus ds fy, fn;k x;k
,YxksfjFe ----------- }kjk fn;k x;k gSA

(1) cksytkuks dh çes; (2) vkSlr ewY; çes;

(3) ckblsD'ku çes; (4) lsdSUV çes;

93323/(B)
B 9

22. Find the second approximation for the following system : 3 x1 + 20 x2 − x3 = −18 ,
2 x1 − 3 x2 + 20 x3 = 25 , 20 x1 + x2 − 2 x3 = 17 using Gauss-Seidel iteration method with
initial approximation x1(0) = 0 , x2(0) = 0 , x3(0) = 0 :

fuEufyf[kr ç.kkyh ds fy, nwljk lfUudVu Kkr djsa % 3x1 + 20 x2 − x3 = −18,

2 x1 − 3 x2 + 20 x3 = 25, 20 x1 + x2 − 2 x3 = 17, xkWl&lhMsy iqujko`fÙk fof/k dk] çkjafHkd
lfUudVu x1(0) = 0 , x2(0) = 0 , x3(0) = 0 ds lkFk mi;ksx djrs gq, %

(1) x1( 2) = 1.0109, x2( 2) = −1.0275, x3( 2) = 2.00000

(2) x1( 2) = 1.0025, x2( 2) = −0.9998, x3( 2) = 0.9998

(3) x1( 2) = 1.0025, x2( 2) = −0.9998, x3( 2) = 2.00000

(4) x1( 2) = 1.0000, x2( 2) = −1.0000, x3( 2) = 1.0000

23. The most popular Runge-Kutta method is :

(1) First Order Runge-Kutta method (2) Second Order Runge-Kutta method

(3) Third Order Runge-Kutta method (4) Fourth Order Runge-Kutta method

lcls yksdfç; #axs&dqêk fof/k gS %

(1) QLVZ vkMZj #axs&dqêk fof/k (2) lsd.M vkMZj #axs&dqêk fof/k

(3) FkMZ vkMZj #axs&dqêk fof/k (4) QksFkZ vkMZj #axs&dqêk i)fr

24. The convergence rate of the ………….. method is poor, when two largest eigen values
are nearly equal in magnitude.

(1) Power's (2) Newton's (3) Euler's (4) Bolzano's

----------- fof/k dh vfHklj.k nj [kjkc gS] tc nks lcls cM+s vkbZxsu eku ifjek.k
esa yxHkx cjkcj gSaA
(1) ikoj dh (2) U;wVu dh (3) ;wyj dh (4) cksytkuks dh

93323/(B) P. T. O.
10 B

n +1
25. The iteration formula for Euler's modified method is y1 = y0 + ..... .
h
(1) f ( x.0 , y.0 ) + h (2) [ f ( x.0 , y.0 ) + f ( x1 , y1 )]
2
(3)
h
2
[
f ( x.0 , y.0 ) + f ( x1 , y1( n ) ) ] (4) None of these

;wyj ds la'kksf/kr fof/k ds fy, iqujko`fÙk lw= gS y1n +1 = y0 + ..... A

h
(1) f ( x.0 , y.0 ) + h (2) [ f ( x.0 , y.0 ) + f ( x1 , y1 )]
2
(3)
h
2
[
f ( x.0 , y.0 ) + f ( x1 , y1( n ) ) ] (4) buesa ls dksbZ ugha

26. What is the value of 4th Chebyshev polynomials if T0 ( x ) = 1 , T1 ( x) = x ?

;fn T0 ( x) = 1 , T1 ( x) = x , rks pkSFks psch'kso cgqin dk eku D;k gS \
(1) 8 x 4 + 8 x 2 + 1 (2) 8 x 4 − 8 x 2 − 1 (3) 8 x 4 − 8 x 2 + 1 (4) 16 x 5 − 20 x 3 + 5 x

27. Fit a straight line y = a + bx into the given data :

fn, x, MsVk esa ,d lh/kh js[kk y = a + bx fQV djsa %
x 5 10 15 20 25
y 12 13 14 15 16
(1) y = 11 (2) y = 0.2x (3) y = 11 + 0.2x (4) y = 1.1 + 0.2x
2
28. A polynomial of the form y = ax + bx + c is called :
(1) Linear equation (2) Second degree equation
(3) Reciprocal equation (4) Bi-quadratic equation
QkWeZ y = ax 2 + bx + c dk ,d cgqin dks dgk tkrk gS %
(1) jSf[kd lehdj.k (2) lsd.M fMxzh lehdj.k
(3) ikjLifjd lehdj.k (4) prq?kkZr lehdj.k

29. The relationship between E and delta is :

E vkSj MsYVk ds chp laca/k gS %

(1) E = 1 − delta (2) E = delta − 1 (3) E = delta (4) E = 1 + delta

93323/(B)
B 11

30. The following box denote :

(1) Decision (2) Input/Output

(3) Start (4) Initialization
fuEufyf[kr ckDl fu:fir djrk gS %

(1) fu.kZ; (2) buiqV/vkmViqV

(3) 'kq# (4) çkjaHk

31. Which of the following is not an advantage of a flowchart ?

(1) Efficient coding (2) Better communication
(3) Systematic testing (4) Improper documentation
fuEu esa ls dkSu ¶ykspkVZ dk ykHk ugha gS \
(1) dq'ky dksfMax (2) csgrj lapkj
(3) O;ofLFkr ijh{k.k (4) vuqfpr çys[ku

32. Which is the correct name of a variable ?

dkSu-lk ,d pj dk lgh uke gS \
(1) + Ram (2) Ram − 1 (3) Ram 1 (4) Ram _ 1

33. What will be the output of the following program ?

# include <stdio.h>
void main ()
{
int a = 10, b = 2, x = 0;
x = a + b * a;
printf("value is =%d", x);
}
(1) 10 (2) 30 (3) 2 (4) None of these

93323/(B) P. T. O.
12 B
fuEufyf[kr çksxzke dk vkmViqV D;k gksxk \
# include <stdio.h>
void main ()
{
int a = 10, b = 2, x = 0;
x = a + b * a;
printf("value is =%d", x);
}
(1) 10 (2) 30 (3) 2 (4) buesa ls dksbZ ugha

34. What is output of below program ?

uhps çksxzke dk vkmViqV D;k gS \
int main ()
{
int i, j, count ;
count = 0;
for (i = 0; i < 5; i ++)
{
for (j = 0; j < 4; j ++)
{
count ++;
}
}
printf ("%d", count);
return 0;
}
(1) 9 (2) 10 (3) 20 (4) 30

93323/(B)
C 1

1. What is an array in C language ?

(1) An array contains more than one element
(2) A group of elements of same data type
(3) Array elements are stored in memory in continuous or contiguous locations
(4) All of the above
lh Hkk"kk esa ,d ,js D;k gS \
(1) ,d ,js esa ,d ls vf/kd rRo gksrs gSa
(2) leku MsVk çdkj ds rRoksa dk lewg
(3) ,js rRoksa dks fujarj ;k lfUufgr LFkkuksa esa eseksjh esa laxfz gr fd;k tkrk gS
(4) mijksä lHkh

2. An array index starts with ……….. .

,d ,js lwpdkad ---------- ds lkFk 'kq: gksrk gSA
(1) −1 (2) 0 (3) 1 (4) 2

3. How do you initialize an array in C ?

vki C esa ,js dks dSls bfuf'k;ykbt djrs gSa \
(1) int arr [4] = (1, 2, 3, 4); (2) int arr (4) = {1, 2, 3, 4};
(3) int arr [4] = {1, 2, 3, 4}; (4) int arr (4) = (1, 2, 3, 4);

4. What will be the size of the following structure ?

fuEufyf[kr lajpuk dk vkdkj D;k gksxk \
# include <stdio.h>
struct temp
{
int a[10];
char p;
};

(1) 5 (2) 11 (3) 41 (4) 44

93323/(C) P. T. O.
2 C

5. Which of the following operation is illegal in structures ?

(1) Typecasting of structure
(2) Pointer to a variable of same structure
(3) Dynamic allocation of memory for structure
(4) All of the mentioned
fuEufyf[kr esa ls dkSu-lk vkWijs'ku lajpukvksa esa voS/k gS \
(1) lajpuk dk VkbidkfLVax
(2) leku lajpuk ds ,d pj ds fy, IokWbUVj
(3) lajpuk ds fy, Le`fr dk xfr'khy vkoaVu
(4) mfYyf[kr lHkh

6. EOF is an integer type defined in stdio.h and has a value ………….. .

EOF, stdio.h esa ifjHkkf"kr ,d iw.kkaZd çdkj gS vkSj bldk eku ----------- gSA
(1) 1 (2) 0 (3) Null (4) −1

7. What is the output of following program ?

fuEufyf[kr çksxzke dk vkmViqV D;k gS \

# include <stdio.h>
void main ()
{
int i = 20;
int *i, k ;
j = &i;
k = &j;
*j = 4;
printf("i =%d, *j=%d, k = %d\n", i, *j, k);
}
(1) i = 20, *j = 4, k = 20 (2) i = 4, *j = 20, k = 20
(3) i = 4, *j = 4, k = 4 (4) i = 4, *j = 4, k = 20
93323/(C)
C 3

8. To find the root of equation f(x), Newton-Raphson method formula is :

lehdj.k f(x) dk ewy Kkr djus ds fy,] U;wVu-jSQlu fof/k lw= gS %

f ( xn ) f ( xn )
(1) xn +1 = xn − (2) xn +1 = xn +
f ′( xn ) f ′( xn )

f ′( xn ) f ′( xn )
(3) xn +1 = xn − (4) xn +1 = xn +
f ( xn ) f ( xn )
2
9. The next iterative value of the root of x − 4 = 0 using the Newton-Raphson method of
the initial guess is 3, is :
çkjafHkd vuqeku ds 3] U;wVu&jSQlu fof/k dk mi;ksx djds x 2 − 4 = 0 ds ewy dk
vxyk iqujko`fÙk eku gS %
(1) 1.5 (2) 2.067 (3) 2.167 (4) 3.000

10. The Lagrange polynomial that passes through the 3 data points is given by :
ySxzsat cgqin tks 3 MsVk fcanqvksa ls gksdj xqtjrk gS] }kjk fn;k x;k gS %
x 15 18 22
y 24 37 25
f 2 ( x) = α 0 ( x)(24) + α1 ( x )(37) + α 2 ( x)(25)

The value of α1 (x) at x = 16 is most nearly :

x = 16 ij α1 dk eku fuEu ds lcls djhc gS %

(1) − 0.071430 (2) 0.500000 (3) 0.57143 (4) 4.3333

11. Gauss forward formula is useful when u :

(1) lies between 0 and 1 (2) lies between − 0.5 and 0.5

(3) lies between 0 and 1 (4) lies between −1 and 1

xkWl QkWjoMZ QkWewy
Z k mi;ksxh gS tc u %
(1) 0 vkSj 1 ds chp fLFkr gS (2) −0.5 vkSj 0.5 ds chp fLFkr gS
(3) 0 vkSj 1 ds chp fLFkr gS (4) −1 vkSj 1 ds chp fLFkr gS

93323/(C) P. T. O.
4 C

12. Newton forward formula for interpolation is :

u u (u − 1) 2 u (u − 1)(u − 2) 3
(1) f (a + uh) = f (a ) + ∆f (a ) + ∆ f (a) + ∆ f (a ) + ........
1! 2! 3!
u u (u + 1) 2
(2) f (a + nh + uh) = f (a + nh) + ∇f (a + nh) + ∇ f (a + nh) + ........
1! 2!
u (u − 1) 2 u (u + 1)(u − 1) 3
(3) yu = y0 + u∆y0 + ∆ y −1 + ∆ y −1 + ........
2! 3!
(4) None of these
ç{ksi ds fy, U;wVu QkWjoMZ QkWewZyk gS %
u u (u − 1) 2 u (u − 1)(u − 2) 3
(1) f (a + uh) = f (a ) + ∆f (a ) + ∆ f (a) + ∆ f (a ) + ........
1! 2! 3!
u u (u + 1) 2
(2) f (a + nh + uh) = f (a + nh) + ∇f (a + nh) + ∇ f (a + nh) + ........
1! 2!
u (u − 1) 2 u (u + 1)(u − 1) 3
(3) yu = y0 + u∆y0 + ∆ y −1 + ∆ y −1 + ........
2! 3!
(4) buesa ls dksbZ ugha

13. 1
If f ( x) = , then find the divided difference of [a, b] :
x
1
;fn f ( x) = , rks [a, b] dk fMokbMsM fMQjsUl Kkr djsa %
x

−1 1
(1) ab (2) − ab (3) (4)
ab ab

3
3
14. Calculate by Trapezoidal rule an approximate value of ∫x dx by taking 7 equidistant
−3
ordinates :
3
3
VªSistkWbMy fu;e }kjk 7 lenwjLFk dksfV ysrs gq, ∫x dx ds vuqekfur ewY; dh x.kuk
−3
dhft, %
(1) 5 (2) −3 (3) 3 (4) 0

93323/(C)
C 5

15. Simpson's 1 rule is :

3

1
flEilu dk fu;e gS %
3

x0 + nh
h
(1) ∫ f ( x)dx ~ [( y0 + yn ) + 2( y1 + y2 + .... + yn −1 )]
x0
2

x0 + nh
3h
(2) ∫ f ( x)dx ~ [ y0 + 5 y1 + y2 + 5 y3 + y4 + 5 y5 + .......]
x0
10

x0 + nh
3h
(3) ∫ f ( x)dx ~ [( y0 + yn ) + 3( y1 + y2 + y4 + y5 + y7 + .... + yn −1 )
x0
8

+ 2( y3 + y6 + .... + y n − 3 )]

x0 + nh
h
(4) ∫ f ( x )dx ~ [( y0 + yn ) + 4( y1 + y3 + .... + yn −1 ) + 2( y2 + y4 + .....yn − 2 )]
x0
3

16. The algorithm provided to find the roots of the function using Bisection method is
given by ……………..

(1) Bolzano's theorem (2) Mean value theorem

(3) Bisection theorem (4) Secant theorem

ckblsD'ku fof/k dk mi;ksx djds] QaD'ku ds ewyksa dks Kkr djus ds fy, fn;k x;k
,YxksfjFe ----------- }kjk fn;k x;k gSA

(1) cksytkuks dh çes; (2) vkSlr ewY; çes;

(3) ckblsD'ku çes; (4) lsdSUV çes;

93323/(C) P. T. O.
6 C

17. Find the second approximation for the following system : 3 x1 + 20 x2 − x3 = −18 ,
2 x1 − 3 x2 + 20 x3 = 25 , 20 x1 + x2 − 2 x3 = 17 using Gauss-Seidel iteration method with
initial approximation x1(0) = 0 , x2(0) = 0 , x3(0) = 0 :

fuEufyf[kr ç.kkyh ds fy, nwljk lfUudVu Kkr djsa % 3x1 + 20 x2 − x3 = −18,

2 x1 − 3 x2 + 20 x3 = 25, 20 x1 + x2 − 2 x3 = 17, xkWl&lhMsy iqujko`fÙk fof/k dk] çkjafHkd
lfUudVu x1(0) = 0 , x2(0) = 0 , x3(0) = 0 ds lkFk mi;ksx djrs gq, %
(1) x1( 2) = 1.0109, x2( 2) = −1.0275, x3( 2) = 2.00000

(2) x1( 2) = 1.0025, x2( 2) = −0.9998, x3( 2) = 0.9998

(3) x1( 2) = 1.0025, x2( 2) = −0.9998, x3( 2) = 2.00000

(4) x1( 2) = 1.0000, x2( 2) = −1.0000, x3( 2) = 1.0000

18. The most popular Runge-Kutta method is :

(1) First Order Runge-Kutta method (2) Second Order Runge-Kutta method
(3) Third Order Runge-Kutta method (4) Fourth Order Runge-Kutta method
lcls yksdfç; #axs&dqêk fof/k gS %
(1) QLVZ vkMZj #axs&dqêk fof/k (2) lsd.M vkMZj #axs&dqêk fof/k
(3) FkMZ vkMZj #axs&dqêk fof/k (4) QksFkZ vkMZj #axs&dqêk i)fr

19. The convergence rate of the ………….. method is poor, when two largest eigen values
are nearly equal in magnitude.
(1) Power's (2) Newton's (3) Euler's (4) Bolzano's
----------- fof/k dh vfHklj.k nj [kjkc gS] tc nks lcls cM+s vkbZxsu eku ifjek.k
esa yxHkx cjkcj gSaA
(1) ikoj dh (2) U;wVu dh (3) ;wyj dh (4) cksytkuks dh
n +1
20. The iteration formula for Euler's modified method is y1 = y0 + ..... .
h
(1) f ( x.0 , y.0 ) + h (2) [ f ( x.0 , y.0 ) + f ( x1 , y1 )]
2

(3)
h
2
[
f ( x.0 , y.0 ) + f ( x1 , y1( n ) ) ] (4) None of these

93323/(C)
C 7
;wyj ds la'kksf/kr fof/k ds fy, iqujko`fÙk lw= gS y1n +1 = y0 + ..... A
h
(1) f ( x.0 , y.0 ) + h (2) [ f ( x.0 , y.0 ) + f ( x1 , y1 )]
2

(3)
h
2
[
f ( x.0 , y.0 ) + f ( x1 , y1( n ) ) ] (4) buesa ls dksbZ ugha

21. What is the value of 4th Chebyshev polynomials if T0 ( x ) = 1 , T1 ( x) = x ?

;fn T0 ( x) = 1 , T1 ( x) = x , rks pkSFks psch'kso cgqin dk eku D;k gS \
(1) 8 x 4 + 8 x 2 + 1 (2) 8 x 4 − 8 x 2 − 1 (3) 8 x 4 − 8 x 2 + 1 (4) 16 x 5 − 20 x 3 + 5 x

22. Fit a straight line y = a + bx into the given data :

fn, x, MsVk esa ,d lh/kh js[kk y = a + bx fQV djsa %
x 5 10 15 20 25
y 12 13 14 15 16
(1) y = 11 (2) y = 0.2x (3) y = 11 + 0.2x (4) y = 1.1 + 0.2x
2
23. A polynomial of the form y = ax + bx + c is called :
(1) Linear equation (2) Second degree equation
(3) Reciprocal equation (4) Bi-quadratic equation
QkWeZ y = ax 2 + bx + c dk ,d cgqin dks dgk tkrk gS %
(1) jSf[kd lehdj.k (2) lsd.M fMxzh lehdj.k
(3) ikjLifjd lehdj.k (4) prq?kkZr lehdj.k

24. The relationship between E and delta is :

E vkSj MsYVk ds chp laca/k gS %
(1) E = 1 − delta (2) E = delta − 1 (3) E = delta (4) E = 1 + delta

25. The following box denote :

(1) Decision (2) Input/Output

(3) Start (4) Initialization

93323/(C) P. T. O.
8 C
fuEufyf[kr ckDl fu:fir djrk gS %

(1) fu.kZ; (2) buiqV/vkmViqV

(3) 'kq# (4) çkjaHk

26. Which of the following is not an advantage of a flowchart ?

(1) Efficient coding (2) Better communication
(3) Systematic testing (4) Improper documentation
fuEu esa ls dkSu ¶ykspkVZ dk ykHk ugha gS \
(1) dq'ky dksfMax (2) csgrj lapkj
(3) O;ofLFkr ijh{k.k (4) vuqfpr çys[ku

27. Which is the correct name of a variable ?

dkSu-lk ,d pj dk lgh uke gS \

(1) + Ram (2) Ram − 1 (3) Ram 1 (4) Ram _ 1

28. What will be the output of the following program ?

# include <stdio.h>

void main ()

int a = 10, b = 2, x = 0;

x = a + b * a;

printf("value is =%d", x);

(1) 10 (2) 30 (3) 2 (4) None of these

93323/(C)
C 9
fuEufyf[kr çksxzke dk vkmViqV D;k gksxk \
# include <stdio.h>
void main ()
{
int a = 10, b = 2, x = 0;
x = a + b * a;
printf("value is =%d", x);
}
(1) 10 (2) 30 (3) 2 (4) buesa ls dksbZ ugha

29. What is output of below program ?

uhps çksxzke dk vkmViqV D;k gS \
int main ()
{
int i, j, count ;
count = 0;
for (i = 0; i < 5; i ++)
{
for (j = 0; j < 4; j ++)
{
count ++;
}
}
printf ("%d", count);
return 0;
}
(1) 9 (2) 10 (3) 20 (4) 30

30. What is output of below program ?

uhps çksxzke dk vkmViqV D;k gS \
int main ()
{
int x, m = 8;
x = ++m;
printf("x = %d, m = %d", x, m);
return 0;
}
(1) x = 8, m = 8 (2) x = 8, m = 9 (3) x = 9, m = 9 (4) x = 9, m = 8

93323/(C) P. T. O.
10 C

31. What is the output of below program ?

uhps çksxzke dk vkmViqV D;k gS \
# include <stdio.h>
void main ()
{
int a = 10;
while (a < 20);
{
printf("value of a : %d \n", a);
a ++;
if (a >15);
{
break
}
}
}
(1) value of a : 10 (2) value of a : 10
value of a : 11 value of a : 11
value of a : 12 value of a : 12
value of a : 13 value of a : 13
value of a : 14 value of a : 14
value of a : 15
value of a : 16
value of a : 17
value of a : 18
value of a : 19
(3) value of a : 10 (4) None of these
value of a : 11 buesa ls dksbZ ugha
value of a : 12
value of a : 13
value of a : 14
value of a : 15
93323/(C)
C 11

32. Which of the function does "returns the absolute value of i" and returns value in
integer ?
dkSu-lk QaD'ku i dk iw.kZ eku ykSVkrk gS vkSj eku baVhtj esa ykSVkrk gS \
(1) fabs (2) abs (3) floor (4) sqrt

33. What is the output of the following program ?

uhps çksxzke dk vkmViqV D;k gS \
# include <stdio.h>
int fibonacci (int i)
{
if (i == 0)
{
return 0;
}
if (i == 1)
{
return 1;
}
return fibonaci (i − 1) + fibonacci (i − 2);
}
int main ()
{
int i ;
for (i = 0; i < 10; i ++)
{
printf ("%d\t", fibonaci(i));
}
return 0;
}
(1) 0 1 1 2 3 5 8 13 21 (2) 1 1 2 3 5 8 13 21 34
(3) 0 1 1 2 3 5 8 13 21 34 (4) 1 1 2 3 5 8 13 21 34 55

93323/(C) P. T. O.
12 C

34. What is use of strcat function in # include <string.h> ?

(1) Reading a line of text
(2) Join two strings
(3) Comparison of two strings
(4) None of the above
# include <string.h> esa strcat QaD'ku dk D;k mi;ksx gS \
(1) VsDLV dh ,d iafä i<+uk
(2) nks fLVªUxksa dks tksM+uk
(3) nks fLVªUxksa dh rqyuk djuk
(4) mijksä esa ls dksbZ ugha

93323/(C)
D 1

1. EOF is an integer type defined in stdio.h and has a value ………….. .

EOF, stdio.h esa ifjHkkf"kr ,d iw.kkaZd çdkj gS vkSj bldk eku ----------- gSA
(1) 1 (2) 0 (3) Null (4) −1

2. What is the output of following program ?

fuEufyf[kr çksxzke dk vkmViqV D;k gS \

# include <stdio.h>

void main ()

{
int i = 20;
int *i, k ;
j = &i;
k = &j;

*j = 4;
printf("i =%d, *j=%d, k = %d\n", i, *j, k);

(1) i = 20, *j = 4, k = 20 (2) i = 4, *j = 20, k = 20

(3) i = 4, *j = 4, k = 4 (4) i = 4, *j = 4, k = 20

3. To find the root of equation f(x), Newton-Raphson method formula is :

lehdj.k f(x) dk ewy Kkr djus ds fy,] U;wVu-jSQlu fof/k lw= gS %

f ( xn ) f ( xn )
(1) xn +1 = xn − (2) xn +1 = xn +
f ′( xn ) f ′( xn )

f ′( xn ) f ′( xn )
(3) xn +1 = xn − (4) xn +1 = xn +
f ( xn ) f ( xn )

93323/(D) P. T. O.
2 D

2
4. The next iterative value of the root of x − 4 = 0 using the Newton-Raphson method of
the initial guess is 3, is :
çkjafHkd vuqeku ds 3] U;wVu&jSQlu fof/k dk mi;ksx djds x 2 − 4 = 0 ds ewy dk
vxyk iqujko`fÙk eku gS %
(1) 1.5 (2) 2.067 (3) 2.167 (4) 3.000

5. The Lagrange polynomial that passes through the 3 data points is given by :
ySxzsat cgqin tks 3 MsVk fcanqvksa ls gksdj xqtjrk gS] }kjk fn;k x;k gS %
x 15 18 22
y 24 37 25
f 2 ( x) = α 0 ( x)(24) + α1 ( x )(37) + α 2 ( x)(25)
The value of α1 (x) at x = 16 is most nearly :
x = 16 ij α1 dk eku fuEu ds lcls djhc gS %
(1) − 0.071430 (2) 0.500000 (3) 0.57143 (4) 4.3333

6. Gauss forward formula is useful when u :

(1) lies between 0 and 1 (2) lies between − 0.5 and 0.5

(3) lies between 0 and 1 (4) lies between −1 and 1

xkWl QkWjoMZ QkWewy
Z k mi;ksxh gS tc u %
(1) 0 vkSj 1 ds chp fLFkr gS (2) −0.5 vkSj 0.5 ds chp fLFkr gS
(3) 0 vkSj 1 ds chp fLFkr gS (4) −1 vkSj 1 ds chp fLFkr gS

7. Newton forward formula for interpolation is :

u u (u − 1) 2 u (u − 1)(u − 2) 3
(1) f (a + uh) = f (a ) + ∆f (a ) + ∆ f (a) + ∆ f (a ) + ........
1! 2! 3!
u u (u + 1) 2
(2) f (a + nh + uh) = f (a + nh) + ∇f (a + nh) + ∇ f (a + nh) + ........
1! 2!
u (u − 1) 2 u (u + 1)(u − 1) 3
(3) yu = y0 + u∆y0 + ∆ y −1 + ∆ y −1 + ........
2! 3!
(4) None of these

93323/(D)
D 3
ç{ksi ds fy, U;wVu QkWjoMZ QkWewZyk gS %

u u (u − 1) 2 u (u − 1)(u − 2) 3
(1) f (a + uh) = f (a ) + ∆f (a ) + ∆ f (a) + ∆ f (a ) + ........
1! 2! 3!

u u (u + 1) 2
(2) f (a + nh + uh) = f (a + nh) + ∇f (a + nh) + ∇ f (a + nh) + ........
1! 2!

u (u − 1) 2 u (u + 1)(u − 1) 3
(3) yu = y0 + u∆y0 + ∆ y −1 + ∆ y −1 + ........
2! 3!

(4) buesa ls dksbZ ugha

1
8. If f ( x) = , then find the divided difference of [a, b] :
x

1
;fn f ( x) = , rks [a, b] dk fMokbMsM fMQjsUl Kkr djsa %
x

−1 1
(1) ab (2) − ab (3) (4)
ab ab

3
3
9. Calculate by Trapezoidal rule an approximate value of ∫x dx by taking 7 equidistant
−3
ordinates :

3
VªSistkWbMy fu;e }kjk 7 lenwjLFk dksfV ysrs gq, ∫ x 3dx ds vuqekfur ewY; dh x.kuk
−3
dhft, %

(1) 5 (2) −3 (3) 3 (4) 0

93323/(D) P. T. O.
4 D

10. Simpson's 1 rule is :

3

1
flEilu dk fu;e gS %
3

x0 + nh
h
(1) ∫ f ( x)dx ~ [( y0 + yn ) + 2( y1 + y2 + .... + yn −1 )]
x0
2

x0 + nh
3h
(2) ∫ f ( x)dx ~ [ y0 + 5 y1 + y2 + 5 y3 + y4 + 5 y5 + .......]
x0
10

x0 + nh
3h
(3) ∫ f ( x)dx ~ [( y0 + yn ) + 3( y1 + y2 + y4 + y5 + y7 + .... + yn −1 )
x0
8

+ 2( y3 + y6 + .... + y n − 3 )]

x0 + nh
h
(4) ∫ f ( x )dx ~ [( y0 + yn ) + 4( y1 + y3 + .... + yn −1 ) + 2( y2 + y4 + .....yn − 2 )]
x0
3

11. The algorithm provided to find the roots of the function using Bisection method is
given by ……………..

(1) Bolzano's theorem (2) Mean value theorem

(3) Bisection theorem (4) Secant theorem

ckblsD'ku fof/k dk mi;ksx djds] QaD'ku ds ewyksa dks Kkr djus ds fy, fn;k x;k
,YxksfjFe ----------- }kjk fn;k x;k gSA

(1) cksytkuks dh çes; (2) vkSlr ewY; çes;

(3) ckblsD'ku çes; (4) lsdSUV çes;

93323/(D)
D 5

12. Find the second approximation for the following system : 3 x1 + 20 x2 − x3 = −18 ,
2 x1 − 3 x2 + 20 x3 = 25 , 20 x1 + x2 − 2 x3 = 17 using Gauss-Seidel iteration method with
initial approximation x1(0) = 0 , x2(0) = 0 , x3(0) = 0 :

fuEufyf[kr ç.kkyh ds fy, nwljk lfUudVu Kkr djsa % 3x1 + 20 x2 − x3 = −18,

2 x1 − 3 x2 + 20 x3 = 25, 20 x1 + x2 − 2 x3 = 17, xkWl&lhMsy iqujko`fÙk fof/k dk] çkjafHkd
lfUudVu x1(0) = 0 , x2(0) = 0 , x3(0) = 0 ds lkFk mi;ksx djrs gq, %

(1) x1( 2) = 1.0109, x2( 2) = −1.0275, x3( 2) = 2.00000

(2) x1( 2) = 1.0025, x2( 2) = −0.9998, x3( 2) = 0.9998

(3) x1( 2) = 1.0025, x2( 2) = −0.9998, x3( 2) = 2.00000

(4) x1( 2) = 1.0000, x2( 2) = −1.0000, x3( 2) = 1.0000

13. The most popular Runge-Kutta method is :

(1) First Order Runge-Kutta method (2) Second Order Runge-Kutta method

(3) Third Order Runge-Kutta method (4) Fourth Order Runge-Kutta method

lcls yksdfç; #axs&dqêk fof/k gS %

(1) QLVZ vkMZj #axs&dqêk fof/k (2) lsd.M vkMZj #axs&dqêk fof/k

(3) FkMZ vkMZj #axs&dqêk fof/k (4) QksFkZ vkMZj #axs&dqêk i)fr

14. The convergence rate of the ………….. method is poor, when two largest eigen values
are nearly equal in magnitude.
(1) Power's (2) Newton's (3) Euler's (4) Bolzano's
----------- fof/k dh vfHklj.k nj [kjkc gS] tc nks lcls cM+s vkbZxsu eku ifjek.k
esa yxHkx cjkcj gSaA
(1) ikoj dh (2) U;wVu dh (3) ;wyj dh (4) cksytkuks dh

93323/(D) P. T. O.
6 D

n +1
15. The iteration formula for Euler's modified method is y1 = y0 + ..... .
h
(1) f ( x.0 , y.0 ) + h (2) [ f ( x.0 , y.0 ) + f ( x1 , y1 )]
2

(3)
h
2
[
f ( x.0 , y.0 ) + f ( x1 , y1( n ) ) ] (4) None of these

;wyj ds la'kksf/kr fof/k ds fy, iqujko`fÙk lw= gS y1n +1 = y0 + ..... A

h
(1) f ( x.0 , y.0 ) + h (2) [ f ( x.0 , y.0 ) + f ( x1 , y1 )]
2

(3)
h
2
[
f ( x.0 , y.0 ) + f ( x1 , y1( n ) ) ] (4) buesa ls dksbZ ugha

16. What is the value of 4th Chebyshev polynomials if T0 ( x ) = 1 , T1 ( x) = x ?

;fn T0 ( x) = 1 , T1 ( x) = x , rks pkSFks psch'kso cgqin dk eku D;k gS \
(1) 8 x 4 + 8 x 2 + 1 (2) 8 x 4 − 8 x 2 − 1 (3) 8 x 4 − 8 x 2 + 1 (4) 16 x 5 − 20 x 3 + 5 x

17. Fit a straight line y = a + bx into the given data :

fn, x, MsVk esa ,d lh/kh js[kk y = a + bx fQV djsa %
x 5 10 15 20 25
y 12 13 14 15 16
(1) y = 11 (2) y = 0.2x (3) y = 11 + 0.2x (4) y = 1.1 + 0.2x
2
18. A polynomial of the form y = ax + bx + c is called :
(1) Linear equation (2) Second degree equation
(3) Reciprocal equation (4) Bi-quadratic equation
QkWeZ y = ax 2 + bx + c dk ,d cgqin dks dgk tkrk gS %
(1) jSf[kd lehdj.k (2) lsd.M fMxzh lehdj.k
(3) ikjLifjd lehdj.k (4) prq?kkZr lehdj.k

19. The relationship between E and delta is :

E vkSj MsYVk ds chp laca/k gS %
(1) E = 1 − delta (2) E = delta − 1 (3) E = delta (4) E = 1 + delta
93323/(D)
D 7

20. The following box denote :

(1) Decision (2) Input/Output

(3) Start (4) Initialization
fuEufyf[kr ckDl fu:fir djrk gS %

(1) fu.kZ; (2) buiqV/vkmViqV

(3) 'kq# (4) çkjaHk

21. Which of the following is not an advantage of a flowchart ?

(1) Efficient coding (2) Better communication
(3) Systematic testing (4) Improper documentation
fuEu esa ls dkSu ¶ykspkVZ dk ykHk ugha gS \
(1) dq'ky dksfMax (2) csgrj lapkj
(3) O;ofLFkr ijh{k.k (4) vuqfpr çys[ku

22. Which is the correct name of a variable ?

dkSu-lk ,d pj dk lgh uke gS \
(1) + Ram (2) Ram − 1 (3) Ram 1 (4) Ram _ 1

23. What will be the output of the following program ?

# include <stdio.h>
void main ()
{
int a = 10, b = 2, x = 0;
x = a + b * a;
printf("value is =%d", x);
}
(1) 10 (2) 30 (3) 2 (4) None of these

93323/(D) P. T. O.
8 D
fuEufyf[kr çksxzke dk vkmViqV D;k gksxk \
# include <stdio.h>
void main ()
{
int a = 10, b = 2, x = 0;
x = a + b * a;
printf("value is =%d", x);
}
(1) 10 (2) 30 (3) 2 (4) buesa ls dksbZ ugha

24. What is output of below program ?

uhps çksxzke dk vkmViqV D;k gS \
int main ()
{
int i, j, count ;
count = 0;
for (i = 0; i < 5; i ++)
{
for (j = 0; j < 4; j ++)
{
count ++;
}
}
printf ("%d", count);
return 0;
}
(1) 9 (2) 10 (3) 20 (4) 30

25. What is output of below program ?

uhps çksxzke dk vkmViqV D;k gS \
int main ()
{
int x, m = 8;
x = ++m;
printf("x = %d, m = %d", x, m);
return 0;
}
(1) x = 8, m = 8 (2) x = 8, m = 9 (3) x = 9, m = 9 (4) x = 9, m = 8

93323/(D)
D 9

26. What is the output of below program ?

uhps çksxzke dk vkmViqV D;k gS \
# include <stdio.h>
void main ()
{
int a = 10;
while (a < 20);
{
printf("value of a : %d \n", a);
a ++;
if (a >15);
{
break
}
}
}
(1) value of a : 10 (2) value of a : 10
value of a : 11 value of a : 11
value of a : 12 value of a : 12
value of a : 13 value of a : 13
value of a : 14 value of a : 14
value of a : 15
value of a : 16
value of a : 17
value of a : 18
value of a : 19
(3) value of a : 10 (4) None of these
value of a : 11 buesa ls dksbZ ugha
value of a : 12
value of a : 13
value of a : 14
value of a : 15
93323/(D) P. T. O.
10 D

27. Which of the function does "returns the absolute value of i" and returns value in
integer ?
dkSu-lk QaD'ku i dk iw.kZ eku ykSVkrk gS vkSj eku baVhtj esa ykSVkrk gS \
(1) fabs (2) abs (3) floor (4) sqrt

28. What is the output of the following program ?

uhps çksxzke dk vkmViqV D;k gS \
# include <stdio.h>
int fibonacci (int i)
{
if (i == 0)
{
return 0;
}
if (i == 1)
{
return 1;
}
return fibonaci (i − 1) + fibonacci (i − 2);
}
int main ()
{
int i ;
for (i = 0; i < 10; i ++)
{
printf ("%d\t", fibonaci(i));
}
return 0;
}
(1) 0 1 1 2 3 5 8 13 21 (2) 1 1 2 3 5 8 13 21 34
(3) 0 1 1 2 3 5 8 13 21 34 (4) 1 1 2 3 5 8 13 21 34 55

29. What is use of strcat function in # include <string.h> ?

(1) Reading a line of text
(2) Join two strings
(3) Comparison of two strings
(4) None of the above

93323/(D)
D 11
# include <string.h> esa strcat QaD'ku dk D;k mi;ksx gS \
(1) VsDLV dh ,d iafä i<+uk
(2) nks fLVªUxksa dks tksM+uk
(3) nks fLVªUxksa dh rqyuk djuk
(4) mijksä esa ls dksbZ ugha

30. What is an array in C language ?

(1) An array contains more than one element

(2) A group of elements of same data type

(3) Array elements are stored in memory in continuous or contiguous locations

(4) All of the above

lh Hkk"kk esa ,d ,js D;k gS \

(1) ,d ,js esa ,d ls vf/kd rRo gksrs gSa

(2) leku MsVk çdkj ds rRoksa dk lewg

(3) ,js rRoksa dks fujarj ;k lfUufgr LFkkuksa esa eseksjh esa laxfz gr fd;k tkrk gS

(4) mijksä lHkh

31. An array index starts with ……….. .

,d ,js lwpdkad ---------- ds lkFk 'kq: gksrk gSA
(1) −1 (2) 0 (3) 1 (4) 2

32. How do you initialize an array in C ?

vki C esa ,js dks dSls bfuf'k;ykbt djrs gSa \
(1) int arr [4] = (1, 2, 3, 4); (2) int arr (4) = {1, 2, 3, 4};

(3) int arr [4] = {1, 2, 3, 4}; (4) int arr (4) = (1, 2, 3, 4);

93323/(D) P. T. O.
12 D

33. What will be the size of the following structure ?

fuEufyf[kr lajpuk dk vkdkj D;k gksxk \
# include <stdio.h>

struct temp

int a[10];

char p;

};

(1) 5 (2) 11 (3) 41 (4) 44

34. Which of the following operation is illegal in structures ?

(1) Typecasting of structure

(2) Pointer to a variable of same structure

(3) Dynamic allocation of memory for structure

(4) All of the mentioned

fuEufyf[kr esa ls dkSu-lk vkWijs'ku lajpukvksa esa voS/k gS \

(1) lajpuk dk VkbidkfLVax

(2) leku lajpuk ds ,d pj ds fy, IokWbUVj

(3) lajpuk ds fy, Le`fr dk xfr'khy vkoaVu

(4) mfYyf[kr lHkh

93323/(D)