CUET PG MCA Digital Logic Previous Year Question Paper and Solution with PDF

Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations

CUET PG MCA
Previous Year Questions

CUET PG MCA
Previous Year Questions
CUET PG MCA

CUET PG MCA Previous Year Questions (PYQs)

CUET PG MCA Digital Logic PYQ

Qus : 1 CUET PG MCA PYQ

List I		List II
A.	Kailash Satyarthi	I.	Chemistry
B.	Abhijit Banerjee	II.	Peace
C.	Vinkatraman Ramakrishnan	III.	Physics
D.	Subrahmanyan Chandrasekhar	IV.	Economics

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQ CUET PG MCA CUET 2023 PYQ

Solution

List I		List II
A.	Kailash Satyarthi	II.	Peace
B.	Abhijit Banerjee	IV.	Economics
C.	Venkatraman Ramakrishnan	I.	Chemistry
D.	Subrahmanyan Chandrasekhar	III.	Physics

Qus : 2 CUET PG MCA PYQ

List I		List II
A.	Dog : Rabies :: Mosquito :	I.	Bacteria
B.	Amnesia : Memory :: Paralysis :	II.	Liver
C.	Meningitis : Brain :: Cirrhosis :	III.	Movement
D.	Influenza : Virus :: Typhoid :	IV.	Malaria

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQCUET PG MCA CUET 2023 PYQ

Solution

Dog causes Rabies, Mosquito causes Malaria → A-IV

Amnesia affects Memory, Paralysis affects Movement → B-III

Meningitis affects Brain, Cirrhosis affects Liver → C-II

Influenza is caused by Virus, Typhoid is caused by Bacteria → D-I

Correct matching: A-IV, B-III, C-II, D-I

Qus : 3 CUET PG MCA PYQ

A. If $(12P)_3 = (123)_p$, then value of $P$ is infeasible.

B. The simplified sum of product form of the Boolean expression is

$(P+\bar Q+\bar R)(P+\bar Q+R)(P+Q+\bar R)$

C. The minimum number of D flip-flops needed to design a mod-$(258)$ counter is $8$.

Choose the correct answer from the options given below:

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQ CUET PG MCA CUET 2023 PYQ

Solution

A: Base-3 number $(12P)_3$ implies $P<3$, but $(123)_p$ implies base $p>3$ ⇒ infeasible → True

B: Given expression is not in simplified SOP form → False

C: For mod-$258$, $2^8=256<258$, so minimum flip-flops required = 9 → False

Qus : 4 CUET PG MCA PYQ

A RAM chip has a capacity of $1024$ words of $8$ bits each $(1k \times 8)$. The number of $2 \times 4$ decoders with enable line needed to construct a $16k \times 16$ RAM from $1k \times 8$ RAM is ______.

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQ CUET PG MCA CUET 2023 PYQ

Solution

To go from $1k$ to $16k$: $16k/1k=16 \Rightarrow 4$ additional address lines. A $2\times4$ decoder selects $4$ blocks using $2$ lines. For $16$ blocks, $4$ such decoders are required, and with enable control one more decoder is needed. Total decoders $=5$

Qus : 5 CUET PG MCA PYQ

If $\oplus$ and $\odot$ denote exclusive OR and exclusive NOR operations respectively, then which one of the following is not correct?

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQ CUET PG MCA CUET 2023 PYQ

Solution

XOR and XNOR are complements of each other. Statement (1) claims them equal, which is false.

Qus : 6 CUET PG MCA PYQ

Arrange the following steps in the correct order to understand the functioning of a 3 to 8 line decoder.

(A). The encoder enable input is set to 1.

(B). The decoder activates one of its 8 output lines based on the input code.

(C). The input binary code is applied to the decoder.

(D). The decoder converts the 3-bit binary input into 8 possible outputs.

Choose the correct answer from the options given below:

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQ CUET PG MCA CUET 2025 PYQ

Solution

To understand the functioning of a 3-to-8 line decoder:

• (A) Enable input is set to 1.
• (C) Apply the 3-bit binary input.
• (D) Decoder converts the 3-bit input into 8 possible outputs.
• (B) Finally, one of the 8 output lines is activated based on the input code.

✅ Therefore, the correct sequence is: \[ (A), (C), (D), (B) \]

Qus : 7 CUET PG MCA PYQ

Given the following truth table:

A	B	X
0	0	1
0	1	0
1	0	0
1	1	0

Which of the following Boolean functions does it represent?

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQ CUET PG MCA CUET 2022 PYQ

Solution

Qus : 8 CUET PG MCA PYQ

What should be the minimum hamming distance dmin to guarantee correction of upto p errors in a given block code.

1. 2p

2. 2p+1

3. 2p-1

4. $2^{p-2}$

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQ CUET PG MCA CUET 2025 PYQ

