aglasem.com
Home Schools Admission Career Mock Test PDF Docs Playground
ClassChoose class
StateSelect state

MAHA SET 2025 Paper II Computer Science and Applications Set A Question Paper

Download the MAHA SET 2025 Paper II Computer Science and Applications Set A Question Paper PDF from AglaSem. This is the official Set A question paper of the Maharashtra State Eligibility Test (MAHA SET / MH-SET) Paper II (Computer Science and Applications), held on 15 June 2025 and conducted by Savitribai Phule Pune University. Solve it to understand the exam pattern, question types and difficulty level.
MAHA SET 2025 Paper II Computer Science and Applications Set A Question Paper - Page 1 of 28

About MAHA SET 2025 Paper II Computer Science and Applications Set A Question Paper

MAHA SET 2025 Paper II Computer Science and Applications Set A Question Paper is available here for free download. Published by Maharashtra Exams for MAHA SET, this question paper can be viewed online or downloaded as a PDF (28 pages). Candidates preparing for MAHA SET can use MAHA SET 2025 Paper II Computer Science and Applications Set A Question Paper to understand the exam pattern, the type of questions asked, and the overall difficulty level.

Frequently Asked Questions

How can I download MAHA SET 2025 Paper II Computer Science and Applications Set A Question Paper?

Open this page and click the Download button to save MAHA SET 2025 Paper II Computer Science and Applications Set A Question Paper as a PDF. It is completely free on AglaSem Docs.

Is MAHA SET 2025 Paper II Computer Science and Applications Set A Question Paper free to download?

Yes. MAHA SET 2025 Paper II Computer Science and Applications Set A Question Paper can be viewed online and downloaded as a PDF free of cost on AglaSem Docs.

How many pages does MAHA SET 2025 Paper II Computer Science and Applications Set A Question Paper have?

MAHA SET 2025 Paper II Computer Science and Applications Set A Question Paper contains 28 pages, which you can read online or download together as a single PDF.

Where can I find more MAHA SET study material?

You can find more MAHA SET question papers, sample papers, syllabus, and answer keys on AglaSem Docs.

MAHA SET 2025 Paper II Computer Science and Applications Set A Question Paper – Text

Read the full text of this question paper below — useful to quickly search, copy and reference the content online without downloading the PDF.

📄 View text version (29 pages)

Page 1

FOR MAHA SET PREPARATION

MAHA SET 2025 Paper
II Computer Science
and Applications Set A
Question Paper
EXAM YEAR TYPE

MAHA SET 2025 Question Paper

Notes · Sample Papers · Previous Year Papers · Mock Tests

Page 2

.
m .co s e m

l a
ag
Test Booklet Code & Serial No.
A
Paper-II
COMPUTER SCIENCE AND APPLICATIONS
Signature and Name of Invigilator Seat No.

m
1. (Signature) .........................................
. co
c. o
(In figures as in Admit Card)

e m
(Name) ................................................

em
Seat No. ..............................................................
l as
s
2. (Signature) .........................................
la
(In words)

