CUET PG MCA 2026 Previous Year Questions (PYQs) – Page 6 of 7
Study Stuff for MCA Examinations
Matching
| Column A | Column B | |
|---|---|---|
| A. Taxonomy | I. Biography | |
| B. Pedology | II. History | |
| C. Man | III. Social | |
| D. Nation | IV. Classification |
Options:
(a) A–IV, B–I, C–III, D–II
(b) A–III, B–I, C–IV, D–II
(c) A–IV, B–III, C–I, D–II
(d) A–II, B–IV, C–I, D–III
Solution
Taxonomy → Classification → IV
Pedology → Study of soil / earth (related to earth history) → II
Man → Social → III
Nation → Biography / historical account → I
Correct Answer: (a) A–IV, B–I, C–III, D–II
Half adder has
(a) two input two output
(b) one input two output
(c) two input one output
(d) one input one output
Solution
A Half Adder is a combinational circuit used to add two binary bits.
Inputs: A, B → 2 inputs
Outputs: Sum (S) and Carry (C) → 2 outputs
Sum = A ⊕ B
Carry = A · B
| Column A | Column B | |
|---|---|---|
| (A) FCFS | I. Give CPU according to highest priority | |
| (B) SJF | II. Gives a CPU to process which come first | |
| (C) Priority Scheduling | III. Gives CPU to process with shortest burst time | |
| (D) RR | IV. Time sharing |
Options:
(a) (A)-II, (B)-III, (C)-I, (D)-IV
(b) (A)-I, (B)-II, (C)-III, (D)-IV
(c) (A)-II, (B)-I, (C)-III, (D)-IV
(d) (A)-IV, (B)-III, (C)-II, (D)-I
Solution
FCFS → process which comes first → II
SJF → shortest burst time → III
Priority Scheduling → highest priority → I
Round Robin (RR) → time sharing → IV
Find the missing ?
M, N, O, L, R, J, V, ?
Options:
(a) A
(b) E
(c) F
(d) H
Solution
Split the series into two parts:
1st, 3rd, 5th, 7th terms: M, O, R, V
Positions: 13, 15, 18, 22
Pattern: +2, +3, +4
2nd, 4th, 6th, 8th terms: N, L, J, ?
Positions: 14, 12, 10, 8
Pattern: −2, −2, −2
Position 8 corresponds to H.
Correct Answer: (d) H
Assertion: Binary search tree property allow to print all keys in binary search tree in sorted order by simple recursive algorithm called inorder tree walk.
Reason: The inorder tree walk algorithm print the key root of subtree between printing value in its left subtree and printing those in its right subtree.
Options:
(a) Assertion is true, Reason is true, and Reason is the correct explanation of the Assertion.
(b) Assertion is true, Reason is true, but Reason is not the correct explanation of the Assertion.
(c) Assertion is true, but Reason is false.
(d) Assertion is false, but Reason is true.
Solution
In a Binary Search Tree (BST), all keys in the left subtree are smaller than the root and all keys in the right subtree are larger than the root.
Inorder traversal follows the order:
Left Subtree → Root → Right Subtree
Because of the BST property, this traversal prints the elements in sorted order.
The reason correctly explains the inorder traversal process where the root is printed between its left and right subtree.
Correct Answer: (a) Assertion is true, Reason is true, and Reason is the correct explanation of the Assertion.
Assertion: A(BA) and (AB)A are symmetric matrices.
Reason: AB is symmetric matrix, if matrix multiplication of A with B is commutation.
Options:
(a) Assertion is true, Reason is true, and Reason is the correct explanation of the Assertion.
(b) Assertion is true, Reason is true, but Reason is not the correct explanation of the Assertion.
(c) Assertion is true, but Reason is false.
(d) Assertion is false, but Reason is true.
Solution
A(BA) = (AB)A = ABA
If A and B are symmetric matrices, then
(ABA)T = ATBTAT
Since A and B are symmetric,
AT = A and BT = B
Therefore
(ABA)T = ABA
Hence A(BA) and (AB)A are symmetric matrices.
Also, AB is symmetric if AB = BA (i.e., A and B commute).
Correct Answer: (a) Assertion is true, Reason is true, and Reason is the correct explanation of the Assertion.
Arrange the following steps of retrieving data from memory unit.
(A) Memory Address Register send address to memory chip
(B) The address is placed on address bus
(C) The control unit sends signal
(D) Data is retrieved and place into the Memory Data Register
Options:
(a) D, C, A, B
(b) A, B, C, D
(c) A, C, D, B
(d) B, D, A, C
Solution
1. Memory Address Register (MAR) sends the address → (A)
2. Address is placed on the address bus → (B)
3. Control unit sends the read signal → (C)
4. Data is fetched and stored in Memory Data Register (MDR) → (D)
Correct Order: A → B → C → D
Correct Answer: (b) A, B, C, D
| Column A | Column B | |
|---|---|---|
| (A) Minimum Spanning Tree | I. Height balanced | |
| (B) Topological Sort | II. Stack | |
| (C) Recursion | III. Kruskal's algorithm | |
| (D) AVL Tree | IV. DFS |
Options:
(a) (A)-I, (B)-II, (C)-III, (D)-IV
(b) (A)-II, (B)-I, (C)-III, (D)-IV
(c) (A)-IV, (B)-III, (C)-II, (D)-I
(d) (A)-III, (B)-IV, (C)-II, (D)-I
Solution
Minimum Spanning Tree → Kruskal's algorithm → III
Topological Sort → DFS based algorithm → IV
Recursion → uses stack → II
AVL Tree → height balanced tree → I
Correct Answer: (d) (A)-III, (B)-IV, (C)-II, (D)-I
(a) A is diagonal matrix
(b) A is zero matrix
(c) A is scalar matrix
(d) A is square matrix
Solution
If a matrix A is symmetric, then
AT = A
If a matrix A is skew symmetric, then
AT = −A
For both conditions to hold:
A = −A
⇒ 2A = 0
⇒ A = 0
Therefore, the matrix must be a zero matrix.
Correct Answer: (b) A is zero matrix
(a) Monkey
(b) Stag
(c) Ass
(d) Sheep
Solution
Cub → young one of Tiger
Fawn → young one of Deer
Adult male deer is called Stag.
Correct Answer: (b) Stag
CUET PG MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
CUET PG MCA
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
