MPPSC Assistant Professor 2026: Assistant Professor (Computer Science) Exam - 2025, Computer Science
Text of page 1
II n1<:!
I-, /N n1/
V_-iL—y
9 ©
9 riiH ^\sMI ©
9 CS/2025 Question Booklet SI. No. ©
9
9 Series ©
9 ©
COMPUTER SCIENCE 6550941
©
9 ©
9 ©
9 ©
9 ©
9 ©
3TqTTT aiggiiri^ ^ : ©
g aipitw ©
Candidate should write his/her
9 Roll No. ©
9 Roll No. in the given boxes. ©
9 .©
Q 3^3^^^hsn/No. of Printed Pages:48 3R^f ■«(sMl/Total No. of Questions : 150 ©
©
® ^m/Tirne:3^/Hours 3^/Total Marks: 600 ©
©
9 '©
9 ©
9 ©
9 ©
9
1. 3TFT w ^ 31^ ^ ^ ^ W, TO ^ ^ ©
9
9
^311 3^ ami 37Tf^ ^ 1 ^ t, ^ ^ ^ 31^-3^^4)1 ^ ^ I ©
©
9 ©
9 2. ^ 3IH-3f^4)l ^ 15031^ f I ^ 3R^ 31^ f I^3R=T 3^f^4pf f I ©
9
9
9
3. 31^ (3it.T3TT.3TK. ^fts) KT Tjti ^ STRt^sp "q^ fraT 3rT^ 3^ cT^^RK 3Tf^ 4vf | ©
9 ©. --- H
9 4. 3tK-tT^ (3it.T?T.3TK. KT "f^mfftcT ^«IHt tr 3314m 3rf^f^ 4^, 3T^ 4^ 3^ I ©I
9 ©
9
9 5. Trd^iifT 15) cppf % alR^H ki f^tilRo 41 4R, 3t^t4 «t)^ 44t 34^-44
9 (3Tt.T^.3TR. ^) TK tft 3^ I ©I
9 ©
9 ©1
9 6. leRft 3R3 ^ 3I4)K ^ 41 (I'zTRTT^) 3[4>R ^ ■^, cit 3R3 % cRIT 3Td^ ^^TRKf "9 ^1|^
9 ©
9 <?'HicK ^ HM«h hHI ^iy.'ll I ©
9 ©
'©
INSTRUCTIONS TO THE CANDIDATES
©
1. Immediately eifter the commencement of the examination, you should check that this Question ©
©
Booklet does not have any unprinted or torn or missing pages or items etc. If so, immediately ©
contact the Invigilator and get it replaced with another Question Booklet. ©
©
©
2. This Question Booklet contains Total 150 questions of Computer Science subject. All questions ©
axe in Hindi and English languages. All questions are compulsory.
©
©
3. Read carefully the instructions given on the Answer Sheet (OMR) supplied and indicate your ©
answers accordingly. ©
©
4. Kindly make necessary entries on the Answer Sheet (OMR) at the places indicated and nowhere else. ©
©
5. Examinee should do all rough work on the space meant for rough work on pages given at the end of ©
the Question Booklet and nowhere else, not even on the Answer Sheet (OMR).
©
©
6. If there is any sort of mistake either of printing or of factual nature in any question, then out of the ©
Hindi and English versions of the question, the Hindi version will be treated as standard.
_©
CS/2025-A
n'/
Text of page 3
PAPER-II
COMPUTER SCIENCE
1. A system has 5 processes [P^ — PJ 4. In the context of disk schediiUng
algorithms, which of the following
and 3 resource types (A, B, C). The
is not a characteristic of SCAN
current allocation and maximum algorithm ?
need matrices are : (A) Also known as elevator
Allocation = [[0, 1, 0], [2, 0, 0], algorithm
[3, 0, 2],[2, 1, 1], [0, 0, 2]] (B) Moves the disk arm towards
Max =[[7, 5, 3], [3, 2, 2],[9, 0,2], an end, servicing requests
until it reaches the end then
[2, 2, 2],[4, 3, 3]]
reverse direction
Available = [3, 3, 2] (C) May cause starvation ofrequests
Which of the following sequence is at the end of the disk
not a safe sequence according to (D) Provides more uniform wait
the Banker's algorithm ? times compared to FCFS
(A)
(B) Pg^Pj->P^^P^-^P^ 5. Given a disk queue with requests
(C) P^^P^^P^^P^^P^ for tracks :98,183, 37, 122, 14,
124, 65, 67. If the disk head starts
(D) P^-^P^^Pg^P^^P^
at track 53 and uses the SCAN
2. Inverted page tables are primarily algorithm moving toward higher
used to ' tracks first, what is the total head
(A) Reduce the overhead of movement ?
maintaining multiple page
tables (A) 236
(B) Simplify the Translation (B) 299
Lookaside Buffer(TLB)
(C) Minimize internal (C) 331
fragmentation (D) 208
(D) Support segmentation
6. 'C Language is a
3. Internal fragmentation occurs in
paging because (A) Object-Oriented Programming
(A) Pages are not fully utihzed .Language
(B) Processes are allocated (B) Procedxnal Language
inconsistent memory (C) Machine Language
(C) The page table size is too large (D) Common Business-Oriented
(D) The TLB is overloaded Language
CS/2025-A [P.T.O.
Text of page 5
7. What will be the output of the 11. The database must not contain
following program ? any unmatched foreign key values
Void main() is known as
{ inti; (A) Referential path
for (i = 0; i < 3 ; i ++);
(B) Referential cycle
printf("%d",i);
(0) Referential integrity
}
(D) Referential diagram
(A) 3
(B) 0 12
12. A SQL consists of a set of embedded
(C) 0 1 2 3
SQL facilities that are provided
(D) Errors
specifically to allow the construction
of generalized, online and possibly
8. A new Object-Oriented Language
JAVA was developed by interactive appHcations is known as
(A) James Gosling (A) Standard SQL
(B) Johan Atanasoff (B) Embedded SQL
(C) Charles Babbage
(0) Static SQL
(D) Ada Lovelace
(D) Dynamic SQL
9. In the JAVA.awt.package, the
coloring scheme ranges Jfrom 13. What is phantom read in the
0 to 255 are called
. context of transaction isolation
(A) GBR levels ?
(B) BRG
.(A) A transaction reads a set ofrows
(C) RGB that were inserted by another
(D) BGR transaction after it started
.(B) A transaction reads data that
10. In JAVA,symbols of Boolean
was committed by another
operators &&, |] and ! are
transaction
respectively represented as
(A) NAND,NORandXOR (0) Atransaction reads data that was
(B) AND,OR and NOT changed by another transaction
(0) NOT, OR and AND but not yet committed
(D) OR,AND and NOT (D) None of the above
CS/2025-A [P.T.O.
Text of page 7
14. A relation in which, if and only if 17. . Which operating system structure
every non-trivial, left-irreducible allows for the operating system to
be broken into a number of layers,
FD has a candidate key as its each built on top of lower layers,
determinant is known as with the bottom layer being the
hardware ?
(A) 3NF (A) Monolithic structure
(B) Layered approach
(B) BCNF
(C) Microkernel
(C) Trivial FD (D) Security layer
(D) 2NF 18. In a virtual machine architecture,
what is the key benefit of using a
h5rpervisor (Type 1 VMM)?
15. A file is the collection of all
(A) It allows guest OS to run
occurrences of one type of stored unmodified on host hardware
record, is known as (B) It reduces the need of hardware
virtualization support
(A) Stored system
(C) It enables dynamic allocation of
(B) Stored field system resources across multiple
VMs
(C) Stored record (D) It eliminates the risk ofsecurity
(D) Stored file breaches in guest OS
19. In a system emplojdng the
16. Hybrid Operating System Banker's algorithm for deadlock
structures combine elements avoidance, which of the following
scenarios would cause the system
of microkernel and monolithic
to be in xmsafe state ?
designs. Which statement best (A) The system has enough
explains why hybrid system retain resources to satisfy the
maximum possible demands of
some services in kernel space ? V all process simultaneously
(A) To minimize context-switching (B) A process requests resources
that, if allocated, leave the
over head of critical operations
system without enough resources
(B) To enforce strict security to satisfy the maximum possible
policies demands of other resources
(C) AH processes are currently
(C) To simplify application resources less than their
development maximum needs
(D) The system has more resources
(D) To eliminate the need.of system than the total,maximum needs
calls of all processes combined
CS/2025-A [P.T.O.
Text of page 8
20. 25.
yisb^l,31^^ MR'Nrfn 3TT1SIT^^3Rft t 3^1 ^TO t1
?
(A) append()
(A) ^w ->^(Ti^ ->^)
(B) 3Rito^^(t&T->^) (B) Extend()
(C) ->3Icft8ETT ("yt. (C) POPO
(D) (D) remove()
21. WH ylyiPi'i ^mr^fenn
"SRT 'FTT ^ I 26. ^ WR^^3n
(A) ^ t^^^
(B) tPRT"^ [cl4dl41 I
iratfe,^31^ arq^
(D)
"^qrq i^icr t, aftr^
22. ^Tf^m % ^3TO f' %1M Mq^^ arm^qq^
(A)
(B) ^Ti^, 1^,^ ^t,^^ ^37q?R^^^
(C) 1^ l^^i 'TOT ^
(D) ^ .■ (A) eftror (LAN)
23. (B) t^ii)
^Idl I'
(C) i^(X)
(A) ^d<l<|Rl
(B) (D) (E)
(C)
(D) ^
27. ^qRr WTTTO:
24] aif^ t, ^qjq t?
■ I^^^RKTT.t i , . '." . (A) ^
(A) bS.argy (B) #T (eftqj^ qjiqi ^sq%)
• (B) Sys'.argv • - .t ' \^[
(C) (^^tqtfcTzq q^qi %sq%)
(C)' .argv - '
(D) (D) ^(q^Trftqi^^qi)
CS/2025-A 8
Text of page 9
20. Which of the following process 25. In Psdihon, the method
state transitions is not possible in removes and returns the item at
a t3^ical operating system ? the given index."
(A) Running —> Ready
(B) Waiting —> Ready (A) append()
(C) Ready -> Waiting (B) Extend()
(D) Running —> Waiting
(C) POPO
21. Pjrthon Programming Language (D) remove()
was developed by
(A) Charles Babbage
26. An interconnected set of networks,
(B) Dennis Ritchie
(C) Guido Van Rossum from a user's point of view, may
(D) Larry Wall appear simply as a larger network.
However,if each of the constituent
22. Basic data tjTJes of P5rthon are network retains its identity,
(A) Numbers, Boolean, Float, and special mechanisms are
Strings needed for communicating across
(B) Numbers, Boolean, Strings, -■ multiple networks, then the entire
None
configuration is often referred to as
(C) Numbers, Boolean, Pointer,
..an
Strings
(D) Numbers, Strings, Const, None (A) Local Area Network (LAN)
(B) Internet (i)
23. Loop Control Flow Statements are
called (C) Intranet (1)
(A) Iteration statement
(D) Extranet (E)
(B) Conditional statement
(C) Break statement
27. Which tjfpe of network tjrpically has
(D) Continue statement
higher speed but shorter distance ?
24. The command line arguments in (A) WAN (Wide Area Network)
Pjrthon can be printed as a list of
string by executing (B) LAN (Local Area Network)
(A) OS.argv
(C) MAN (Metropolitan Area
(B) Sys.argv
Network)
(C) .argv • I
(D) None of these (D) PAN (Personal Area Network)
CS/2025-A . [P.T.O.
Text of page 11
28. In a bus topology, what are the 32. De Morgan's second law states that
special connector located at the end the complement of the intersection
of the bus called ? of a collection of sets is equal to
(A) Routers
(A) The intersection of the
(B) Terminators
complements of the sets
(C) Hubs
(D) Switches (B) The union of the complements
of the sets
29. The strength of a signal decreases (C) The union of the original sets
with increase in distance travelled
(D) None of the above
over a medium. This is known as
(A) Noise
33. Which of the following statements
(B) Delay
helps to prove the principle of
(C) Modulation mathematical induction ?
(D) Attenuation • (A) A statement is true for some
values of n.
30. The Unshielded Twisted
(B) A statement is true for all
Pair(UTP)cable is the most
positive integers n.
commonly used cable in computer
communication. The most common (C) A statement is false for aU
UTP connector is positive integers.
(A) RJ46 (D) A statement is true for only
even numbers.'
(B) RJ99
(C) RJ45 34. Which of the following options
(D) RJ50 correctly represents the symbohc
form ofthe given statement?
'Tor all X, x < 5 or X > 5"
31. Boolean Expression
(Where: '
[(x X y)+(x'X z)]+(y X z') •P(x) represents x < 5
Which of the following options is • Q(x) represents x > 5)
the correct simplified form ?
(A) Vx[P(x)vQ(x)]
(A) xyz'+ xz'y
(B) 3x[P(x)vQ(x)]
(B) (x'xz)+ y
(C) (x X y)+(x + zO
(C) Vx[P(x)aQ(x)]
(D) (x X z' X y) X (x'+ zO (D) 3x[P(x)aQ(x)]._
CS/2025-A 11 [P.T.O.
Text of page 13
35. Which of the following options 39. What is the primary goal of
correctly represents the symboHc concurrency control in DBMS ?
form of the given proposition ? (A) To ensure that multiple
"Either my program runs and it transactions can execute
contains no bugs, or my program concurrently without violating
contains bugs". database consistency
Let: (B) To speed up database queries
• p = My program runs. by allowing transactions to
• q = My program contains bugs. overlap
(A) (pA-.q)vq (0) To allow only one transaction to
(B) pA(-.qvq) • be executed at a time
(C) (p V q) A q (D) To guarantee that aU
transactions will complete any
(D) -i(pAq)vq
how
36. A collection of conceptual tools for
describing data, data relationships, 40. What is dirty read in the context of
data semantics and consistency
transaction processing ?
constraints, is known as
(A) Atransaction reads data that was
(A) Design model
(B) Developed model modified by another transaction
(C) Data model but not yet committed
(D) ER model (B) A transaction reads data that
is in a buffer but not written to
37. The same entity may belong to disk
more than one lower-level entity (C) A transaction reads data after it
set within a single generahzation is has been committed
known as
(D) A transaction write data that
(A) Constraints other transaction can read
(B) Disjoint immediately
(0) User-defined
(D) Overlapping 41. Which of the following sorting
algorithms is stable, non-
38. The SQL analog of what is more comparison based and works
conventionally known as the best when input is uniformly
catalog is.caUed the
distributed ?
(A) Data manipulation ,(A) Selection sort
(B) Information schema (B) Bucket sort
(C) Data definition language (C) Shell sort
(D) Dynamic SQL '(D) Quick sort •" '
CS/2025-A 13 [P.T.O.
Text of page 15
42. Given the recurrence relation for 44. In the Greedy algorithm for the.
minimum set cover problem, how
the worst-case time complexity is the cost-effectiveness of a set S
" defined during an iteration ?
" T(n)= c, when n = 1
(A) Cost(S)/|Sl
" T(n)= T(n/2)+ c, otherwise 0^-® (B) Cost(S)/1 C|, where 0is the set
of already covered elements
Where c is a constant the
(C) Cost(S)/1 S-C|, where C is the
recurrences solves to : set of already covered elements
T(n)= c[l + log^n] (D) iS-CI/Cost(S)
What is the worst-case time
45. Which of the following,
complexity of this algorithm ? represents the general form of a
covering integer program, as a
(A) e(n) generalization of set cover ?
(A) Minimize C.x subject to Ax < b,
(B) eGogn)
with all variables integral
(C) e(nlogn) (B) Maximize Ax'subject to C.x < b,
where x is binary
(D) 0(1)
(C) Minimize C.x subject to
- Ax ^ b, where x is integral and
non-negative
43. In the decision version of the
T
(D) Minimize x subject to A x < C
minimum vertex cover problem in ' with X > 0
a bipartite graph, if the answer is
"No", what serves as a valid No 46. Coaxial cable is important guided
transmission media. It has higher
certificate ?
bandwidth as compared to that
of twisted pair cable to connect
(A) A matching of size K + 1 coaxial cable to device, we need
coaxial cable connector called
(B) A vertex cover of size K — 1
(A) BNC connector
(C) An edge not included in the
(B) RJ 50 connector
cover
(C) RJ 45 connector
(D) A subgraph with no matchings (D) MT-RJ 45 connector
CS/2025-A . 15 [,P.T.O.
Text of page 17
47. is a service that assures 52. Which of the following is a,
not only that packets arrive in characteristic of the NTFS file
proper sequence, but also that all system used in Windows Operating
packets arrive correctly. Systems ?
(A) Datagram (A) It uses a File Allocation Table
(B) Virtual circuit (FAT)to track file locations
(C) Circuit switching (B) It supports file compression and
(D) Error control encryption natively
(C) It does not support file
48. What happens if a router can't find permissions or Access Control
a route for a packet ? Lists(ACL)
(A) Router sends it to a default (D) It is limited to maximum
gateway partition size of 32 GB
(B) Router drops it and sends
unreachable message
53. Whenever the operating system
(C) Router broadcast it to all gains control of the computer, it
networks is in which mode •?
(D) Router saves it for later (A) CPU mode-
(B) Pointer mode
49. What is the key feature of message
switching ? (C) Kernel mode
(A) Real Time Transmission (D) Process mode
(B) Store and forward
(0) Dedicated circuits 54. Which directory implementation
(D) No addressing needed reduces search time for large
directories by organising entries in
Which protocol is used to discover a sorted structure ?
50.
an IP address from a known MAC' (A) Linear list
address ? . (B) Hash table
(A) ARP (C) B-tree
(B) RARP (D) Linked hst
(C) GARP
(D) DNS 55. A direct-access file system uses
blocks of size 4 KB. Each logical
51. .Which RAID level uses block-level
record is 512 bytes. What is the
striping with distributed parity
block number for the logical record
across multiple disks but requires
numbered 235 ?
atleast three disks ?
(A) RAIDO (A) 29
(B) RAIDl (B)- 30
(C) RAID 5 (C) 31 ^ "
(D) RAID 10 (D) 32
CS/2025-A 17 [P.T.O.
Text of page 19
56. Which of the following options is the 59. Which of the following correctly
correct form of the impHcation law ? defines a linear K -order recurrence
relation with constant coefficients ?
(A).p-^q = --p vq
(A) a = a ,+ n
^' n n—1
(B) p-^q = pvq
(B) a = 0(a a a ,, n)
(C) p->q = -.pAq ^ n ^ n-1' n-2' n-k
(C) a -C-a - + C„a „ + ...+
(D) p->q =-.(pvq) ^' n 1 n-l 2 n —2
C, a , + f(n)
k n —k
57. Let R be a relation defined on a set A (D) an = an-l
,+ an-2
„
^
Which of the following statements is
true ? 60. In BFS, what is the initial distance
(d[v]) assigned to all vertices
(A) The reflexive closure of R is :
except the source ?
(A) 0
(B) The symmetric closure of R is : (B) 1
Ru where = {(a, a)I a g A} (C) -1
(C) The reflexive closure of R is : (D) infinity
R u A., and the symmetric
—1 61. The protocol used for the exchange
closure is:R u R
of information between the host
(D) For any property P, the closure and the chent is called
of a relation always exists (A) HTML
(B) HTTP
58. Which of the following,options is (C) SMTP
correct about logarithmic (D) URL
functions ?
62. DNS is designed as a chent-server
(A) log264 = 30 because 2^® = 64 application. A host, that needs to
(B) - 1- because 10^ = 1 map an address to a name or a
name to an address; calls a DNS
(C) log^pO.OOl =-3 because
chent known as ^
10"^ = 0.001 (A) Resolver
(D) the logarithm of 0 is defined, (B) Query ■
but the logarithm of a negative (C) Pointer ■
nxunber is not defined (D) Root server
CS/2025-A 19 -[P.T.O.
Text of page 21
63. Which one of the following is used 66. What does the Write-Ahead
to provide message authentication, Logging(WAL)protocol ensure in
message integrity and terms of database recovery ?
(A) A transactions changes are
non-repudiation of message ?
written to the log before the
(A) RSA
changes are appHed to the
(B) DES database
(C) Kerberos (B) The database is always in a
(D) Digital signature consistent state after a system
crash
(C) Changes are applied to
64. What is the primary purpose of the database and log
tunneling in internetworking ? simultaneously
(A) To encrypt data between two (D) All transaction logs are
different networks deleted once the transaction is
committed
(B) To connect two simdar
networks through a dissimilar
67. If a^ py holds, then a p holds
intermediate network and a —> y holds. Rule is known as
(C) To increase the bandwidth of a (A) Union Rule
WAN connection (B) Decomposition Rule
(0) Transitivity Rule
(D) To prevent unauthorized access
(D) Reflexivity Rule
to the Ethernet frames
68. Relationalalgebra and the relational
65. What is the key difference between calculus are fundamentally
passive and active attacks ? (A) Linear to each other
Passive attacks modify data, while- (B) Restricted to each other
active attacks only monitor it (0) Opposite to each other
(D) Equivalent to each other
(B) Passive attacks only monitor
traffic, while active attacks can
69. A database that is perceived by its
alter or disrupt it users as a collection of relations or
(C) Passive attacks require tables
encryption, while active (A) Hierarchical database
attacks do not (B) Relational database
(D) Active attacks are easier to (0) Network.database
prevent than passive attacks (D) Distributed database
CS/2025-A 21 [P.T.O.
Text of page 23
70. A relation is in if 74. Techniques which model the
and only if the non key attribute system using mathematical
are mutually independent and constructs such as sets and
irreducibly dependent on the functions are known as
primary key.
(A) Method-based techniques
(A) INF
(B) Model-based techniques
(B) 3NF
(C) Design-based techniques
(C) 2NF
(D) Engineering-based techniques
(D) BCNF
75. A model which is suited to
71. The machine requirements issues applications where data is
selectedareperformance,accessibility, generated by one sub-system and
availability and
used by another
(A) performance maintainability
(B) software maintainability (A) Control models
(C) adaptive maintainability (B) Machine-model
(D) corresponding maintainability
(C) Ghent-server model
72. The set of problems that amount (D) Repository model
to the descriptions of a sizeable
variety of programming languages,
as well as the implementation 76. Suppose a graph G has n vertices and
of individually prescribed e edges using the BFS algorithm :
requirements to interpreters and Which of the following statements
compilers for these programming is correct regarding the time
languages is known as complexity of BFS with different
(A) Information repository frame graph representations ?
(B) Client/server frame (A) BFS runs in O(e^) time using
(C) Workpiece frame an adjacency hst and 0(n )time
(D) Translator frame using an adjacency matrix
(B) BFS runs in 0(e)time using an
73. State transition diagrams show adjacency list and 0(n )time
how the system reacts to internal
and external events. using an adjacency matrix
(A) An architectural model (0) BFS runs in 0(n)time regardless
(B) A composition model of the graph representation
(C) A stimulus-response model (D) BFS runs in 0(n,e) time using
(D) A data-processing model both adjacency hst and matrix
CS/2025-A 23 [P.T.O.
Text of page 25
77. The function low [u] in DFS 80. What is the main purpose of using
traversal is used to Stirling's formula in probability
(A) Store the lowest sequence theory ?
number reachable from u or its (A) To compute exact values of
descendants factorials
(B) Store the highest sequence (B) To estimate the approximate size
number of a vertex reachable of n factorials when n is large
from u
(0) To simplify integrals
(C) Keep track of the number of (D) To find the mean ofa probability
times u has been visited
distribution
(D) Count the number of connected
components in the graph In which applications generator-
based reuse approach is usually
78. If two events A and B are mutually most effective ?
exclusive, what is the value of
(A) General-purpose appHcations
P(AnB)?
(B) Domain-agnostic applications
(A) 1
(C) Domain-specific applications
(B) if (D) All of the above
(C) P(A)+ P(B)
Reuse-based software engineering
(D) P(A)-P(B)
is a strategy where the
development process is geared to
79. Which of the following statements
(A) Reusing obsolete software
about the expected value E of
(B) Reusing extinct software
random variables is always true ?
(C) Reusing wasted software
(A) E(X + Y)= E(X).E(Y) (D) Reusing existing software
(B) E(tX)= t E (X), where t is a
number 83. The objective of structural testing
is to ensure that each independent
(C) E(X + Y)= E(5Q + E(Y)onlyif
program path is executed
X and Y are independent
(A) at least twice
(D) E(Xi+X2+...+X„)= (B) at least half
(C) at least once
^2:r=iE(Xi) (D) at most twice
CS/2025-A 25 [P.T.O.
Text of page 27
84. A classic system testing problem is 88. In C++, by declaring function as
(A) software-pointing friend function
(B) test-pointing
(A) The function can use the private
(C) data-pointing
and protected members of the
(D) finger-pointing
class
85. A black-box testing method that (B) The function is in the scope of
divides the input domain of a the class
program into classes of data from
(C) The function must be invoked in
which test cases can be derived is
an object
known as
(A) Class Partitioning (D) None of the above
(B) Equivalence Partitioning
(C) Data Partitioning
(D) Text Partitioning 89. The most important concepts in
Object-Oriented Programming are
86. In OOP, which of the following (A) Superclass and Subclass
concepts provides the idea of
(B) UML
reusability ?
(A) Data abstraction (C) Object and Class
(B) Polymorphism (D) Argument and Method
(0) Inheritance
(D) Dynamic binding 99^ The order of Phases of Software
Life Cycle is
87. In C++, using const kejrword we
(A) Testing, design, operation,
can declare
coding, analysis
(A) '1 promise not to change this
value" (B) Design, analysis, operation,
testing, coding
(B) *1 promise to change this
value" (C) Operation, analysis, design,
(C) *T. promise to double this value" testing, coding
(D) '1 promise to exchange this value (D) Analysis, design,coding,testing,
with other value" operation
CS/2025-A • 27 [P.T.O.
Text of page 29
91. Consider the following Finite 94. Which of the following problem is
Automata.
not NP complete but undecidable ?
(A) Partition
(B) Halting problem
(C) Hamiltonian circuit
Which of the following is not a • (D) None of the above
Regular Expression for it ?
(A) (a + b)*a 95. Which of the following is equal
Regular Expression for the given
(B) b* a (a + bb*a)* Finite Automata ?
(C) b*ab* (ab*ab*)*
(D) (b + aa* b)*aa*
92. Consider the following grammar.
S->S#cS|SS|S8l<S>Ia|b|c
'The cardinality of Follow(8) is
(A) 6
(A) (aa + bb)a (ab + ba)
(B) 8
. (B) (aa + bb)(a + b)*(aa + bb)
(C) 5
(D) 7 (C) a*(a + b)*ab
(D) bb (a + b)* aa
93. Assume that the SLR Parser for a
grammar G has nl states and the 96. What is the purpose of RISC
LALR Parser for G has n2 states. (Reduced Instruction Set
Computer)?
(A) nl is necessarily less than n2 (A) To Fetch the instruction from
memory
(B) nl is necessarily equal to n2 (B) To establish regularity of
execution and ease of decoding
(C) nl is necessarily greater than n2
(G) .To store the results in memory
(D) None of the above (D) To execute the instructions
CS/2025-A 29 [P.T.O.
Text of page 31
97. A floating point number is said to 101. The ISO 9000 quality assurance
be normalized, if the left most digit models treat an enterprise as a
of the mantissa is (A) Software of inter connected
process
(A) Zero
(B) Server of inter connected
(B) Fraction process
(C) Exponent (C) Client of inter connected
(D) Nonzero process
(D) Network of inter connected
process
98. Which of the following is the 2's
complement representation of the 102. The SQA plan provides a road map
decimal value 15 ? for instituting
(A) 10111 (A) Server quality assurance
(B) 10001 (B) System quality assurance
(C) 11111 (C) Software quality assurance
(D) 1111 (D) Standard quality assurance
99. What is the primary function of 103. A description of the problem and
data interlocks in a pipelined the essence of its solution so that
processor ? the solution may be reused in
(A) To detect and resolve different settings is known as
dependencies between (A) Software
instructions to ensure correct (B) Component
execution (C) Pattern
(B) To increase clock speed by (D) Image
reducing pipeline stages
(C) To eliminate the need for 104. System requirement are more
register detailed descriptions of the
(D) To disable the pipeline during (A) Text requirements
cache-misses (B) Data.requirements
(C) User requirements
100. Under the direction of a program,
(D) Model requirements
which four basic operations are
managed by the control unit ?
(A) Fetch, Decode, Execute, 105. One overriding objective to find
Write-Back and correct the cause of a software
(B) Initialize, Process, Decode, error, is known as
Execute (A) testing
(C) Fetch, Decode, Process, (B) debugging
Write-Back
(D) Process, Decode, Fetch, (C) maintenance •
Execute (D) design
CS/2025-A 31 [P.T.O.
Text of page 33
106. 1. Repeat for K = 1 to N : 108. What are the time complexities for
.SetA[K]:= K a priority queue implemented with
a heap ?
2. Repeat for K = 2 to Vn : (A) Insert: 0(log n). Remove :
. Call CROSSCUT (A, N, K). OGogn)
(B) Insert; 0(n), Remove : 0(1)
3. Repeat for K = 2 to N :
• If A[K] ^ 1, then ; Write (C) Insert: 0(1), Remove : 0(log n)
A[K]. (D) Insert: 0(log n), Remove:0(1)
4. Exit.
109. A binary tree is called a height
This algorithm : balanced binary tree(OR AVL
tree), if
(A) To sort a list of numbers in
ascending order (A) It is a binary tree where the
left and right subtrees are both
(B) To find and write aU prime binary search trees
numbers less than N
(B) It is a binary search tree in which
(C) To compute the factorial of a the balance factor of every node
number • is 0
(C) Itis a binary search tree in which
(D) To generate Fibonacci numbers
for every node,the heights ofthe
up to N left and right subtrees differ by
at most 1
107. How is element access different in (D) It is a binary search tree in
arrays and linked lists ? which every node has exactly
two children
(A) Arrays required traversal
while linked lists allow direct 110, If n is the total number of nodes
access in a complete binary tree, what is
the correct formula to calculate its
(B) Both require traversal height h ?
(A) h = [log2(n)]
(C) Arrays allow direct access while
linked lists reqxure traversal
(B) h =[log2(n + 1)]
(C) h = [log2(n)] + 1
(D) Both allows direct access (D) h=[log2(n-l)]+ l
CS/2025-A 33 [P.T.O.
Text of page 35
111. In AI systems that interact with 113. Which of the following statement
people (e.g. expert systems), why is best summarizes the impact of
behaving like a human important ? Noam Chomsky's review of
B. F. Skinner's book Verbal
Behaviour on the development of
(A) To deceive the user into thinking
natural language processing ?
the system is a person
(A) It supported Skinner's
behaviorist theory, laying the
(B) To ensxire the system can ground work for modern NLP
perform physical tasks :(B) It introduced computational
linguistics as a purely
(C) To make the systems reasoning philosophical discipline
processes transparent and (C) It challenged the behaviorist
approach by highlighting the
understandable
creative nature of language,
influencing formal and
(D) To allow the system to pass the
programmable models of
turing test automatically language understanding
(D) It emphasized that sentence
structure alone is sufficient for
112. According to the rational agent , full language comprehension
approach, what is the relationship
114. What is a key feature of Hopfield
between inference and rationality ? • . networks ?
(A) They use unidirectional links
and multiple hidden layers
(A) Inference is irrelevant to ' .
(B) They function as associative
rationality memory with bidirectional
symmetric weights
(C) They include stochastic units
(B) Rationality is entirely dependent
and random outputs
on correct inference (D) They are incapable of learning
patterns
(C) Correctinference is the only way
115. Who introduced-Fuzzy set theory
to act rationally . and in which year ?
(A) William Kahan, 1978
(D) Making correct inference is (B) Peter Cheeseman, 1985
sometimes part of being a (C) Lotfi Zadeh,,1965
rational agent (D) Dubois and Prade, 1994
CS/2025-A 35 [P.T.O.
Text of page 37
116. Every number system has a "base", 121. The number of tokens in the
base is also called as following C code segment is
(A) Power switch (inputvalue)
(B) Exponent
(C) Radix {
(D) Operand case 1: b = c * d ; break;
default: b = b++ ; break ;
117. Some operations require the control }
unit to store data temporarily. (A) 27
are some temporary
(B) 29
storage location in the CPU that
are designed for this purpose. (C) 26
(A) RAMs (D) 24
(B) ROMs
(C) Registers . 122. Consider the expression.
(D) Hard Drives
(a — b)+ e * (c + d). Let X be the
minimum number of registers
118. What happens when a DMA required by an optimal code
transfer is completed ? generation algorithm for a load/
(A) CPU halts permanently
store architecture, in which
(B) The disk stops spinning
(C) The busis permanently assigned i. Only load and store instruction
to the I/O device can have memory operands and
(D) The controller causes an
u. Arithmetic instruction can
interrupt to notify the CPU
have only register or immediate
operands. The value ofX
119. What happens if the CPU and an
is.
I/O controller want to use the bus
at the same time ? Who decides (A) 4
who goes next ?
(A) DMA (B) 3
(B) Interrupt handler (C) 2
(C) Bus arbiter
(D) CPU (D) 12
120. The cycle is responsible 123. There exist a recursive enumerable
for recognising which operation language whose is not
the instruction represents and recursively enumerable.
activating the correct circuitry to
perform that operation. (A) Union
(A) Decode (B) Intersection
(B) Fetch
(C)" Complementation
(C) Execute
(D) Store (D) Concatenation
CS/2025-A 37 [P.T.O.
Text of page 39
124. Consider the following C program. 126. What is data warehouse ?
b =c * d ; (A) A database that stores only
current transactional data
e = c + 1;
(B) A centralized repository of
if(e<10) integrated data collected from
multiple sources
{
tj = 2 * d ; (C) A temporary cache used for
Quick access to web pages
} (D) A cloud storage system for raw
else data
- { . ■
2; 127. Which database design is
^1 = commonly used in OLAP systems ?
}
(A) ER-based
Which of the following optimization
methods can be used ? (B) Relational model
(A) Constant folding (C) Star/snowflake schema
(D) Hierarchical model
(B) Constant propagation
(C) Dead code elimination 128. Which part of the web is not
indexed by typical search engines ?
(D) None of the above
(A) Surface web
(B) Static web
125. Which of the following statements (C) Deep web
is true for the given Regular (D) H5^erlinked web
Expression ?
(a + b)*b(a + b)^ 129. What is the main advantage of
creating a framework instead of
(A) The set of strings containing ab a complete e-commerce system,
as a substring according to passage ?
(B) The set of strings whose length (A) It allows for faster online
is divisible by 6 purchases
(B) It eliminates the need for coding
(C) The set ofstrings having at most in e-commerce projects
one pair ofconsecutive a's and at
(C) It simplifies extending and
most one pair of consecutive b's customizing e-commerce
(D) The set of strings whose 5*^^ projects
symbol from the end is b (D) It ensures compatibility with all
third-party platforms
CS/2025-A 39 -[P^T.O.
Text of page 41
130. Which of the followirig is not the 133. Which of the following is a major
payment gateways ? drawback of linear probing ?
(A) Secondary clustering
(A) AmazonGo
(B) Primary clustering
(B) SafePal
(C) Requires a second hash
(C) Nochex function
(D) Uses extra memory for links
(D) WorldPay
134. What is the formula for calculating
131. In the context of finding bridges in load factor(a)in Hash table ?
a connected undirected graph using (Where n is number of elements
Depth-First-Search (DFS), an edge and tsize is table size.)
(u, v)is identified as a bridge. (A) a = tsize/n
(B) a = n X tsize
Which of the following conditions (0) a = n/tsize
hold true ? (D) a = n + tsize
(Here pre[]holds pre-order
135. During the shift up processes,
traversal numbering of the node,
which scenario will cause the
low[]holds the lowest pre-order of maximum number of element
any vertex connected to node.) interchanges for a newly inserted
node ?
(A) low [v] < pre [u] (A) The node is inserted at the root
(B) low [v] > pre [u]_
(B) The node is inserted in middle
of heap ,
(C) low [v] < low [u] (C) The node is the smallest in the
heap
(D) pre [v] = = pre [u] (D) The node is the largest among
aH inserted so far
132. Which method of Hashing involves
136. Who used genetic algorithms to
dividing the key into parts and address the problem of finding a
adding them ? good structure for a multilayer
neural network ?
(A) Division method (A) Lecun et al.(1989)
(B) Mid-square method (B) Harp et al. (1990) and Miller
et al.(1989) '
(C) Folding method (C) Mezard and Nadal(1989)
(D) Multiplication method (D) Frean(1990)
CS/2025-A 41 I'P.T.O.
Text of page 43
137. What is the purpose of the function 141. Processors are built with the
(]):(Xx Y)aK-^ Y in the general ability to execute a limited set of
basic operations. The collection of
form of the K-NN rule ? these operations is known as
(A) To define the similarity (A) Instruction format
function (B) Operand -
(C) Instruction cycle
(B) To compute the final prediction
' (D) Instruction set
based on the K nearest
neighbors
142. Optimization of each instruction
(C) To measure the variance in the in the processor is done through a
data technique known as
(A) RISC
(D) To reorder the training set
(B) CISC
(C) Pipelining
138. Which of the following is not a (D) Execute cycle
most commonly used method for
defining distance between clusters
143.' In an instruction cycle, which
in linkage based clustering ?
cycle is responsible for reading the
(A) Single linkage instruction from the memory ?
(B) Average linkage (A) Fetch cycle
(C) Max linkage (B) Decode cycle
' (C) Execute cycle
(D) Centroid Linkage
(D) Store cycle
139. What is the primary role of a policy 144. Many operating systems are
in a reinforcement learning system ? designed to enable the CPU to
(A) To define the long term goals of process a number of independent
the agent programs concurrently. This
(B) To predict futxure rewards concept is called as
based on the current state (A) Multicomputing -
(C) To map from perceived states (B) Multiprogramming
of the environment to actions
(C) Multifunction system
(D) To model the environments
behaviour . (D) Multioperating system
145. The is a program
140. Which of the following is not
'whose function is to start the
considered a part of data
preprocessing in the knowledge computer- software when power is
discovery process ? turned on.
(A) Data selection (A) Dynamic RAM
(B) Data transformation (B) Static RAM
(C) Pattern evaluation (C) Read Only Memory
(D) Data cleaning (D) Bootstrap Loader
CS/2025-A 43 [P.T.O.
Text of page 45
146. Match List — I with List — n. 148. Find the highest type number,
List-1 List- II
specified by following grammar.
S -> OSBA I 01A
P. LL(1) I. Turing
Machine AB->BA
IB ^11
Q. Halting II. Finite
Problem Automata lA^lO
OA ^00
R. A^ aB 1 a, in. Chomsky
aGT,A,B6V Normal Form (A) Type -3(Regular)
(B) Type -1(Context sensitive)
S. A BCl a, IV. Recursive
(C) Type-2(Context free)
a eT, Descent
(D) None of the above
A,B, CgV Parser
(A) P-IV, Q-I, R-II, s-in 149. Match all items in Group -1 with
(B) P-I, Q-n, R-III, S-IV correct options from those given in
(C) P-III, Q-I, R-II, S-IV Group - 2.
(D) P-II, Q-IV,R-III, S-I Group -1 Group - 2
P. Intermediate 1. Activation
147. Which of the following statements representation records
are true about parsing in Compiler
Q. Top-down 2. Code
design ? generation
parsing
i. A parser converts tokens
R. Runtime 3. Left most
generated by the lexical
analyser into a parse tree. environments derivation
ii. A top-down parser can handle S. Register 4. Graph
left-recursive grammars without
any modifications. allocation coloring
iii. A shift-reduce parser can make (A) P-2,Q-3,R-4,S-1
decisions based on the current (B) P-l,Q-2,R-3,S-4
input symbol and the top of the (C) P-4.Q-2,R-3,S-1
stack.
(D) P-2,Q-3,R-l,S-4
iv. LL(1) parsing is a type of
bottom-up parsing technique.
150. The pumping lemma is often used
Choose the correct answer from the
option given below. to prove that a language is
(A) Context free
(A) Only i, ii
(B) Only i, iii (B) Not context free
(C) Only ii, iv (C) Regular
(D) Only i, iii, iv (D) None of the above
CS/2025-A 45 [P:T.O.
Text of page 46
ROUGH WORK CS/2025-A 46
Text of page 47
/ROUGH WORK CS/2025-A 47 [P.T.O.
Text of page 2
M.P PUBLIC SERVICE COMISSIONINDORE
ASSISTANT PROFESSOR COMPUTER SCIENCE EXAM-2025
FINAL ANSWER KEY
Subject General Studies
SET-D ANS SET-A SET-B SET-C SET-D ANS
SET-A SET-B SET-C
16 36 31 11 A 31 1 11 21 B
17 37 32 12 B 32 2 12 22 D
18 38 33 13 C 33 3 13 23 C
34 14 D 34 4 14 24 ■ C
19 39
20 40 35 15 A 35 5 15 25 B.
26 21 41 46 D 11 41 36 6 B
22 42 47 A 12 42 37 7 A -
27
28 23 43 48 B 13 43 38 8 D
29 24 44 49 B 14 44 39 9 B
30 25 45 50 D 15 45 40 10 A
41 6 16 1 C 21 26 46 31 D
42 7 17 2 C 22 27 47 32 B
8 18 3 B 23 28 48 33 B
43
44 9 19 4 C 24 29 49 34 A
10 20 5 B 25 30 50 35 C
45
46 6 26 C 6 11 21 16 C
1
2 47 7 27 C 7 12 22 17 B
48 8 28 C 8 13 23 18 A
49 9 29 C 9 14 24 19 A
4
50 10 30 C 10 15 25 20 B
5
16 26 36 B 36 31 1 41 C
46
17 27 37 C 37 32 2 42 B
47
18 28 38 C 38 33 43 C
48
19 29 39 C 39 34 4 44 D
49
20 30 40 B 40 35 5 45 C
50
'^■2-2-02.^
Exam Controller
Text of page 3
M.P.PUBLIC SERVICE COMISSIONINDORE
ASSISTANT PROFESSORCCOMPUTER SCIENCE)EXAM- 2025
FINAL ANSWER KEY
SET-A SET-B SET-C SET-D ANS SET-A SET-B SET-C SET-D ANS SET-A SET-B SET-C SET-D ANS
31 81 71 86 B 131 101 1 76 B 11 91 146 111 c
32 82 72 87 B 132 102 2 77 C 12 92 147 112 D
33 83 73 88 B 133 103 3 78 B 13 93 148 113 A
34 84 74 89 A- 134 104 4 79 C 14 94 149 114 B
35 85 75 90 A. 135 ■ 105 5 80 C,D 15 95 150 115 D
56 41 141 51 A 41 146 96 36 B 26 51 56 61 B
57 42 142 52 C 42 147 97 37 B 27 52 57 62 B
58 43 143 53 C 43 148 98 38 A - 28 53 58 63 B
144 54 44 149 99 39 C 29 54 59 64 D
59 44 C
60 45 145 55 C,D 45 150 100 40 C 30 55 60 65 C
76 126 91 31 B 16 116 81 141 A 46 1 21 41 A
77 127 92 32 A 17 117 82 142 B 47 2 22 42 B
78 128 93 33 B 18 118 83 143 C 48 3 23 43 B
79 129 94 34 B 19 119 84 144 B 49 4 24 44 B
80 130 95 35 B 20 120 85 145 C 50 5 25 45 B
96 61 51 131 B 1 86 61 121 C,D 61 121 41 16 B
97 62 52 132 D 2 87 62 122 A 62 122 42 17 A
98 63 53 133 B 3 88 63 123 A 63 123 43 18 D
99 64 54 134 A - 4 89 64 124 C 64 124 44 19 B
100 65 55 135 A 5 90 65 125 Delete 65 125 45 20 B
116 11 36 71 C 51 31 26 96 C 81 141 86 1 C
117 12 37 72 C 52 32 27 97 B. 82 142 87 2 D
118 13 38 73 D. 53 33 28 98 C 83 143 88 3 C
119 14 39 74 C 54 34 29 99 C 84 144 89 4 D
120 15 40 75 A- 55 35 30 100 AB 85 145 90 5 B
141 111 106 6 D - 91 16 136 66 C 71 106 131 21 C
142 112 107 7 C 92 17 137 67 B,D 72 107 132 22 D
143 113 108 8 A 93 18 138 68 B 73 108 133 23 C
144 114 109 9 B 94 19 139 69 B 74 109 134 24 B
145 115 110 10 D 95 20 140 70 B 75 110 135 25 D
6 71 126 101 B 146 131 111 46 A ■ 101 76 31 106 D
7 72 127 102 D- 147 132 112 47 B < 102 77 32 107 C
8 73 128 103 A . 148 133 113 48 B' 103 78 33 108 C
9 74 129 104 C 149 134 114 49 D 104 79 34 109 C
10 75 130 105 B 150 135 115 50 B' 105 80 35 110 B
86 46 76 56 C 121 56 66 26 C 111 36 6 81 C
87 47 77 57 A • 122 57 67 27 C 112 37 7 82 D
88 48 78 58 A 123 58 68 28 C 113 38 8 83 C
89 49 79 59 C 124 59 69 29 c 114 39 9 84 B
90 50 80 60 D 125 60 70 30 D 115 40 10 85 C
21 26 46 126 C 66 21 101 11 A 136 66 116 91 B
22 27 47 127 B 67 22 102 12 B 137 67 117 92 B
23 28 48 128 A 68 23 103 13 D 138 68 118 93 D
24 29 49 129 B 69 24 104 14 B 139 69 119 94 C
25 30 50 130 C 70 25 105 15 B 140 70 120 95 C
106 136 11 116 B 36 6 121 146 C 126 96 16 136 B
107 137 12 117 C 37 7 122 147 D 127 97 17 137 C
108 138 13 118 A 38 8 123 148 B 128 98 18 138 C
109 139 14 119 C 39 9 124 149 A 129 99 19 139 C
110 140 15 120 Delete 40 10 125 150 A 130 100 20 140 A
Exam ControllerPage 1 of 48
Source: Madhya Pradesh Public Service Commission. Question paper published by Madhya Pradesh Public Service Commission.