ag
g
(Name) ................................................
JUNa- 37225
OMR Sheet No.
(To be filled by the Candidate)
Time Allowed : 2 Hours] [Maximum Marks : 200
Number of Pages in this Booklet : 28 Number of Questions in this Booklet : 100
Instructions for the Candidates
1. Write your Seat No. and OMR Sheet No. in the space provided 1.
on the top of this page.
2. This paper consists of 100 objective type questions. Each question
will carry two marks. All questions of Paper II will be compulsory. 2.
3. At the commencement of examination, the question booklet
will be given to the student. In the first 5 minutes, you are
requested to open the booklet and compulsorily examine it as 3.

m
follows :

c. o
(i) To have access to the Question Booklet, tear off the (i)
paper seal on the edge of this cover page. Do not accept
a booklet without sticker-seal or open booklet.
(ii)

m
(ii) Tally the number of pages and number of questions in

e
the booklet with the information printed on the cover

s
page. Faulty booklets due to missing pages/questions

a
or questions repeated or not in serial order or any

l
other discrepancy should not be accepted and correct

ag
booklet should be obtained from the invigilator within
the period of 5 minutes. Afterwards, neither the Question
Booklet will be replaced nor any extra time will be (iii)
given. The same may please be noted.
(iii) After this verification is over, the OMR Sheet Number
should be entered on this Test Booklet. 4. (A), (B), (C) (D)
4. Each question has four alternative responses marked (A), (B),
(C) and (D). You have to darken the circle as indicated below on
the correct response against each item.
Example : where (B) is the correct response. (B)

A C D A C D
Following wrong methods should not be used as they are not (Digitized)
recognised by scanning machine in digitized assessment.
Candidate using such method will be responsible for their loss.

CORRECT METHOD WRONG METHODS
CORRECT METHOD WRONG METHODS
C D A B C D A B C D A B C D A B C D
m
c. o
C D A B C D A B C D A B C D A B C D

m
5. Your responses to the items are to be indicated in the OMR

.co
5.

m
Sheet given inside the Booklet only. If you mark at any place

e
other than in the circle in the OMR Sheet, it will not be evaluated.

s
6. Read instructions given inside carefully. 6.

e m 7.
8.
Rough Work is to be done at the end of this booklet.
If you write your Name, Seat Number, Phone Number or put
7.

la
s g
any mark on any part of the OMR Sheet, except for the space 8.

la a
allotted for the relevant entries, which may disclose your
identity, or use abusive language or employ any other unfair
means, you will render yourself liable to disqualification.
9. You have to return original OMR Sheet to the invigilator at the
end of the examination compulsorily and must not carry it with 9.
you outside the Examination Hall. You are, however, allowed
to carry the Test Booklet and duplicate copy of OMR Sheet on
conclusion of examination. 10.
10. Use only Blue/Black Ball point pen.
11. Use of any calculator or log table, etc., is prohibited. 11.
12. There is no negative marking for incorrect answers. 12.

m
.co s e
s em
For more Question Papers, Sample Papers, Notes & Syllabus visit
gl a
Page 1 of 28

Page 3

2

For more Question Papers, Sample Papers, Notes & Syllabus visit Page 2 of 28

Page 4

.
m .co s e m

l a
ag

Computer Science and Applications
om Paper II . co
. c e m
e m l as
l as
Time Allowed : 120 Minutes] a g
[Maximum Marks : 200
g
Note a: This paper contains Hundred (100) multiple choice questions. Each question
carrying Two (2) marks. Attempt All questions.

1. Let ,  be the formula,  , if and 3. Five people stand at the vertices of
a pentagon, throwing frisbees to
only if   is a :
each other. They have two frisbees,
initially at adjacent vertices as
(A) Tautology
shown in the figure. In each time
m
.co
(B) Contradiction interval, each frisbee is thrown
either to the left or to the right (along
e m an edge of the pentagon) with equal
(C) Contingency
l a s probability. This process continues

ag
(D) Either tautology or contradiction until one person is the target of two
frisbees simultaneously, then game
or contingency ends.
(Note : All throws are independent
2. Which of the following relations of past history)
defined on X  {1, 2, 3} is an
equivalent relation ?

(A) {(1, 2), (2, 2), (3, 3)}
m
m .co
.co
(B) {(1, 1), (2, 2), (2, 2), (2, 1), (3, 3),
e m
e m (1, 1)}
las
Find the mean and variance of the

las (C) {(1, 1), (1, 2), (1, 3), (2, 2), (2, 1),
(A) 12 and 100 ag
number of pairs of throws.

(3, 3), (3, 1)} (B) 6 and 50
(C) 24 and 200
(D) All of the above
(D) 18 and 80
3

m
.co s e
s em
For more Question Papers, Sample Papers, Notes & Syllabus visit
gl a
Page 3 of 28

Page 5

4. A rod is divided into six segment is 6. The thickness of a graph G is defined
to be colored with one or more of
as minimum number of (edge-
4 different colors. In how many ways
can this be done ? disjoint) planar subgraphs into

(A) 160 which G can be decomposed. The
(B) 146 thickness of G is defined as (G).
(C) 150
What is the thickness of planar
(D) 133
graph ?
5. A committee is to be selected from
5 candidates a, b, c, d and e. The (A) 1
selection must satisfy all the
(B) 2
following conditions :
• Either a or b must be included, (C) 3
but not both
(D) 4
• Either c or e or both must be
included 7. Let us consider the letters from a
• If d is included then b must be
through h, and all 5 letters are made
included
using these letters. (words are just
• Either a or c are included or
neither is included. strings of letters). How many of these

• If e is included, then c and d words contain no repeated letters ?
must be included. How should
selection be made ? (A) 6720

(A) a  b  c  d  e (B) 6072
(B) a  b  c  d  e
(C) 7260
(C) a  b  c  d  e
(D) a  b  c  d  e (D) 7630

4

For more Question Papers, Sample Papers, Notes & Syllabus visit Page 4 of 28

Page 6

.
m .co s e m

l a
ag

8. What is the smallest number of 10. Consider the following linear
colors that can be used to color the

om
vertices of a cube so that no 2 programming problem :
. co
. c
adjacent vertices are colored
e m
e m
identically ? Maximize z = 5x1 + 2x2 + 3x3 –
l as
as g
gRl x + ax
a B 4 5

B R Subject to : x1 + 2x2 + 2x3 + x4 = 8

R B 3x1 + 4x2 + x3 + x5 = 7

B R
x1, x2, x3, x4, x5  0
(A) 2 colors m
c. oWhat will be the basic feasible
(B) 1 color
e m
(C) 3 colors
l as solution after iteration 1 ?
(D) 4 colors
ag (A) x1 = 0, x2 = 0, x3 = 4, x4 = 0,
9. Let us consider the following primal
problem : x5 = 3, z = 15
Maximize z = 2x1 + x2
(B) x1 = 1, x2 = 2, x3 = 1, x4 = 0,
Subject to x1 – x2  4,
x1 – x2  2, x5 = 0, z = 12

o m
x1, x2  0
m What will be its dual problem ? c
(C) x = 0, x = 5, x .= 0, x = 1,
.co m
1 2 3 4

m x = 0, z =a10 s e
s e (A) Dual feasible 5
gl
la (B) Dual infeasible a
(D) There is no feasible solution for
(C) Dual feasible and unbounded
(D) Dual unbounded this problem

5

m
.co s e
s em
For more Question Papers, Sample Papers, Notes & Syllabus visit
gl a
Page 5 of 28

Page 7

11. Given Truth Table represents which 12. “100” is a number in Octal

of the following Logic Gate ? Number System. What will be its

representation in Hexadecimal
Input Output Number System ?

A B Q (A) 40

(B) 64
0 0 1
(C) 100

0 1 1 (D) 256

13. What is the interpretation of
1 0 1
“R1  R2” instruction in Register

1 1 0 Transfer Language ?

(A) Load the content of R2 into R1
A
(A) B Q
(B) Add the content of R2 into R1

A (C) Load the content of R2 into R1
(B) B Q
and then delete the contents

of R2
A
(C) B Q
(D) Add the content of R2 into R1

A and then delete the contents
(D) Q
B of R2

6

For more Question Papers, Sample Papers, Notes & Syllabus visit Page 6 of 28

Page 8

.
m .co s e m

l a
ag

14. The “instruction decode” phase in 16. Identify an appropriate operation

co
CPU’s instruction cycle is responsible sequence with respect to execution
to ................. . om .
. c of a machine level language e m
(A) load ethe m instruction into CPU l as
la s instruction.
ag
(B)g translate the instruction into
a (A) Load instruction address–get
machine language code
the instruction–execute the
(C) determine the opcode and
opcode–get effective address of
operands of the instruction
operands
(D) execute the operation specified

m(B) Load instruction address–get
c. o
by the instruction

em
15. What is the objective of Assembly effective address of operands–

l as get the instruction–execute the
ag
Level Language in a computer
system ? opcode

(A) to provide a natural language (C) Load instruction address–get
environment for the programmer
the instruction–get effective
(B) to provide a high-level abstraction
address of operands–execute
of hardware for the programmer
m
.co
the opcode
m
.co
(C) to enable direct execution of

m s em
(D) Load instruction address–get

la of operands–
code by the computer system
s e g
la
effective address
(D) to enable execution of code on a
execute the opcode–get the
different computer system
platforms instruction

7

m
.co s e
s em
For more Question Papers, Sample Papers, Notes & Syllabus visit
gl a
Page 7 of 28

Page 9

17. Which of the following statements 19. Which of the following generally
is true with respect to RISC does not use a Software Interrupt ?
architecture in comparison with
(A) Software Timer
CISC architecture ?
(B) System Timer
(A) Instruction set consists of more
instructions (C) Page Fault

(B) Instructions involve more (D) Task Switching
addressing modes
20. Which type of memory generally
(C) Instructions are generally of
enables to enhance the performance
fixed length
of a CPU ?
(D) Instruction set consists of
(A) Auxiliary Memory
complex instructions

18. Which of the following computer (B) Associative Memory

system is represented when many (C) Cache Memory
processing units are working under
(D) Virtual Memory
the supervision of a common control
unit ? 21. In which programming paradigm

(A) Single Instruction Stream, the desired result is declared as
Single Data Stream (SISD) the value of a series of function

(B) Single Instruction Stream, applications ?

Multiple Data Stream (SIMD) (A) Procedural
(C) Multiple Instruction Stream,
(B) Object oriented
Single Data Stream (MISD)
(C) Logical
(D) Multiple Instruction Stream,
Multiple Data Stream (MIMD) (D) Functional

8

For more Question Papers, Sample Papers, Notes & Syllabus visit Page 8 of 28

Page 10

.
m .co s e m

l a
ag

22. Which of the following scenario 24. int main() {
necessitates file locking to be enabled

m?
by an Integrated Development
o
int x
. co
Environment c
. (IDE)
e m
m
e the privacy of a
x = (1 + 2;
l as
s
(A) To ensure
a code file
lsource return x;
ag
g
a To prevent un-authorized
(B) }
access to a source code file
Which of the following statements
(C) To prevent concurrent access to
is true with respect to this source
a source code file
code in C language ?
(D) To enable proper versioning of
a source code file (A) Syntax Error
m
23. How much memory will be allocated c. o(B) Semantic Error
e m
for the instances of structure S (with
respect to C language) ?
l as (C) Linking Error

typedef struct { ag (D) Runtime Error
char a;
25. Which of the following term
int b; describes the ability of a class to
} S; provide common interface for
(A) size required to store a different types of objects in object-
character
m
.co
oriented programming ?
m
.co
(B) size required to store an integer
(A) Encapsulation
e m
e m (C) size required to store a character
las
las and an integer
g
(B) Polymorphism
a
(D) allocated memory size will (C) Inheritance
depend upon the available
memory (D) Abstraction

9

m
.co s e
s em
For more Question Papers, Sample Papers, Notes & Syllabus visit
gl a
Page 9 of 28

Page 11

26. By default, C++ language 28. JavaScript language can be
provides .................... . used ...................... .

(A) early binding for variables and (A) only for client-side programming

late binding for functions in web applications

(B) late binding for variables and (B) only for server-side programming

early binding for functions in web applications

(C) for client-side as well as server-
(C) early binding for variables and
side programming in web
early binding for functions
applications
(D) late binding for variables and
(D) only to create desktop
late binding for functions
applications
27. Which of the following options
29. Assume that a line is drawn using
appropriately describes the term
DDA line drawing algorithm and the
DHTML ?
points p1, p2, p3, .........., pn are
(A) HTML supported by specific generated in the sequence with
browsers p1(5, 15) as the first point and

(B) Combination of HTML and pn(15, 25) as last point of the line.

stylesheets What is the location of the third
point p3 ?
(C) Combination of HTML and
(A) (6, 11)
client-side scripts
(B) (7, 11)
(D) Combination of HTML,
stylesheets and client-side (C) (6, 12)

scripts (D) (7, 12)

10

For more Question Papers, Sample Papers, Notes & Syllabus visit Page 10 of 28

Page 12

.
m .co s e m

l a
ag

30. The binary region code assigned to 33. A set of one or more attributes
the line end point located at the which, taken collectively, allow us to

om
bottom-right side of the clipping uniquely identify an entity in the . co
. c e m
rectangle in the Cohen-Sutherland
e m entity set is called ................. .
l as
l as
line clipping algorithm is ............. .
(A) Primary key
ag
(A)g 0110
a (B) Foreign key
(B) 1010
(C) Super key
(C) 0101
(D) Candidate key
(D) 1001
34. The future trends and behaviors
31. Among the following, which is
(For business managers to make
foreign key constraint ?
m knowledge-driven decisions)
c. oproactive
(A) Domain integrity
e m can be predicted by :
(B) Entity integrity
l as
(C) Referential integrity a
g (A) Meta data

(B) Data warehouse
(D) Key integrity
(C) Data mining
32. In the .................. normal form, a
(D) Relational data
composite attribute is converted to
individual attributes. Which of the 35. Which NoSQL database is known for
its ability to handle complex queries
following represents a query in the
m
m and data analysis ?
.co
.co
tuple relational calculus ?
e m
e m (A) {P(t)|t} (A) Dbase
las
las (B) {P()|t} (B) HBase g
a
(C) {t|P()} (C) Couchbase

(D) {t|P(t)} (D) MongoDB

11

m
.co s e
s em
For more Question Papers, Sample Papers, Notes & Syllabus visit
gl a
Page 11 of 28

Page 13

36. Let R = (M N O P Q) be a relational 39. An ER model of a database consists
scheme with functional dependency
F = {M  N, N  O, MO  P} of entity types P and Q. These are

Then closures of Q and M are : connected by a relationship R, which
(A) , MNOP does not have its own attributes
(B) , 
(i.e., no self attributes).
(C) Q, MNOP
(D) Q, MNO Under which one of the following
37. The ................... file organization condition, can the relational table for
provides very fast access to any
arbitrary record of a file. R be merged with that of P ?

(A) B-tree (A) Relationship R is one-to-many
(B) Sequential
and the participation of P in R
(C) Ordered
is total
(D) Hashed
38. Select the correct option : (B) Relationship R is one-to-many
(A) The height of a B + -tree is
and the participation of P in R
independent of the number of
records is partial

(B) B-trees are used in primary
(C) Relationship R is many-to-one
indexes and B+-trees are used
in secondary indexes and the participation of P in R
(C) Range queries are faster on is total
B+-tree
(D) B+-trees are used for storing (D) Relationship R is many-to-one
data in main memory and and the participation of P in R
B-trees are used for storing
data on disk is partial

12

For more Question Papers, Sample Papers, Notes & Syllabus visit Page 12 of 28

Page 14

.
m.co s e m

l a
ag

40. A data dictionary system is called 42. A sender ‘S’ sends a message ‘M’ to

co
receiver ‘R’, which is digitally signed

om .
a ................. if it is used only by
.c by ‘S’ with its private key. In this
e m
designers, m
e users, and administrators
l as
as
lnot by the DBMS software.
scenario, one or more of the following
ag
ag
and security violations can take place.

(1) ‘S’ can launch a birthday attack
(A) passive data dictionary
to replace M with a fraudulent
(B) static data dictionary message.

(C) active data dictionary (2) A third party attacker can

m launch a birthday attack to
(D) dynamic data dictionary
m .co
s e replace ‘M’ with a fraudulent

l a message.
ag
41. Network operating system runs

(3) ‘R’ can launch a birthday attack
on ................... .
to replace ‘M’ with a fraudulent
(A) every system in the network message.

(B) server Which of the following are possible

security violations ?
m
m (C) both server and every system in
(A) (1) and (2) only .
co
.co s em
em (B) (1) only la
the network

las ag
(D) Neither server nor every system
(C) (2) only

in the network (D) (2) and (3) only

13

m
.co s e
s em
For more Question Papers, Sample Papers, Notes & Syllabus visit
gl a
Page 13 of 28

Page 15

43. A CPU generates 32-bit virtual 45. Consider a disk that has 150
addresses. The page size in 4KB.
cylinders, numbered from 0 to 149.
The processor has a translation look-
aside Buffer (TLB) which can hold Currently the disk arm is at 80 and
a total of 128 pages table entries and moving towards higher cylinders.
is 4-way set associative. The The disk access requests for cylinders
maximum size of the TLB tag is :
are 30, 78, 96, 123, 141, 15, 13, 68.
(A) 11 bits
What will be the absolute difference
(B) 13 bits
traversed by R/W head when
(C) 15 bits
CSCAN and clock is used ?
(D) 20 bits
(A) 135
44. With regard to linked list, which of
the statement is FALSE ? (B) 42

(A) An algorithm to search for an (C) 38
element in a singly linked list
requires O(n) operations in the (D) 21
worst case
46. Consider a system with ‘M’ CPU
(B) An algorithm for deleting the
processors and ‘N’ processes then how
first element in a singly linked
many processes can be present in
list requires O(n) operations in
the worst case. ready, running and blocked state at

(C) An algorithm for finding the maximum ?
maximum value in a circular
(A) N, M, N
linked list requires O(n)
operations (B) N, M, M
(D) An algorithm for deleting the (C) M, N, M
middle node of a circular linked
list requires O(n) operations (D) N, N+M, M

14

For more Question Papers, Sample Papers, Notes & Syllabus visit Page 14 of 28

Page 16

.
m .co s e m

l a
ag

47. Binary search tree is an example 49. Consider a program, which spawn
20 threads to find out the sum of
of :
om
elements in a shared array of 200.
. co
. c Each thread i, takes elements A[i]
e m
e m
(A) Divide and conquer technique
to A[(20 * i) – 1] and compute local
l as
l as a g
sum loc_sum [i] and eventually adds
ag
(B) Greedy Algorithm
loc_sum[i] to a shared variable
(C) Back tracking tot_sum for total sum which of the
following needs to be placed inside
(D) Dynamic programming a critical section ?

48. Which of the below statements is (A) Reading array values

(B) Add to tot_sum
false ?
m Both (A) and (B)
c. o(D) Neither (A) nor (B)
(C)
(A) Kernel stack can be used to
e m
l a
store the context of a processs 50. The number of child processes are
a g created using the following code :
(B) User stack is used to store the
int main()
function details during function
{ fork(););
calls
fork();
(C) Kernel stack is used to store fork();

m
.co
the user program functional return 0;
m
.co m
}

m
arguments
s e
s e (A) 5
g la
la a
(D) Content of the process is useful
(B) 6
to restart the process after some
(C) 7
time (D) 8

15

m
.co s e
s em
For more Question Papers, Sample Papers, Notes & Syllabus visit
gl a
Page 15 of 28

Page 17

53. .................. testing involves delivering
51. ........................ model takes the
a system to a number of potential
fundamental process activities of
customers who agree to use that
specification, development, validation system.

and evolution and represents them (A) Unit

as separate process phases such as (B) Beta

requirements specification, software (C) Alpha

design, implementation, testing and (D) Validation

so on. 54. The Dynamic System Development
Method was developed in U.K. in the
(A) The waterfall model
year .................. .
(B) Incremental development (A) 1988

(C) Reuse-oriented software (B) 1989

engineering (C) 1990

(D) 1991
(D) Modular Approach
55. Which standard is used to prepare
52. MDD stands for ................... . Software Requirement and
Specification document ?
(A) Model based driver development
(A) ISO
(B) Model-driven development
(B) IEEE
(C) Model-development design
(C) ACM

(D) Modular design development (D) OSI

16

For more Question Papers, Sample Papers, Notes & Syllabus visit Page 16 of 28

Page 18

.
m .co s e m

l a
ag

56. Architectural models that may be
59. Which testing is intended to reveal
developed may include : A .................

om
model that shows how the system is defects in the system rather than to
. co
. c e m
organised into processes at run-time.
e m simulate its operational use ?
l as
as
(A) static structural
ldynamic process ag
ag
(B)
(A) Defect testing

(C) interface model (B) Unit testing

(D) relationship models
(C) Black Box
57. Software quality management for
large systems can be structured into (D) White Box
.................... main activities.
m
(A) Two
m .co
60. .................. procedures are concerned

s e with analysing the costs and benefits
(B) Three
l a
(C) Four ag of proposed changes, approving

(D) Five those changes that are worthwhile

58. The first version of the COCOMO and tracking which components of
model (COCOMO 81) was a ..............
level model where the levels the system have been changed.

corresponded to the detail of the
m
.co
(A) Change management
m analysis of the cost estimate.

m .co (A) one s e
(B) Cost estimation
m
s e g la
la (B) two
a
(C) Software
(C) three
(D) Testing
(D) four

17

m
.co s e
s em
For more Question Papers, Sample Papers, Notes & Syllabus visit
gl a
Page 17 of 28

Page 19

61. Which of the following sorting does 64. Identify the odd one :
not have worst case running time
(A) Priority queue
of O(n2) ?
(B) Circular queue
(A) Merger sort

(B) Quick sort (C) Deque

(C) Insertion sort (D) Tower of Hanoi

(D) Bubble sort 65. Stack has applications in :

62. In breadth first search of a graph,
(A) Function calls
which data structure is used to hold
(B) Evaluation of arithmetic
nodes ?
expressions
(A) Array

(B) Queue (C) Large number arithmetic

(C) Stack (D) All of the above

(D) Graph 66. The post-order and in-order traversal

63. In the ............. traversal, we visit all of a Binary tree generates the same
of a vertex’s descendants before we output. Then the tree is :
move on to an adjacent vertex.
(A) Nearly balanced
(A) Breadth First
(B) Completely balanced
(B) Depth First
(C) Right skewed
(C) Inorder

(D) Preorder (D) Left skewed

18

For more Question Papers, Sample Papers, Notes & Syllabus visit Page 18 of 28

Page 20

.
m.co s e m

l a
ag

67. Given a complete graph G with 5 69. Consider the graph shown below :
vertices, then the graph G has how

om a d . co
many spanning trees :
. c 21
e m
(A) 25
em
2
l as
as ag
(B)gl
3 c

a 125 1
20

(C) 225 e
b
(D) 325

68. Consider an undirected graph G Which of the following are the edges

with vertices {A, B, C, D}. In graph in the MST (Minimum Spanning

G, every edge has distinct weight.
m Tree) of the given graph ?

Edge CD has minimum weight. c. o(A) (a–b) (a–c) (c–d) (c–e)
e m
Edge AB has maximum weight.
l as
ag is
(B) (a–b) (a–d) (c–d) (c–e)
Then, which of the following
false ? (C) (a–b) (a–c) (b–c) (c–d) (c–e)

(A) Every minimum spanning tree (D) (b–c) (a–c) (c–e) (c–e)
of G must contain CD
70. In a directed graph, if there is a path
(B) If AB is in a minimum spanning from each vertex to every other
tree, then its removal must
o
vertex, then it is called : m
m . c
.co
disconnect G
em
(A) Weakly connected
s
s em (C) No minimum spanning tree
g la
la
(B) Tightly connected
contains AB a
(C) Strongly connected
(D) G has a unique minimum
spanning tree (D) Loosely connected

19

m
.co s e
s em
For more Question Papers, Sample Papers, Notes & Syllabus visit
gl a
Page 19 of 28

Page 21

71. In peephole optimization, constant 73. In an L-attributed grammar,
folding involves : synthesized attributes are calculated

(A) Combining consecutive loads using attributes from :

(B) Eliminating dead code (A) The same non-terminal

(C) Folding constant expressions (B) The parent non-terminal in the

during compilation parse tree

(D) Unrolling loops (C) The child non-terminal in the
parse tree
72. Which of the following best describes
the relationship between activation (D) The sibling non-terminal in the

records and the call stack ? parse tree

(A) Activation records are stored in 74. If A is a top-down parser and B is

a heap, and the call stack is a bottom-up parser, which of the

used for control flow following statements is false ?

(B) Activation records are stored in (A) A generates the string to be

call stack, representing the parsed, beginning with the

sequence of function calls start symbol of the grammar

(C) Activation records are managed (B) B reduces the input string to the

globally, and the call stack is start symbol of the grammar

used for loop constructs (C) A uses canonical reduction to

(D) Activation records and call check the syntactic errors

stack are unrelated concepts in (D) B uses canonical reduction to
memory management reach the start symbol

20

For more Question Papers, Sample Papers, Notes & Syllabus visit Page 20 of 28

Page 22

.
m .co s e m

l a
ag

75. The language L  {anbn cn : n  1} is
76. LF is recursively enumerable iff F
a content sensitive language. Give

om
a content sensitive grammar for L : satisfies which of the following
. co
. c e m
e m
(A) S  aSbc|aAbc
conditions ?
l as
l as
Ab  bA
a g
g
a Ac  Bbcc (1) If L is in F and L  L ' for

bB  Bb some recursively enumerable
aB  aa|aaA
language L', then L' is in F
(B) S  abc|aAbc
(containment property).
Ab  bA
m
Ac  Bbcc
c. o(2) If L is an infinite language in
bB  Bb
e m
l as F, then there is a finite subset

ag
aB  aa|aaA
of L which is in F.
(C) S  abc|aAbc

Ab  Ab
(3) The set of finite languages in
Ac  Bbcc
F is enumerable.
bB  Bb

aB  aa|aaA (A) (1) and (3)
m
m .co
.co
(D) S  abc|aAbc
e m
e m A  bA
(B) (2) Only

las
las A  Bbcc g
(C) (1) anda(2)
bB  Bb
(D) (1), (2) and (3)
aB  aa|aaA

21

m
.co s e
s em
For more Question Papers, Sample Papers, Notes & Syllabus visit
gl a
Page 21 of 28

Page 23

77. Let P1 be the problem of finding a 79. Give regular expression for the
Hamiltonian cycle in a graph G and language that contains all strings
P2 be the problem of determining if with at least one occurrence of each
a Hamiltonian cycle exists in a
symbol in   { a, b, c},}.
graph. Which one of the following
is true ? (A) (a + b + c)* abc (a + b + c)*

