Page 1
FOR MAHA SET PREPARATION
MAHA SET 2026 Paper
II Computer Science
and Applications Set A
Question Paper
EXAM YEAR TYPE
MAHA SET 2026 Question Paper
Notes · Sample Papers · Previous Year Papers · Mock Tests
Page 2
co m .
. s e
em l a
as NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN a g
NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN
NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN
OCT-37226 Question Booklet Serial No.
àíZn{ÌH$m AZwH«$_m§H$
Series Paper-II
A Computer Science and
Application
m
co
A
om
Signature and Name of Invigilator
.
Seat No.
.c e m
1. (Signature) ............................................. (In figures as in Admit Card)
e m
(Name) ...................................................
l a s
Seat No. ..............................................................
l a s (In words)
a g
ag
2. (Signature) .............................................
OMR Sheet No.
(Name) ...................................................
(To be filled by the Candidate)
Time Allowed : 2 Hours] [Maximum Marks : 200
Number of Pages in this Booklet : 24 Number of Questions in this Booklet : 100
Instructions for the Candidates {dÚmÏ`mªgmR>r _hÎdmÀ`m gyMZm
1. Write your Seat No. and OMR Sheet No. in the space provided on the 1.narjmWvZr Amnbm AmgZ H«$_m§H$ `m n¥îR>mdarb daÀ`m H$monè`mV {bhmdm. VgoM
top of this page. AmnUm§g {Xboë`m OMR CÎman{ÌHo$Mm H«$_m§H$ Ë`mImbr {bhmdm.
2. This paper consists of 100 objective type questions. Each question will 2. gXa àíZn{ÌHo$V 100 ~hþ{dH$ën àíZ AmhoV. àË`oH$ àíZmg XmoZ JwU AmhoV.
carry two marks. All questions of Paper II will be compulsory. `m àíZn{ÌHo$Vrb gd© àíZ gmoS>{dUo A{Zdm`© Amho.
3. At the commencement of examination, the question booklet will be 3. narjm gwê$ Pmë`mda {dÚmÏ`m©bm àíZn{ÌH$m {Xbr OmB©b. gwédmVrÀ`m 5 {_{ZQ>m_
§ Ü`o AmnU
m
given to the student. In the first 5 minutes, you are requested to open
co
the booklet and compulsorily examine it as follows :
gXa àíZn{ÌH$m CKSy>Z Imbrb ~m~r Adí` VnmgyZ nhmì`mV :
.
(i) To have access to the Question Booklet, tear off the paper seal on the (i) àíZn{ÌH$m CKS>Ê`mgmR>r àíZn{ÌHo$da bmdbobo grb CKS>mdo. ñQ>rH$a grb
em
edge of this cover page. Do not accept a booklet without sticker-seal Zgbobr {H§$dm grb CKS>bobr àíZn{ÌH$m ñdrH$mê$ Z`o.
or open booklet.
s
(ii) n{hë`m n¥îR>mda Z_yX Ho$ë`mà_mUo àíZn{ÌHo$Mr EHy$U n¥îR>o VgoM àíZn{ÌHo$Vrb
a
(ii) Tally the number of pages and number of questions in the booklet with
l
EHy$U àíZm§Mr g§»`m nS>VmiyZ nhmdr. n¥îR>o H$_r Agbobr/H$_r àíZ Agbobr/
the information printed on the cover page. Faulty booklets due to
g
A
missing pages/questions or questions repeated or not in serial àíZm§Mm MwH$sMm H«$_ Agbobr {H§$dm BVa ÌwQ>r Agbobr gXmof àíZn{ÌH$m
a
order or any other discrepancy should not be accepted and correct gwédmVrÀ`m 5 {_{ZQ>mVM n`©dojH$mbm naV XoD$Z Xwgar àíZn{ÌH$m _mJdyZ ¿`mdr.
booklet should be obtained from the invigilator within the period of Ë`mZ§Va àíZn{ÌH$m ~XbyZ {_iUma Zmhr VgoM doihr dmT>dyZ {_iUma Zmhr
5 minutes. Afterwards, neither the Question Booklet will be replaced `mMr H¥$n`m Zm|X ¿`mdr.
nor any extra time will be given. The same may please be noted.
(iii) After this verification is over, the OMR Sheet Number should be (iii) darbà_mUo gd© nS>VmiyZ nm{hë`mZ§VaM àíZn{ÌHo$da Amo.E_.Ama. CÎman{ÌHo$Mm
entered on this Test Booklet. H«$_m§H$ {bhmdm.
4. Each question has four alternative responses marked (A), (B), (C) and (D). 4. àË`oH$ àíZmgmR>r (A), (B), (C) Am{U (D) Aer Mma {dH$ën CÎmao {Xbr AmhoV. Ë`mVrb
You have to darken the circle as indicated below on the correct response `mo½` CÎmamMm aH$mZm Imbr Xe©{dë`mà_mUo R>iH$nUo H$mim/{Zim H$amdm.
against each item. CXm. : Oa (B) ho `mo½` CÎma Agob Va.
Example : where (B) is the correct response.
A B C D
A B C D
Imbrb MwH$sÀ`m nX²²YVr dmnê$ Z`o, H$maU {S>{OQ>mBÁS> (Digitized) _yë`m§H$ZmV ñH°${Z§J
Following wrong methods should not be used as they are not
_erZ Ë`m§Zm AmoiIV Zmhr. Ë`m nX²YVr dmnê$Z ZwH$gmZ Pmë`mg Ë`mg {dÚmWuM
m
recognised by scanning machine in digitized assessment.
c. o
Candidate using such method will be responsible for their loss. O~m~Xma AgVrb.
m
wrong methods MwH$sMr nX²²YVr
c. o e m
A
B C D A B C D A B C D A B C D A
B C D A B C D A B C D A B C D
em
5. Your responses to the items are to be indicated in the OMR Sheet given 5.
la s
`m àíZn{ÌHo$Vrb àíZm§Mr CÎmao Amo.E_.Ama. CÎman{ÌHo$VM Xe©dmdrV. BVa {R>H$mUr
las ag
inside the Booklet only. If you mark at any place other than in the circle {b{hbobr CÎmao Vnmgbr OmUma ZmhrV.
in the OMR Sheet, it will not be evaluated.
g
6. Read instructions given inside carefully. 6. AmV {Xboë`m gyMZm H$miOrnyd©H$ dmMmì`mV.
a
7. Rough Work is to be done at the end of this booklet. 7. àíZn{ÌHo$À`m eodQ>r OmoS>boë`m H$moè`m nmZmdaM H$ÀMo H$m_ H$amdo.
8. If you write your Name, Seat Number, Phone Number or put any 8. Oa AmnU Amo.E_.Ama. CÎman{ÌHo$da Z_yX Ho$boë`m {R>H$mUmì`{V{aŠV BVa H$moR>ohr Zmd,
mark on any part of the OMR Sheet, except for the space allotted for AmgZ H«$_m§H$, \$moZ Z§~a {H§$dm AmoiI nQ>ob Aer H$moUVrhr IyU Ho$bobr AmT>iyZ
the relevant entries, which may disclose your identity, or use abusive Amë`mg AWdm Agä` ^mfoMm dmna {H§$dm BVa J¡a_mJmªMm Adb§~ Ho$ë`mg {dÚmÏ`m©bm
language or employ any other unfair means, you will render yourself
liable to disqualification.
narjog AnmÌ R>a{dÊ`mV `oB©b.
9. You have to return original OMR Sheet to the invigilator at the end of 9. narjm g§në`mZ§Va {dÚmÏ`m©Zo _yi Amo.E_.Ama. CÎman{ÌH$m n`©dojH$m§H$S>o naV
the examination compulsorily and must not carry it with you outside the H$aUo Amdí`H$ Amho. VWm{n, àíZn{ÌH$m d Amo.E_.Ama. CÎman{ÌHo$Mr {ÛVr` àV
Examination Hall. You are, however, allowed to carry the Test Booklet
and duplicate copy of OMR Sheet on conclusion of examination. Amnë`m~amo~a ZoÊ`mg {dÚmÏ`mªZm nadmZJr Amho.
10. Use only Blue/Black Ball point pen. 10. \$ŠV {Ziçm {H§$dm H$miçm ~m°b noZMmM dmna H$amdm.
11. Use of any calculator or log table, etc., is prohibited. 11. H°$bŠ`wboQ>a {H§$dm bm°J Q>o~b dmnaÊ`mg nadmZJr Zmhr.
12. MwH$sÀ`m CÎmamgmR>r JwU H$nmV Ho$br OmUma Zmhr.
c
12. There is no negative marking for incorrect answers.
m .
c. o
NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN
e m
1
m a s
se
For more Question Papers, Sample Papers, Notes & Syllabus visit
g l Page 1 of 24
Page 3
2
For more Question Papers, Sample Papers, Notes & Syllabus visit Page 2 of 24
Page 4
co m .
. s e
em l a
as a g
Computer Science and Application
Paper II
m
Time Allowed : 120 Minutes] [Maximum Marks : 200
om . co
.c m
Note : This Paper contains Hundred (100) multiple choice questions. Each question
m se
e a
carrying Two (2) marks. Attempt All questions.
a s g l
gl with respect to a Micro
1. Which of the following statement is 3. Which of the following computer a
notatrue system is represented by a generic
programmed Control Unit in personal computer ?
comparison with a Hardwired Control
Unit ? (A) Single Instruction Stream, Single
Data Stream (SISD)
(A) It provides more flexibility.
o m(B) Single Instruction Stream,
.c
(B) It provides better execution
m
Multiple Data Stream (SIMD)
e
speed.
l a s
g
(C) It enables a simpler control unit (C) Multiple Instruction Stream,
design. a Single Data Stream (MISD)
(D) It makes it easier to troubleshoot
(D) Multiple Instruction Stream,
design issues involving a control
Multiple Data Stream (MIMD)
unit.
m
4. Which of the following generally does
c. o
2. Which of the following register in x86
m
c. o pointer to data ?
not use a Hardware Interrupt ?
m
architecture is generally used as a
s e
s em (A) Counter Register (CX) la
(A) System Timer
gla ag
a
(B) System Call
(B) Base Register (BX)
(C) Random Access Memory
(C) Stack Pointer Register (SP)
Controller
(D) Stack Base Pointer Register
(D) Network Interface Card
(BP)
m . c
3
c. o s e m
m a
se
For more Question Papers, Sample Papers, Notes & Syllabus visit
g l Page 3 of 24
Page 5
5. Which type of memory enables 8. ______________ cost modelling uses
appropriate for a scenario involving a a mathematical formula to predict project
pattern search ? costs based on estimates of the project
size, the number of software engineers,
(A) Auxiliary Memory
and other process and product factors.
(B) Associative Memory (A) Expert judgment
(C) Cache Memory (B) Parkinson’s law
(D) Virtual Memory (C) Algorithmic
(D) Pricing to win
6. Architectural models that may be
developed may include : A ______
9. ______ analyses and check system
model that shows the sub-systems or
representations such as the
components that are to be developed
requirements document, design
as separate units.
diagrams and the program source
(A) Static structural code.
(A) Peer reviews
(B) Dynamic process
(B) Software testing
(C) Interface model (C) System testing
(D) Relationship models (D) Hardware
7. Which establishes a framework 10. A __________ database does not just
of organizational procedures and include information about configuration
items. It may also record information
standards that lead to high-quality
about users of components, system
software ?
customers, execution platforms, proposed
(A) Quality check changes and so forth.
(A) Configuration
(B) Quality planning
(B) Change management
(C) Quality control
(C) DBMS
(D) Quality assurance (D) Testing
4
For more Question Papers, Sample Papers, Notes & Syllabus visit Page 4 of 24
Page 6
co m .
. s e
em l a
as a g
11. The level of data abstraction that 14. What is transient data ?
describes exactly how the data
(A) Data in which change to existing
m
actually stored
co
records cause the previous version
.c
(A) Conceptual level
om of the records to be eliminated
e m .
emlevel l a s
s g
gla level
(B) Physical
they have been added a
(B) Data that are never altered once
(C)aView
(D) Logical level (C) Data that are never deleted once
they have been added
12. Which normal form deals with (D) Data in which changes to
multivalued dependency ?
m
existing records do not cause
. co previous version of the records
em
(A) 4NF
las
to be eliminated
ag
(B) 3NF
(C) 2NF 15. A distributed database means
(D) 1NF (A) A loose collection of file that is
limited to one location
13. A database management system for
(B) A single logical database that is
m
c. o
its operation requires which hardware
m
constrained to one location
c. o m
component that is most important ?
m (A) High speed magnetic tape reader s e
e la
(C) A loose collection of files that is
l as ag
ag
spread to multiple locations and
(B) High speed, large capacity disk to
is interconnected by a network
store data
(D) A single logical database that is
(C) High resolution display
spread to multiple locations and
(D) High quality printer is interconnected by a network
m . c
5
c. o s e m
m a
se
For more Question Papers, Sample Papers, Notes & Syllabus visit
g l Page 5 of 24
Page 7
16. In the full/full duplex (F/FDX) mode, 18. In a transmission, if the binary pulse is
transmission is possible in both direction maintained for the entire bit time, then
it is called as ________.
at the same time but not between the
same two stations. Means (A) return to zero (RZ)
(B) unipolar return to zero (UPRZ)
(A) Sender and receiver are same
(C) non-return to zero (NRZ)
(B) One station is transmitting to a
(D) unipolar non-return to zero
second station and receiving from
(UPNRZ)
a third station at the same time
(C) Sender S1 to Receiver R1 back 19. Which coaxial cable is used for digital
to sender S1 from Receiver R1 transmission ?
nodes (A) 10 ohm cable
(D) Sender to receiver has bidirectional (B) 25 ohm cable
connectivity (C) 40 ohm cable
(D) 50 ohm cable
17. The ______ of a signal is the magnitude
of the signal at any point on the 20. How many different modes of
waveform. transmission exists in fiber optic data
transmission ?
(A) Peak value
(A) 0
(B) Amplitude
(B) 1
(C) Peak to peak
(C) 2
(D) Phase (D) 3
6
For more Question Papers, Sample Papers, Notes & Syllabus visit Page 6 of 24
Page 8
co m .
. s e
em l a
as a g
21. Let us consider the graph G and its 23. There is set of magnetic alphabet
thickness is defined as minimum number
of (edge-disjoint) planar subgraphs into letters (one of each of the 26 letters
m
which G can be decomposed. The
co
in the alphabet) that you need to put
om .
thickness of G is defined as θ (G). For
.c em
any linear graph with no-self loops of G
s
into boxes. The following rule must
e m e
la 2
s g
is defined as θ(g) ≥ because
l a a
3 v − 6 be followed, such that do not put
ag
of
(A) Each of planar subgraphs into consecutive letters in the same box.
which G is decomposed can have
atmost 3v – 6 edges What is the minimum number of boxes
(B) Each of planar subgraphs into
which G is decomposed can have you need (assume the boxes are able
atleast 3v – 6 edges
(C) Each of planar subgraphs into to hold as many letters as they need
which G is decomposed can have
m
to) ?
c. o (A) 2 boxes
exactly 3v + 6 edges
em
(D) Each of planar subgraphs into
s
which G is decomposed can have
3v edges
g l a
a
22. A group of college students were asked
(B) 3 boxes
about their TV watching habits. The (C) 1 box
conclusion of the given survey is as
follows – (D) 4 boxes
28 students watch the walking dead,
19 watch the blacklist and 24 watch
Game of Thrones. In addition to this,
o m
24. Linearity implies that linear programming
c
16 watch the walking dead and
m .
c. o
the blacklist, 14 watch the walking
e m
must satisfy the properties
s
dead and game of thrones and 10
em la and continuity
watch the blacklist and game of
las thrones. There are 8 students who
a g
(A) Multiplicity
ag watch all 3 movies. How many students
surveyed watched atleast one of the
(B) Convexity and duality
movie ?
(A) 39
(C) Proportionality and additivity
(B) 45
(C) 23
(D) Differentiability and feasibility
(D) 55
m . c
7
c. o s e m
m a
se
For more Question Papers, Sample Papers, Notes & Syllabus visit
g l
Page 7 of 24
Page 9
25. The interior and exterior paint production 26. How is hard learning problem solved ?
model is given as
Maximize z = 5x1 + 4x2
(A) Using nonlinear differentiable
Subject to 6x1 + 4x2 ≤ 24
x1 + 2x2 ≤ 6 output function for output layers.
–x1 + x2 ≤ 1
x2 ≤ 2
x1, x2 ≥ 0. (B) Using nonlinear differentiable
The optimum solution of this objective
function is shown in the figure at point output for hidden layers.
C. If we change the objective function
z = 5x1 + 4x2 to c1x1 + c2x2 then solution
(C) Using nonlinear differentiable
at C remain optimum as long as z lies
between the slopes of the intersecting output function for output and
lines at C. The relationship can be
express as hidden layers.
x2
5
Constraints : (D) Hard learning problem never be
6 6x1 + 4x2 ≤ 24 1
solved.
x1 + 2x2 ≤ 6 2
5 – x1 + x2 ≤ 1 3
1 x2 ≤ 2 4
4
3 x1 ≥ 0 5 27. Suppose there is a basket and it is
3 2 x2 ≥ 0 6
filled with some fresh fruits. The task
4
2 is to arrange the same type of fruits at
E D
C
1 Solution
F space one place. But there is no information
A B x1 about those fruits beforehand. It’s the
0 1 2 3 4 5 6 6
4 C2 2
(A) If C 1 ≠ 0, then ≤ ≤ or first time that the fruits are being seen
6 C1 1
1 C 6 or discovered here the example of
if C2 ≠ 0, then ≤ 1 ≤
2 C2 4
4 C2 3 (A) Reinforcement learning
(B) C1 ≠ 0, then ≤ ≤
6 C1 1
1 C1 7 (B) Supervised learning
(C) C2 ≠ 0, then ≤ ≤
2 C2 4
(D) If C2 ≠ 0 and C1 = 0, then (C) Unsupervised learning
1 C1 5
≤ ≤
3 C2 4 (D) Federated learning
8
For more Question Papers, Sample Papers, Notes & Syllabus visit Page 8 of 24
Page 10
co m .
. s e
em l a
as a g
28. What is perceptron ? 31. If a processor uses a 32 bit virtual
address and a 28 bit physical
(A) A single layer feed-forward neural
m
address with 2 kb pages, then how
co
network with pre processing
m .
many bits are needed for the virtual
c. o neural
(B) An auto associative and physical page number ?
se m
networkm a
s e g l
g a
ldouble layer auto associative
(A) 17, 21
a
a
(C) A
neural network
(B) 21, 17
(C) 6, 10
(D) A neural network that contain
feedback (D) 10, 6
m
c. o time of 20 ms, a MAT of 80 ns, and a
29. Who is the inventor of Artificial 32. With an average page fault service
em 10% probability of a page fault, what
Intelligence ?
l a s
g
(A) Geoffrey Hinton
a
will be the effective access time ?
(B) Andrew Ng
(A) 2,000,672 ns
(C) John McCarthy
(B) 2,000,072 ns
(D) Jurgen Schmidhuder (C) 2,000,036 ns
m
c. o
(D) 2,000,006 ns
m
30. Which of the following is not the
c. o commonly used programming
s e m
em language for Artificial Intelligence ? la
33. Application of data structure queue is
l as ag
ag
(A) Perl (A) Level wise printing of tree
(B) Java (B) Implementation of priority queues
(C) Prolog (C) Function call implementation
(D) LISP (D) Depth first search in a graph
m . c
9
c. o s e m
m a
se
For more Question Papers, Sample Papers, Notes & Syllabus visit
g l Page 9 of 24
Page 11
34. Consider the following statements. 36. A relation R is defined on the set of
integers as xRy if f(x + y) is even.
S1 : Two user level threads
Which of the following statements is
implemented in the user space
true ?
in the same process can not be
(A) R is not an equivalence relation
synchronized using a semaphore.
(B) R is an equivalence relation having
S2 : When a context switch occurs
one equivalence class
between two threads of the same
(C) R is an equivalence relation having
process then only program counter
two equivalence classes
will be changed and no other
attribute changes. (D) R is an equivalence relation having
three equivalence classes
Which of the above statements is/are
correct ?
37. Which of the following statements are
(A) S1 only true for the NFA M = ({p, q, r, s}, {0, 1},
δ, P, {q, s}), where ‘δ’ is given by
(B) S2 only
Σ 0 1
Q
(C) S1 and S2 both p q, r q
q r q,r
(D) S1 and S2 both are incorrect r s p
s – p
35. The unix command utilized to determine State transition table
the number of characters in a file is (A) NFA accepts the string 00
(A) nc (B) NFA does not accept the string
001
(B) wc
(C) NFA accepts the string 1111110
(C) chcnt
(D) NFA does not accept the string
(D) lc 00
10
For more Question Papers, Sample Papers, Notes & Syllabus visit Page 10 of 24
Page 12
co m .
. s e
em l a
as a g
38. Find the content free grammar for the 39. Define the language accepted by the
following language (with n ≥ 0, m ≥ 0) PDA M = ({q0, q1, q2, q3, q4, q5}, {a, b},
m
{0, 1, 2}, δ, q0, z, {q5}) with ‘δ’ defined
co
L = {an bm; n ≠ 2m}.
om .
as follows :
.c e m
s
(A) S → S1|S2
m
δ (q0, b, z) = {(q1, 1z)}
s e g l a
a
S1→ aaS1b|A|B
l→ aA|a a
δ (q1, b, 1) = {(q1, 11)}
ag
A δ (q2, a, 1) = {(q3, ε)}
B → bB|b δ (q3, a, 1) = {(q4, ε)}
S2 → aaS2|aC δ (q4, a, z) = {(q4, z), (q5, z)}
C → bC|ε
(A) L = {w = an bn|n ≥ 0}
(B) S1→ aaS1b|A|B
m
(B) L = {w = an – 1 bn|n ≥ 0}
A → aA|a
c. o (C) L = {w = a b |n ≥ 1}
em
n+1 n
B → bB|b
l a s
g
(D) L = {w = an b2n|n ≥ 0}
S2 → aaS2|aC
a
C → bC|ε
40. Let M = (Q, Σ, Γ, δ, q0, B, F) be a Turing
(C) S → S1|S2 Machine. Then the language accepted
S1 → aaS1b|A|B by M can be defined as
S2 → aaS2|aC (A) L(M) = {w∈Σ+ : q0w ∗ x1qf x2 for
m
m
some q ∈F, x , x ∈Γ∗}
c. o
c. o (D) S → S
C → bC| ε
m
f 1 2
s e
em S →aaS b|A|B la
(B) L(M) = {w∈Σ : q 0w ∗ x 1q f x 2,
las ag
1
q ∈F, x , x ∈Γ∗}
ag
f 1 2
1 1
A → aA|a (C) L(M) = {w∈Σ + : w ∗ x 1q f x 2,
q ∈F, x , x ∈Γ∗}
B → bB|b f 1 2
S2 → aaS2|aC (D) L(M) = {w∈Σ+ : q0w ∗ x1qf, qf ∈F,
C → bC|ε x , x ∈Γ∗}
1 2
m . c
11
c. o s e m
m a
se
For more Question Papers, Sample Papers, Notes & Syllabus visit
g l
Page 11 of 24
Page 13
41. Which of the following statement is true 44. The device which is created with a
with respect to C++ language ?
series of sensors to detect the hand
(A) It supports shallow copy but not and finger motions is known as
deep copy.
(B) It supports deep copy but not (A) digitizer
shallow copy.
(B) space ball
(C) It supports shallow copy and
deep copy.
(C) joystick
(D) It does not support shallow copy
or deep copy. (D) data glove
42. Which of the following tag is used in
HTML to define the keywords used 45. Which of the following reflection
by search engines ? transformation uses the reflection
(A) <keyword> matrix ?
(B) <meta>
0 1 0
(C) <search>
1 0 0
(D) <info>
0 0 1
43. Document Object Model (DOM) is
used in
(A) Reflection about x-axis (y = 0)
(A) web programming to access and
manipulate XML data.
(B) Reflection about y-axis (x = 0)
(B) web programming to display the
documents on the screen.
(C) Reflection along the diagonal line
(C) web programming to provide
object-oriented programming (y = x)
features to HTML.
(D) web programming to generate
(D) Reflection about the diagonal
dynamic visualization models in
a web page. (y = – x)
12
For more Question Papers, Sample Papers, Notes & Syllabus visit Page 12 of 24
Page 14
co m .
. s e
em l a
as a g
46. Which software process model has 49. Which of the following characteristics
benefit of having easier to get customer are the life cycle metrics of adaptive
feedback on the development work development method that focusses on
m
co
that has been done ? (Like customers product and projects ?
c om m .
can comment on demonstrations of the
. e
(A) Low change, low speed and high
em
software and see how much has been uncertainty
a s
lhigh
a s
implemented.)
l waterfall model a g
g
(B) Low change, high speed and
a
(A) The uncertainty
(B) Incremental development (C) High change, low speed and low
uncertainty
(C) Reuse-oriented software
engineering (D) High speed, high change and high
uncertainty
(D) Modular approach
o m________ is the property to measure
c
. time to restart after failure percentage
50.
47. How many basic process activities
e m
l a s
are organized differently in different of events causing failure probability of
a g
development processes of software
process models ?
data corruption on failure.
(A) Ease of use
(A) 3 (B) Reliability
(C) Robustness
(B) 4
(D) Portability
(C) 5
m
c. o
(D) 6 51. In a graph, if we can split all the nodes
m
c. 48.o Acceptance testing is sometimes
into two sets V1 and V2, such that there
e m
s
are no edges between two vertices of
s em called la
ag
V1 or between two vertices of V2, then
gla it is called
a (A) Unit testing (A) Partite
(B) Beta testing (B) Doublegraph
(C) Alpha testing (C) Bipartite
(D) Verification (D) Bisects
m . c
13
c. o s e m
m a
se
For more Question Papers, Sample Papers, Notes & Syllabus visit
g l
Page 13 of 24
Page 15
52. If you want to convert a recursive 55. When representing any algebraic
algorithm to non-recursive one, expression E in a 2-tree, which uses
which data structure is most likely to only binary operations:
be used ? (A) The variables and operations in E
will appear only in internal nodes
(A) Array
(B) The operations in E will appear as
(B) Stack external nodes and variables in
(C) Queue internal nodes
(C) The variables in E will appear as
(D) Tree
external nodes and operations in
internal nodes
53. A circuit less connected graph with n (D) The variables and operations
vertices has in E will appear only in external
(A) n edges nodes
(B) (n – 1) edges
56. Consider 3 problems P1, P2 and P3. It
(C) n2 edges is known that P1 has polynomial time
solution, P2 is NP- complete and P3 is in
(D) 2n edges
NP. which one of the following is true ?
I. P3 has polynomial time solution
54. In a linear search if P1 is polynomial time reducible
(A) Search starts at the middle and to P3.
goes to left or right depending on II. P3 is NP complete if P3 is
the case polynomial time reducible to P2.
III. P3 is NP complete if P2 is reducible
(B) Search starts at the beginning of
to P3.
the list and check every element
IV. P3 has polynomial time complexity
in the list until either search
and P3 is reducible to P2.
successful or list ends
(A) I
(C) Computes a hash value and (B) II
compares (C) III
(D) Search is randomly carried out (D) IV
14
For more Question Papers, Sample Papers, Notes & Syllabus visit Page 14 of 24
Page 16
co m .
. se
em l a
as a g
57. Any non-trivial property F of the 61. Given Truth Table represents which of
recursively enumerable languages is the following Logic Gate ?
(A) undecidable
m
Input Output
(B) decidable
om
A B Q
. co
.c e m
m s
(C) recursive
e a
0 0 0
a s g l
l a
(D) recursively enumerable 0 1 1
ag 1 0 1
58. What is the key limitation of a Recursive
Descent Parsing ? 1 1 0
(A) Inability to handle left recursion
A
(B) Inability to handle right recursion (A) Q
B
(C) Difficulty in constructing parse
m
c. o (B) AB
trees
em
Q
(D) Limited Lookahead capability
l a s
a g for
59. Which type of grammar is suitable
(C)
A
Q
CYK (Cocke – Younger – Kasami) B
Parsing ?
(A) LL (1)
A
(B) LR (1) (D) Q
B
(C) CFG
m
c. o
62. “100” is a number in Hexadecimal
m
(D) Regular Grammar
c. 60.o Which of the following is not a common m
Number System. What will be its
s e
em peephole optimization technique ?
representation in Decimal Number
s la
la ag
System ?
ag (A) Constant Folding
(A) 16
(B) Dead Code Elimination (B) 100
(C) Loop Unrolling (C) 256
(D) Register Allocation (D) 512
m . c
15
c. o s e m
m a
se
For more Question Papers, Sample Papers, Notes & Syllabus visit
g l
Page 15 of 24
Page 17
63. The following Logical Microoperation 64. Which of the following statement is not
represents which Truth Table ?
true ?
F ← A ⊕ B
(A) Program execution can start if the
instructions are present in RAM
(A) A B F
0 0 0 (B) Program execution can start if the
0 1 1 instructions are present in ROM
1 0 1
1 1 0 (C) Program execution can start if
the instructions are present in
EPROM
(B) A B F (D) Program execution can start if the
0 0 1
instructions are present in CPU
0 1 0
1 0 0 registers
1 1 1
65. What is the objective of Machine Level
Language in a computer system ?
(C)
A B F (A) To provide a programming
0 0 0
environment for the programmers
0 1 0
1 0 0 (B) To provide a high-level abstraction
1 1 1
for the programmers
(C) To enable direct execution of code
A B F by the computer system
(D)
0 0 1
(D) To enable execution of code on
0 1 1
1 0 1 different computer system
1 1 0 platforms
16
For more Question Papers, Sample Papers, Notes & Syllabus visit Page 16 of 24
Page 18
co m .
. s e
em l a
as a g
66. Given a fuzzy set A defined on the 69. Which of the following selection
universal set X and any number (reproduction) operator simulates based
on the slow cooling of molten metal to
α ∈[0, 1],
m
co
achieve the minimization function value
om .
in a minimization problem ?
m
(A) αA is fuzzy set and α+A is crisp
.c se
m
(A) Tournament selection
a
set
s e g l
l a a
(B) Roulette-wheel selection
g
(B) αA is crisp set and α+A is fuzzy
aset
(C) Rank selection
(D) Boltzmann selection
(C) A and A are fuzzy sets
α α+
(D) αA and α+A are crisp sets 70. Who stated that “When an axon of a
cell A is near enough to excite cell B
and repeatedly or persistently takes
m
67. Given a fuzzy relation R(X, Y), the part in firing it, some growth process
. co
membership function of its domain or metabolic change takes place in one
em
or both cells such that A’s efficiency,
s
dom R, domR(x) =
a
as one of the cell firing cell B, is
g l
a
(A) min R(x, y) increased” ?
x∈Y
(A) Hopfield
(B) miny∈Y R(x, y)
(B) Pitts
(C) maxx∈Y R(x, y) (C) McCulloch
(D) Hebb
(D) maxy∈Y R(x, y)
m
c. o
71. The nth statement in a list of 100
m
68. If the height, h(A), of a fuzzy set A is
c. o less than 1, then such a fuzzy set is m
statements is “Exactly n of the
m called as s e
statements in this list are false”.
s e la
ag
What conclusion can you draw from
l a
ag
these statements ?
(A) normal
(A) All statements are true
(B) abnormal (B) All statements are false
(C) The 99th statement is true and rest
(C) subnormal
are false
(D) fuzzy normal (D) Exactly 10 statements are true
m . c
17
c. o s e m
m a
se
For more Question Papers, Sample Papers, Notes & Syllabus visit
g l
Page 17 of 24
Page 19
72. Let R be a relation on a set S. R is 74. Let us consider the chessboards such
circular if, x, y, z ∈ S, whenever xRy that, 2 chessboards are considered
distinct if one cannot be obtained from
and yRz, it follows that zRx. Which
another through rotation. Identify the
of the properties do a reflexive and number of distinct 2 × 2 chessboards
circular relation possess ? whose cells are painted white and
black.
(A) Irreflexive
(A) 6
(B) Transitive (B) 8
(C) Antisymmetric (C) 3
(D) None of these (D) 7
75. How many different boolean functions
73. If X and Y are independent random
F(x, y, z) are there such that
variables, then the simplified form of F( x, y, z ) = F(x, y, z) for all values of
the conditional variance law is the boolean variables x, y and z ?
(A) 16
(A) The conditional variance of Y given
(B) 18
X is equal to the product of the
(C) 20
variances of X and Y
(D) 30
(B) The conditional variance of Y
given X is equal to the sum of 76. _________ is the traditional way to
the variances of X and Y allocate a single channel among
competing users.
(C) The conditional variance of Y given
(A) Polling
X is equal to the variance of Y
(B) Auction
(D) The conditional variance of Y given
(C) TDM
X is equal to the unconditional
(D) FDM
variance of Y
18
For more Question Papers, Sample Papers, Notes & Syllabus visit Page 18 of 24
Page 20
co m .
. s e
em l a
as a g
77. The data link layer on the receiving 80. What is the name of the attack in which
the attacker tries every possible key on
end removes the DLE before the data
a piece of ciphertext until an intelligible
m
are given to the network layer. This
co
translation into plaintext is obtained ?
om m .
technique is called ________.
.c e
(A) Brute-force attack
em
(A) bit stuffing
l a s
s g
(B) Timing Attack
g l a a
a
(B) character stuffing (C) Meet-in-the-middle attack
(C) padding (D) Man in the middle
(D) buffering
81. In ER model, if A is the dominant entity
and B is a subordinate entity, then
78. How many bit cheksum is used to catch
(A) If B is deleted, then A is also
m
c. o (B) If A is deleted, then B is also
all single and double errors ? deleted
s em
(A) 16 bit
l a
deleted
(B) 8 bit
a g (C) If A is deleted, then B is not
deleted
(C) 4 bit
(D) Both A and B must be always
(D) 32 bit deleted together
82. Consider two relations s and e, where s
m
79. In SMTP Protocol, which response
c. o
is a relation on scheme S(R_no, Name,
m
c. o server ?
(return) code represents OK by the Marks) and e is a relation on scheme
e m
em (A) 128 s
E(C_no, C_name). If s has m tuples and
s la
ag
e has n tuples, the natural join between
gla s and e has how many tuples ?
a (B) 250
(A) m + n
(B) m × n
(C) 251
(C) minimum of (m, n)
(D) 198 (D) maximum of (m, n)
m . c
19
c. o s e m
m a
se
For more Question Papers, Sample Papers, Notes & Syllabus visit
g l
Page 19 of 24
Page 21
83. Consider the following concurrency 85. Identify concurrency-based protocol.
control protocols.
I. Two-phase locking (A) Timestamp ordering protocol
II. Time-stamp ordering (B) Lock based protocol
Select the most appropriate option.
(C) Two-phase locking protocol
(A) Two-phase locking ensures conflict
serializability
(D) All of the above
(B) Time-stamping ordering protocol
ensures freedom from deadlock
(C) Both (A) and (B) are correct 86. Which of the following is false in the
(D) Both (A) and (B) are not correct case of a spanning tree of a graph G ?
(A) It can be cyclic
84. Let D1 and D2 be data items initialized
to zero. Consider the following two (B) It is a tree that spans G
transactions T1 and T2 :
T1 : read(D1) (C) It is a subgraph of G
read(D2)
(D) It includes every vertex of G
if D1=0 then D2 := D2+1;
write(D2);
T2 : read(D2); 87. The given figure depicts
read(D1);
b f
if D2=0 then D1 := D1+1;
write(D1) a d e h
Any non-serial interleaving of T1 and
c g
T2 for concurrent execution leads to
(A) A serializable schedule (A) Min cut problem
(B) A schedule that is not conflict
(B) Max cut problem
serializable
(C) A conflict serializable schedule (C) Flow graph
(D) A schedule that leads to deadlock (D) Dependency graph
20
For more Question Papers, Sample Papers, Notes & Syllabus visit Page 20 of 24
Page 22
co m .
. s e
em l a
as a g
88. Problems that cannot be solved by any 91. In the following incomplete code for
algorithm are called readers-writers problem, two binary
semaphores mutex and wrt are used
m
co
(A) Tractable problems
m .
to obtain synchronization.
(B) Undecidable oproblems m
c. se
em problems
wait (wrt)
s g l a
la a
(C) Decidable writing is performed
g
(D)aIntractable problems
signal (wrt)
wait (mutex)
readcount = readcount + 1
89. Space complexity refers to
if readcount = 1 then S1
(A) Disk storage required to store the S2
m
source program
c o
reading is performed
m. S3
e readcount = readcount – 1
(B) How much memory needed to
l a s
g
perform the given task
(C) How long does it take toa find a
if readcount = 0 then S4
solution signal (mutex)
The value of S1, S2, S3, S4, (in that
(D) How much time is really required
order) are _____________
to perform the given task
(A) Signal (mutex), wait (wrt), Signal
m
m c. o
(wrt), Wait (mutex)
c. o achieve localized optimum solution ? em
90. Which algorithmic approach tries to
em s
a (wrt)
(B) Signal (wrt), Signal (mutex), Wait
(mutex),lWait
las a g
ag (A) Greedy approach
(C) Wait (wrt), Signal (mutex), Wait
(B) Divide and conquer approach
(mutex), Signal (wrt)
(C) Dynamic approach (D) Signal (mutex), Wait (mutex),
(D) Backtracking approach Signal (mutex), Wait (mutex)
m . c
21
c. o s e m
m a
se
For more Question Papers, Sample Papers, Notes & Syllabus visit
g l
Page 21 of 24
Page 23
92. Disk requests come to disk driver for 94. If the postfix form of a string is
cylinders 10, 22, 20, 2, 40, 6 and 38 in ABC + – D*, the actual string is
that order at a time when the disk drive
is reading from cylinder 20. The seek (A) (A – (B + C))* D
time is 6 msec per cylinder. Compute
(B) ((A – B) + C) * D
the total seek time if the disk arm
scheduling algorithm is first come first (C) ((A + B) – C) * D
served is
(D) (A + (B – C)) * D
(A) 868 msec
(B) 884 msec 95. Which of the following systems
(C) 876 msec software does the job of merging the
records from two files into one ?
(D) 892 msec
(A) Security software
93. Consider six memory partitions of
(B) Utility program
size 200 kB, 400 kB, 600 kB, 500 kB,
300 kB and 250 kB, where kB refers (C) Networking software
to kilobyte. These partitions need to
be allotted to four processes of sizes (D) Documentation system
357 kB, 210 kB, 468 kB and 491 kB
in that order. If the best fit algorithm is 96. Which of the following is not a
used, which partitions are not allotted programming paradigm ?
to any process ?
(A) Procedural
(A) 200 kB and 300 kB
(B) Object Based
(B) 200 kB and 250 kB
(C) 250 kB and 300 kB (C) Logical
(D) 300 kB and 400 kB (D) Functional
22
For more Question Papers, Sample Papers, Notes & Syllabus visit Page 22 of 24
Page 24
co m .
. s e
em l a
as a g
97. Eclipse is an open-source software tool 99. Select the appropriate source code
used by computer programmers as translation sequence with respect to
m
co
(A) Programming Editor C language.
m (Interpreter/ .
c. o (A) Preprocessing – Assembling –
se m
em
(B) Language Processor
s g l a
la a
Compiler) Compiling – Linking
g
(C)aSource Code Debugger (B) Preprocessing – Compiling –
Assembling – Linking
(D) Integrated Development
Environment (C) Preprocessing – Compiling –
Linking – Assembling
m(D) Preprocessing – Assembling –
98. Predict the output of following source
.c o
m
code in C language :
s e
Linking – Compiling
int main ( )
g l a
{ a 100. If a language supports encapsulating
char x = 65; state and operations inside objects,
printf(“%c |%d|%f”, x, x, x); but not inheritance, then it can
return 0; appropriately categorise under which
m
} of the following category ?
m(A) 65 | 65 | 0.000000 . co
c. o e m
(A) Procedural Language
em (B) A | 65 | 0.000000 s
la Language
las a g
(B) Object Oriented
ag (C) 65 | 65 | 65.000000 (C) Object Based Language
(D) A | 65 | 65.000000 (D) Scripting Language
m . c
23
c. o s e m
m a
se
For more Question Papers, Sample Papers, Notes & Syllabus visit
g l
Page 23 of 24
Page 25
Rough Work
24
For more Question Papers, Sample Papers, Notes & Syllabus visit Page 24 of 24