Paper Computer Programmer Exam 2021
Paper Computer Programmer Exam 2021
1. 3m^ tsqr,
■"JS 3T?J^ 3TTf^^ 1 ■!, drt>lc1 I
2. i^3U3-*3?'?T?n I
3. iaoi-'3r^Tw^a^eq3H^isi^t,i^^50:a?^f i
f I.
5. ^**{1 % 3f^ ^HM ^ I yr^«b 4d<% f^y, 03 3T^ i4^n I aej|iw«h y W^M % I "STr^^
Tracr^%f^01 i
6. Nf^u'STR-^ (3Tt.T?TT.3rK. ^)^1^TTTip)^;(ll^w(H'i4=ti^^3rT^:3TT^d4dWK3ite^ I
7. fW3m-^(3f[.TrH.3m:. ^)^f^qffkcTWfili:3TR?ZR^^Tf^rfM^, 3T73I^BTRf^^ I
8. twtsxk-^ (si^.TTR.aTK.
. 1
9. -QOS - '3T' % 31^ ^ Ml WT -^t ^ 5SDI -qi cHWJIcH^ 31^ ^ ^ ci^ WT % Tmi sfM
HM«tJ Hm «n^4T I
1. ^^^iTT ! 4.
STFTtf^ra'^t ?
r- <::oni! i- (A)
(A) im Tf%TT Tl^qwr - m?IT (B)
ijcllcl (C) 3TO
(B) 3if^ WT (D) WR
TTWTM -T^sf.'^t. Mdl'Wil
2022 ^ TR^TSr^ TFR lUflR
(C) l<<t>HI^ rin<=hl
anf^RRft "f^ WR Ri
■^■^^;|3n- (rllci-41 igd HHWI 'Ml ?
7. MlPidPi'i ifen
3. WJRft TR HFT WR (CMIE) % 313RK 31^^ 2022
3lftrf^RiT, 1993gR^13n ? ■feci^ yfdi^ld
(A) 26 1994 sft ?
(A) O.lSlrfkRT
(B) 25 ^3R^, 1993
(B) O.SirfcRRT
(C) 26 1993 (C) i.sirfcRm
(D) 25^5PRft, 1994 (D) 2.1
CPE/2021 (2-A)
SECTION-'A'
General Studies
I _
(3-A) CPE/2021
8. <iSJM 'jff3RT 12. ftiiH (dW fOT ?
(A) -^34
(A) 2019
(B) -1
(B) 2020
(C) 2021 (C) ^.■Q:fr.Tl?f.'^.T3TT.%. 8
(D) 2022 (D) 3T[^.3TK.'^.TJST.T3Sr. - 1E
■Ml'KW f^clWI t ?
13. T^FTRT 315^ Wm 3TT5n^ 3R[R
^Icfl % —
(A) 50% (Itf^)1
(A) f^Hdld4 SKI
(B) 45% (yfctiild) ^ 3lf^
(C) 40% (3[f%?Rr) ^ 3TftR5 (B) Hdld4"gni
(7-A) CPE/2021
isT
24, ^^^^ 1 28. SCAEA^lft^^^^3T4t ?
-^Ah % j (A) Selective Compliance
3T^^3rRftt ? I Articulation Robot Arm
I
(C) Rm fe, ^
I ^ t -Rsft^ ^
26. =h»^<i< ^ RFC ^ 3nw ^ I
? i
^ I
(D) ^ ^ ^ aftr ^ ^ ^-
(A) ! % '^IW 3TT^-
(B) r<Hl<i yliim cbTd j
(C) r<4li yldl+Td w I
(D) I 30. FT iNlR RTWr c1l§d
j
% tilo ^H^hdl % ?
27. ? j
(A)
(A) OR I (B)
(B) NOT i
(C) NAND I (C)
(D) AND I
I
(D) ^hly.'Rfl'Mcrl ^«(Ql
CPE/2021 (8-A)
24. Which Search Technique of AI, 28. What is the acronym of SCARA ?
conies in the category of (A) Selective Compliance
Informal search domain ?
Articulation Robot Arm
(A) Branch and Bound Search (B) Selective Comphance
(B) Best First Sesirch Assembly Robot Arm
(C) Optimal Search & A* (C) Special Compliance
Assembly Robot Arm
(D) Uniformed Cast Search
(D) Special Compliance
Articulation Robot Arm
25. is required in supervised
learning.
29. What do you mean by full-
(A) Initial Training duplex mode ?
(B) Initial Testing (A) Sender can send message to
(C) Neither Initial Training nor receiver but receiver can't
Initial Testing send message to sender.
(D) Both Initial Training & (B) Sender can message to
Testing receiver and receiver can
send message to sender, but
not simultaneously.
26. What is the full form of RFC in (C) Sender can send message to
computer networks ? receiver and receiver can
(A) Remote Procedural Call send message to sender
simultaneously.
(B) Remote Program Call
(D) Neither sender nor receiver
(C) Remote Protocol Call
can exchange information
(D) Remote Privacy Call with each other.
32. The Gond caste assumes itself 37. In the year 1854 who was the
which of the following ? .. KingofRewa?
(A) Koytor (A) Raghuvir Singh
(B) Janjati (B) Raghunath Singh
(C) Backward Class (C) Raghudayal Singh
(D) Adiwasi (D) Raghuraj Singh
(11-A) CPE/2021
41. ^ 5TlTitl mR, 46. 31M<+i+ WI ■^STtPrt ■felT
cWT 3RT RWlfM^HTJp t, w|-
=b5e11cll t- (A) BRoft
(A) (B)
(B) ^=t>lci (C)
(C) "f^«5R'^?TK (D) ##RTT
(D) MdK 47. ^ ^ ^ rMWrt
42.
REZRI^ ^TRy^^l '^t
^5m|? Rftzftmrt ?
(A) (A) HldlcHdl '^MRdldHI
(B) ^JJjM (B) ftR«14l\41ddl
(C) (C) WRftzh^HT
(D) iragsrM (D) dRdI 4Rdlddl
48. mt3imikT^WRRft4NdTlAR'4^
43.
?
(A)
(A)
(B) 46K
(B) ^Rf%l
(C)
(C) TRl^
(D) h4<i yi<n
(D)
44. fR=T ^ ■feB 1^ ^ ^ ^ Rff 49. TT^ "4 mC/yfedld RTOT
■JSRcftt ? fRR'4"^ 4.4) d({l %RRlDit:
(A) (A) ^ddl
(B) 1B#T (B) "4k
(C) (C) zk
(D) (D)
45. 50. TRRR^ 3^ "iWT WRTT
(A) RJRft ?
(B) ^Tl'Mdl (A) 1982
(C) 3ra^3rtKH (B) 1985
(C) 1989
(D) -icMKH
(D) 1990
CPE/2021 (12-A)
41, The division which is group of 46. Amarkantak Thermal Power
Bhander Plateau, Kaimur Hills Station is established in
and other hills, known as — (A) Sarani
(A) Mahadev Range (B) Chachaai
(B) Maikal Range (C) Birsinghpur
(C) Vindhyan Escaxpment (D) Dongaha
(D) Bundelkhand Plateau
47. Which one of the following
projects is a joint project of
42, Rajpipla hills are part of which Madhya Pradesh and Uttar
mountain range ? Pradesh ?
(A) Vindhyan Escarpment (A) Matateela Project
(B) Kaimur Range (B) Sindh Project
(C) Vindhyan Range (C) Tawa Project
(D) Satpura Range (D) Barna Project
(13-A) CPE/2021
\
■ms - V/SECTION - 'B'
^ yldlRicCl /
Computer Science and Information Technology
51. What is the difference between I 54. Which pattern will be printed by
an abstract and an interface in
the following C program ?
# include <stdio.h>
Java ?
int main() {
(A) An abstract class can have int i, j;
constructor(s), while an for (i = 1; i< = 5; i++)
interface cannot. {
(B) An abstract class can have for (j - 1; j < = i; j ++)
non-abstract methods, {
print f("%d", j);
while interface cannot.
}
(C) An abstract class can have printf("\n");
multiple inheritance, while }
an interface cannot. return'
(A) 1
(B) Java.Util.concurrent 12 3 4
12 3 .
(C) Java.awt. *
12
(D) Java.io. * 1
CPE/2021 (14-A)
in
t
58. The circular wait condition can 61. The paging activity in which a
be prevented by ... process having less number of
(A) Defining a linear.ordering ! frames than required or when a
of resource types j
(B) using thread process is executing with a
(C) using pipes minimum set offrames allocated
(D) All of these to it is called as
62. Consider the following set of 64. Which is used to invoke a loader
processes, assumed to have to load system program and
arrived at time 0. Consider the
application program into
CPU Scheduling algorithm
Round Robin (RR). For RR, memory at intervals ?
assume the process are
(A) Assembler
scheduled in the order Pi, P2,
P3 having burst time, 24, 3 and (B) Control card interpreter
8 respectively.
(C) Cross compiler
If the time quantum for, RR is 4
miUi-seconds, then the average (D) Load and Go
waiting time for RR algorithm is
(A) 5.66
65. When the input array is already
(B) 5.25 completely sorted, the running
(C) 5.50 time of insertion sort and quick
(D) 5.70 sort will be respectively ?
p p, q P
(C) n+1
q r r
(D) n
r s —
s s s
CPE/2021 (18-A)
Consider the following statements 82. The production of the CFG is as
about pumping Lemma follows :
(a) Pumping lemma is used to S^ bb I baSa
show that languages are What will be the eqmvalent
regular. GNF(Greibach Normal Form)
(b) Pumping lemma is used to (A) S-^bA I bBSB,A^b,B^a
show that languages are
(B) S->bb I bBSB,A^a,B-^b
not regular.
(c) Pumping lemma is used to (C) S^Ab I bBSB,A->a,B->a
show that languages are (D) S^aa 1 bBSB,A~^b,B^a
not context free.
(d) Pumping lemma is used to 83. Consider the following regular
show that languages are expression
context free. (aa)*(bb)*b
Which of the following which of the following string is
statements are correct ? not generated by the given
(A) Only (a) is correct regular expression ?
(B) Only (a) and (d) is correct (A) aaaabbb
(C) Only (b) and (c)is correct (B) aabbbb
(D) Only (d) is correct (C) aaaabbbbb
81. Which of the following (D) aaaabbbb
statements are true ?
84. Consider languages L over
(a) Let G be an unrestricted S in list-1 and some decision
grammar then the problem properties of L in List-2 for
of determine whether or not L = S*. Match the correct one :
L(G)= (j) is undecidable. List - 1 List - 2
(b) Let G be an unrestricted (Languages) (Decision
grammar then the problem Properties)
of determine whether or not (a)Regular set (i) Decidable
L(G)=: (|) is decidable. (b)Deterministic (ii) Undecidable
context free
(c) Let M be any Turing languages
Machine then the question (c) Context Free (iii) Decidable
of whether or not L(M) is Languages
finite is decidable. (d) Context (iv) Undecidable
(d) Let M be . any Turing sensitive
Machine then the question languages
of whether or not L(M) is| Code :
fiinite is undecidable. ! (a) (b) (c) (d)
(A) Only (b) is true i (A) (i) (iii) (ii) (iv)
(B) Only (c) is true i (B) (i) (ii) (iii) (iv)
(C) Only (a) and (d) is true | (C) (iii) (iv) (i) (ii)
(D) Only (a) and (c) is true | (D) (iv) (iii) (i) (ii)
(19-A) CPE/2021
E|a
85. Which of the following primitive 89. A search algorithm is , if
act is used for transfer of for any graph, it always
physical location of an object ? terminates in an optimal path
(A) MOVE from start state to goal state if
(B) PTRANS path exists.
(C) MTRANS (A) Admissible
(D) PROPEL (B) Cognitive
(C) Heuristic
86. The beta value represents the
(D) Optimistic
bound on the value of a
node.
(A) upper, maximizing 90. Given following sentences :
(B) lower, maximizing (1) Marcus was a man.
(C) upper, minimizing
(2) Marcus was a Pompeian.
(D) lower, minimizing
(3) All Pompeians were
Romans.
87. A formula a is said to be
if and only if for every (4) Caesar was a ruler.
interpretation I, a is true. (5) All Romans were either
(A) Valid loyal to Caesar or hated
(B) Invalid him.
(C) 3x4
(A) Accelerator
(D) 3x2
(B) Simulator
(C) Generator
118.In Cohen-Sutherland line
(D) Actor
clipping algorithm, if the bit by
bit logical AND of the two end
point codes is not 0000, then the 121,In a n-bit plane representation
line is . of a coloured image, the
maximum possible number of
(A) Trivially accepted
colours are given by
(B) Trivially rejected formula.
(C) Required to test further for (A) (n2)3
trivial rejection
(B) (2")^
(D). Partially visible hence can
(C) 3°
not be trivially accepted or
rejected. (D) n"
(25-A) CPE/2021
^0
I
122.A rasterized line from (0, 0) to j 125.A process Model for Software
(-8, 4) using DDA algorithm lies j Engineering is based on
to which side of the actual line ? j (A) Method and Tools
(A) One side of the actual line j (B) Controls and Dehverables
(B) Perpendicular to the actual| (C) Nature of the project and
line. j Apphcation
(C) Intersect the actual line. j (D) All of these
(D) Coincide with the actual|
Hne.
126.Black box testing attempts to
find errors in the following
123.In order to minimize the categories —
computation in the Bresenham's (A) Missing errors
circle drawing algorithm, which (B) Interface errors
of the following symmetry
(C) Behaviour errors
used ?
(D) All of these
(A) 4-symmetry
(B) 16-symmetry
127.Boundary Value analysis is a
(C) 8-symmetry
test case design technique that
(D) 2-symmetry complements :
(A) Partitioning
124.Based on the tristimulus theory (B) Equivalence Partitioning
of vision, which of the following (C) Boolean Partitioning
wavelength respectively for
(D) None of these
RGB colours represent the peak
sensitivity of the three visual
pigments in the cones of the 128. Out of the following which is the
retina ? category for debugging ?
(A) 730, 580 & 330 (A) Smoke testing
(B) 830, 630 & 430 (B) Unit testing
(C) 730, 630 & 450 (C) Integration testing
(D) 630, 530 & 450 (D) Brute force
CPE/2021 (26-A)
129.The degree to which the design j 132.RMMM plan stands for
specifications are followed during| (A) Risk Monitoring, Mitigation
manufacturing is called as — | i
and Management
i and Monitoring
' f
I
\
130.Which of the following are the|
Project Scheduling Method(s)? j 133.The size of the software varies
with
(A) PERT I
(A) Requirement specifications
(B) CPM I
t'
I (B) Business Conditions
(C) Both(A)and(B) | (C) Constraints
(D) None of these | (D) All of-these
CPE/2021 (30-A)
SPACE FOR ROUGH WORK
(31-A) CPE/2021
"^5^"gjITT%
SPACE FOR ROUGH WORK
CPE/2021 (32-A)