(A) Both P1 and P2 are NP-Hard (B) (a + b + c)* a (a + b + c)*

(B) P1 is NP-Hard, but P2 is not b (a + b + c)* c (a + b + c)*

(C) P2 is NP-Hard, but P1 is not (C) (a + b + c)* a (a + b + c)*
b (a + b + c)* c
(D) Neither P1 nor P2 is NP-Hard

78. Determine the language accepted by (D) a (a + b + c)* b (a + b + c)*

the following FA : c (a + b + c)*

80. Let L1 and L2 be languages on the
1
0 0 0 0, 1 same alphabet. Then the right
q0 q1 q2 q3
quotient of L1 with L2 is defined
1 1
0 as :
q4 (A) L1/L2 = {x : xy  L1 for some
1
y  L2}
(A) All strings containing 00 but
not 011 (B) L1/L2 = {x : x  L1 for some

(B) All strings containing 00 but y  L2}
not 000 (C) L1/L2 = {x : x  L1 for some
(C) All strings containing 000 but xy  L2}
not 00
(D) L1 – L2 = {x : xy  L1 for some
(D) All strings containing 11 but
not 000 y  L2}

22

For more Question Papers, Sample Papers, Notes & Syllabus visit Page 22 of 28

Page 24

.
m .co s e m