Solution

We know the relationship between minimum Hamming distance $d_{\min}$ and error correction capability $p$:

\[ d_{\min} \;\geq\; 2p + 1 \]

This ensures the code can correct up to $p$ errors.

✅ Correct answer:

\[ \boxed{2p+1} \]

Qus : 9 CUET PG MCA PYQ

Match List-I with List-II

List-1	List-II
JK Flip Flop inputs	Next State
(A). 0 0	(I). Toggle
(B). 0 1	(II). Set
(C). 1 0	(III). Reset
(D). 1 1	(IV). No Change

Choose the correct answer from the options given below:

1. (A) - (I), (B) - (II), (C) - (III), (D) - (IV)

2. (A) - (IV), (B) - (III), (C) - (II), (D) - (I)

3. (A) - (IV), (B) - (III), (C) - (I), (D) - (II)

4. (A) - (I), (B) - (II), (C) - (IV), (D) - (III)

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQ CUET PG MCA CUET 2025 PYQ

Solution

JK Flip-Flop Truth Table (Inputs → Next State)

(A) 0 0 → (IV) No Change
(B) 0 1 → (III) Reset
(C) 1 0 → (II) Set
(D) 1 1 → (I) Toggle

✅ Correct Answer: Option 2

Qus : 10 CUET PG MCA PYQ

Minimum number of 2:1 Multiplexers required to design a 16:1 Multiplexer is?

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQ CUET PG MCA CUET 2025 PYQ

Solution

To implement an $n:1$ multiplexer using only $2:1$ multiplexers, the minimum number required is:

\[ \text{Number of 2:1 MUX} = n - 1 \]

For $n = 16$:

\[ 16 - 1 = 15 \]

✅ Therefore, the minimum number of $2:1$ multiplexers required to design a $16:1$ multiplexer is: \[ \boxed{15} \]

Qus : 11 CUET PG MCA PYQ

A 2’s-complement adder–subtracter can add or subtract binary numbers. Sign-magnitude numbers represent ______ decimal numbers, and 2’s complements stand for ______ decimal numbers.

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQ CUET PG MCA CUET 2023 PYQ

Solution

In sign-magnitude representation, a separate sign bit is used, mainly representing positive numbers explicitly.

2’s-complement representation is primarily used to represent negative numbers in binary arithmetic.

Qus : 12 CUET PG MCA PYQ

Consider the following statements.

(A). Combinational logic circuits do not have memory, while sequential logic circuits have memory elements.

(B). Sequential logic circuits depend only on the current inputs,while combinational logic circuits depend on both current and past inputs.

(C). Flip-flops and latches are examples of combinational logic circuits.

(D). Multiplexer is an example of combinational logic circuit.

Choose the correct statement/statements from the options given below:

1. (A) and (D) only

2. (A), (B) and (D) only

3. (A), (B), (C) and (D)

4. (B), (C) and (D) only

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQ CUET PG MCA CUET 2025 PYQ

Solution

(A). ✅ Correct. Combinational logic circuits do not have memory. Sequential circuits include memory elements.

(B). ❌ Incorrect. Sequential circuits depend on both current and past inputs (via memory), while combinational circuits depend only on current inputs.

(C). ❌ Incorrect. Flip-flops and latches are examples of sequential circuits, not combinational circuits.

(D). ✅ Correct. Multiplexer (MUX) is a combinational logic circuit.

Correct Statements: (A) and (D)

Answer: Option 1

Qus : 13 CUET PG MCA PYQ

The following circuit generates the same output as?

1. XOR GATE

2. XNOR GATE

3. NAND GATE

4. NOR GATE

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQ CUET PG MCA CUET 2025 PYQ

Solution

Qus : 14 CUET PG MCA PYQ

A logic circuit, that can odd two 1-bit numbers and produce output for sum and carry but cannot handle carry, input, is called ____________.

1
2
3
4
Go to Discussion

CUET PG MCA Previous Year PYQ CUET PG MCA CUET 2024 PYQ

Solution

A circuit that adds two 1-bit numbers and produces outputs for Sum and Carry but does not handle carry input is called a Half Adder.

A	B	Sum (A⊕B)	Carry (A·B)
0	0	0	0
0	1	1	0
1	0	1	0
1	1	0	1

Boolean Expressions:

Sum = $ A \oplus B $
Carry = $ A \cdot B $

Final Answer: The circuit is a Half Adder.

CUET PG MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

CUET PG MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Feedback

Info.

Information

Aspire's Library

CUET PG MCA Previous Year Questions (PYQs)

CUET PG MCA Digital Logic PYQ

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

JK Flip-Flop Truth Table (Inputs → Next State)

Solution

Solution

Solution

Solution

Solution

Solution

CUET PG MCA

CUET PG MCA

Info.

Confirm Delete

Edit