l a
ag

81. How many number of transmission 84. Which coaxial cable is used for
modes exists for data communication analog transmission ?
circuits ?
om . co
. c (A) 25 ohm cable
e m
(A) 4
e m l as
l
(B) 3 as (B) 50 ohm cable
ag
g
a2
(C)
(C) 75 ohm cable

(D) 100 ohm cable
(D) 1
85. IEEE 802.5 (the IBM token ring),
82. A ..................... is used in data
is operating at .............. and ...........
communication networks that
transfer high-speed digital information Mbps.

between only two stations.
o m 2 and 4
(A)

(A) multi-point
m .c
s e (B) 4 and 16
(B) point-to-point topology
l a
ag
(C) 16 and 32
(C) simplex
(D) 32 and 64
(D) duplex
86. In FDM, SPADE system full duplex
83. In a transmission, if the active time service, the total transponder
of the binary pulse is less than
bandwidth used was ............... Mbps
100% of the bit time then it is called
for uplink portion and .................
as ........................... .
m
.co
Mbps for downlink.
m (A) unipolar return to zero (UPRZ)
m .co (A) 25 and 50
s e m
s e (B) return to zero (RZ)
g la
la (C) unipolar non-return to zero a
(B) 50 and 50

(UPNRZ) (C) 50 and 75

(D) nonreturn to zero (NRZ) (D) 75 and 100

23

m
.co s e
s em
For more Question Papers, Sample Papers, Notes & Syllabus visit
gl a
Page 23 of 28

Page 25

87. Which is the special bit pattern of 90. In the principal DNS resource record
flag byte in a frame ? type, Type "A' represents ............. .

(A) 01010101
(A) Name server
(B) 10110110
(B) Pointer
(C) 01111110
(C) Host Description
(D) 10011001
(D) IP address of a host
88. What is the name of the protocol
in which the sender sends one 91. Which of the following is true related

frame and then waits for an to satisfiable property ?

acknowledgement before proceeding ? (A) A statement is satisfiable if
(A) Goback n there is some interpretation for

(B) piggybacking which it is false

(C) sliding window (B) A statement is satisfiable if

(D) stop and wait some interpretation for which it

89. Which code will be responded by the is true

server which indicates ready to (C) A statement is satisfiable if
accept email message ?
there is no interpretation for
(A) 250 which it is true

(B) 334 (D) A statement is satisfiable if
(C) 221 there is no interpretation for

(D) 350 which it is false

24

For more Question Papers, Sample Papers, Notes & Syllabus visit Page 24 of 28

Page 26

.
m .co s e m

l a
ag

92. What are transposition rule ? 96. Let A be a fuzzy set defined with
(A) From P  Q, infer ~ Q  P respect to the universal set X defined

om
(B) From P  Q, infer Q  ~ P for all x  X , then : . co
. c e m
e m
(C) From P  Q, infer Q  P (A) min[A(x), 1 – A(x)] = 0
l as
l as
(D) From P  Q, infer ~ Q ~ P
(B) min[A(x), 1 – A(x)]  0 a
g
a
93. In glanguage understanding, the
levels of knowledge that does not (C) min[A(x), 1 – A(x)] > 0
include ?
(D) min[A(x), 1 – A(x)] < 0
(A) Phonological
97. For a crisp relation R(X, X), iff the
(B) Syntactic
pair  x, y   R it is also the case
(C) Empirical
m that  y, x   R for each x, y  X
(D) Logical
c. ofor x  y , then such a relation is
94. Agents behavior can be best
e m
a
described by ................ .
l s called as a ............ relation.

(A) Perception sequence ag (A) transitive

(B) Agent function (B) symmetric
(C) Sensors and actuators
(C) reflexive
(D) Environment in which agent is
performing (D) nontransitive

95. A search algorithm takes ............... as 98. The binary relation on a single set
m
.co
an input and returns .............. as an “is smarter than” is ................. .
m
.co m
output.

m
(A) reflexive
s e
e la
(A) Input, output

las (B) Problem, solution a g
(B) symmetric

(C) Solution, problem (C) transitive

(D) Parameters, sequence of actions (D) reflexive and transitive

25

m
.co s e
s em
For more Question Papers, Sample Papers, Notes & Syllabus visit
gl a
Page 25 of 28

Page 27

99. Which type of crossover is performed in the following genetic algorithm

problem ?

Before Crossover

Parent A

Parent B

After Crossover

Child A

Child B

Interchange Interchange Interchange

(A) Matrix crossover (B) Multipoint even site crossover

(C) Uniform crossover (D) Single site crossover

100. The weight w for the autoassociative BAM set of vectors ( x1 , x2 ,....., xL ) is

computed as ........................... .

L L
(A)  i1 xi xit (B)  i1 xit xi
L  xi  L  xi 
t
(C)  i1  t 
 xi 
(D)  i1  x 
 i

26

For more Question Papers, Sample Papers, Notes & Syllabus visit Page 26 of 28

Page 28

.
m .co s e m

l a
ag

ROUGH WORK

om . co
. c e m
em l as
l as ag
ag

m
m .co
s e
l a
ag

m
m .co
m .co s e m
s e g la
la a

27

m
.co s e
s em
For more Question Papers, Sample Papers, Notes & Syllabus visit
gl a
Page 27 of 28

Page 29

ROUGH WORK

28

For more Question Papers, Sample Papers, Notes & Syllabus visit Page 28 of 28

Document Details

Board / OrgMaharashtra Exams
ExamMAHA SET
TypeQuestion Paper
Pages28
Updated17 Nov 2026