Prashnikaप्रश्निका
Code
About
Computer ScienceClass 12

Computer Hardware - ISC Class 12 Computer Science Questions with Answers

59 past-paper questions on Computer Hardware from ISC Class 12 Computer Science papers (2026-2017), newest first, in full. Questions 1-20 are on this page, 20 to a page. Tap "Show answer" under a question to see its answer. The syllabus covers Elementary logic gates, Half adders, Full adders, Encoders, Decoders, Multiplexers and Universal gates.

59questions
9years
2026newest
202612 questions
3 marks · Short answerOpen: From the logic gate diagram given below, derive the Boolean expression for (1)…

Answer the following from the logic gate diagram.

From the logic gate diagram given below, derive the Boolean expression for (1), (2) and S. Reduce the derived expression.
Figure for this question
Show answer

Answer

Checked answer.
(1) $= A \oplus B = A' \cdot B + A \cdot B'$ (2) $= (A' \cdot B + A \cdot B') \cdot C$ $S = A' \cdot B \cdot C + A \cdot B' \cdot C + A \cdot B = A \cdot B + B \cdot C + C \cdot A$ (the carry of a full adder)
  1. The first gate is an XOR gate with inputs A and B: (1) $= A \oplus B = A' \cdot B + A \cdot B'$
  2. The second gate is an AND gate with inputs (1) and C: (2) $= (A' \cdot B + A \cdot B') \cdot C = A' \cdot B \cdot C + A \cdot B' \cdot C$
  3. The bottom AND gate has inputs A and B: $A \cdot B$
  4. The OR gate gives $S = A' \cdot B \cdot C + A \cdot B' \cdot C + A \cdot B$
  5. $A \cdot B = A \cdot B \cdot (C + C') = A \cdot B \cdot C + A \cdot B \cdot C'$, and a term may be repeated (Idempotent law), so $S = (A' \cdot B \cdot C + A \cdot B \cdot C) + (A \cdot B' \cdot C + A \cdot B \cdot C) + A \cdot B$
  6. $= B \cdot C \cdot (A' + A) + A \cdot C \cdot (B' + B) + A \cdot B = B \cdot C + A \cdot C + A \cdot B$ (Complement law)
  7. $S = A \cdot B + B \cdot C + C \cdot A$
1 mark · Short answerOpen: State any one application of a multiplexer.

Answer the following.

State any one application of a multiplexer.
Show answer

Answer

One application of a multiplexer is in data routing / data selection in communication systems, where multiple data sources share a single transmission medium.
3 marks · DrawingOpen: Construct the logic gate diagram for a Full Adder using two Half Adders.

Draw the following.

Construct the logic gate diagram for a Full Adder using two Half Adders.

Draw: logic gate diagram

Show answer

Answer

Full Adder using two Half Adders: - Inputs: A, B, Cin - HA1: XOR gate gives S1 = A ⊕ B; AND gate gives C1 = A • B - HA2: XOR gate gives Sum S = S1 ⊕ Cin = (A ⊕ B) ⊕ Cin; AND gate gives C2 = S1 • Cin = (A ⊕ B) • Cin - OR gate combines C1 and C2 to produce Carry-out: Cout = C1 + C2 = (A • B) + (A ⊕ B) • Cin In the diagram, HA1 is the XOR and AND gates fed by A and B (outputs S1 and C1), and HA2 is the XOR and AND gates fed by S1 and Cin (outputs Sum and C2).
Diagram for this answer
3 marks · DrawingOpen: Draw the logic gate diagram for decoding the binary numbers {0011, 0100, 0101…

Answer the following.

Draw the logic gate diagram for decoding the binary numbers {0011, 0100, 0101, 0111, 1011, 1110} to hexa-decimal numbers.

Draw: logic gate diagram

Show answer

Answer

Logic gate diagram for decoding binary numbers to hexadecimal: Inputs: A, B, C, D and their complements A', B', C', D' via NOT gates. Six 4-input AND gates are connected as follows: - For 0011 (Hex 3): Output = A' • B' • C • D - For 0100 (Hex 4): Output = A' • B • C' • D' - For 0101 (Hex 5): Output = A' • B • C' • D - For 0111 (Hex 7): Output = A' • B • C • D - For 1011 (Hex B): Output = A • B' • C • D - For 1110 (Hex E): Output = A • B • C • D'
Diagram for this answer
2 marks · DrawingOpen: Draw the logic gate diagram for 2-input AND gate using NOR gates only. Show the…

Draw the following.

Draw the logic gate diagram for 2-input AND gate using NOR gates only. Show the expression at each step.

Draw: logic gate diagram

Show answer

Answer

Implementation of 2-input AND gate using NOR gates only: Step 1: Invert A using a NOR gate with common inputs: Output 1 = (A + A)' = A' Step 2: Invert B using a NOR gate with common inputs: Output 2 = (B + B)' = B' Step 3: Feed A' and B' into a third NOR gate: Output = (A' + B')' = (A')' • (B')' = A • B
Diagram for this answer
1 mark · Short answerOpen: What is a decoder?

Answer the following.

What is a decoder?
Show answer

Answer

A decoder is a combinational logic circuit that converts binary information from n input lines to a maximum of 2^n unique output lines, activating the line corresponding to the input binary code.
3 marks · DrawingOpen: Draw the logic gate diagram for 8 : 1 multiplexer.

Answer the following.

Draw the logic gate diagram for 8 : 1 multiplexer.

Draw: Logic gate diagram for an 8 : 1 multiplexer

Must show: 8 data inputs, 3 select lines, output

Show answer

Answer

Logic gate diagram of an 8:1 multiplexer: data inputs $I_0$ to $I_7$, select lines $S_2 S_1 S_0$ (with their complements), eight 4-input AND gates (one for each select combination) and an 8-input OR gate. $Y = S_2'S_1'S_0'I_0 + S_2'S_1'S_0I_1 + S_2'S_1S_0'I_2 + S_2'S_1S_0I_3 + S_2S_1'S_0'I_4 + S_2S_1'S_0I_5 + S_2S_1S_0'I_6 + S_2S_1S_0I_7$
Diagram for this answer
3 marks · Short answerOpen: From the logic gate diagram given below, derive the Boolean expression for (1)…

Answer the following.

From the logic gate diagram given below, derive the Boolean expression for (1), (2) and Q. Reduce the derived expression.
Figure for this question
Show answer

Answer

From the given logic gate diagram: 1. Expression for (1): The top gate is a 3-input AND gate with inputs A, B, and C. (1) = A • B • C 2. Expression for (2): Input A passes through to a 2-input AND gate. Inputs B and C pass through NOT gates to produce B' and C', which enter a 2-input OR gate to produce (B' + C'). The 2-input AND gate takes inputs A and (B' + C'). (2) = A • (B' + C') 3. Expression for Q: Outputs (1) and (2) enter a 2-input OR gate. Q = (1) + (2) = A • B • C + A • (B' + C') 4. Reduction of Q: Q = A • [B • C + (B' + C')] By De Morgan's Law: B' + C' = (B • C)' Q = A • [B • C + (B • C)'] By Complement Law: X + X' = 1 (where X = B • C) Q = A • 1 By Identity Law: Q = A Reduced expression: Q = A
3 marks · DrawingOpen: Draw the logic gate diagram for a Full Adder. Write the Boolean expression for…

Draw the following.

Draw the logic gate diagram for a Full Adder. Write the Boolean expression for its SUM and CARRY.

Draw: Logic gate diagram for a Full Adder

Must show: SUM, CARRY

Show answer

Answer

A full adder adds three bits A, B and the carry-in C, and gives SUM and CARRY. $SUM = A'B'C + A'BC' + AB'C' + ABC = A \oplus B \oplus C$ $CARRY = AB + BC + AC$ Logic gate diagram: two XOR gates give SUM (the first adds A and B, the second adds C); three AND gates (AB, BC, AC) feed an OR gate for CARRY.
Diagram for this answer
1 mark · Short answerOpen: State any one application of an encoder.

Answer the following.

State any one application of an encoder.
Show answer

Answer

Application of an encoder: used in keyboard encoders — to convert the key pressed by the user (a decimal/alphanumeric character) into its equivalent binary (e.g. ASCII) code for the computer to process. (Other valid answers: priority encoders in interrupt-handling systems, decimal-to-BCD encoders in calculators.)
2 marks · DrawingOpen: Draw the logic gate diagram for 2-input OR gate using NAND gates only. Show the…

Draw the following.

Draw the logic gate diagram for 2-input OR gate using NAND gates only. Show the expression at each step.

Draw: Logic gate diagram of a 2-input OR gate using NAND gates only, with the expression at each step

Must show: NAND gates only, expression at each step

Show answer

Answer

2-input OR gate using NAND gates only (three NAND gates): Step 1: NAND1 with both inputs tied to A: $(A \cdot A)' = A'$ Step 2: NAND2 with both inputs tied to B: $(B \cdot B)' = B'$ Step 3: NAND3 with inputs $A'$ and $B'$: $(A' \cdot B')' = A + B$ (De Morgan's law)
Diagram for this answer
20258 questions
5 marks · DrawingOpen: Draw the logic gate diagram for an octal to binary encoder. State how…

Draw the following.

Draw the logic gate diagram for an octal to binary encoder. State how multiplexer can be derived from a decoder. Mention one application of multiplexer.

Draw: logic gate diagram for an octal to binary encoder

Show answer

Answer

Octal-to-Binary encoder: 8 input lines D0-D7 (only one HIGH at a time), 3 output lines A2 A1 A0 giving the binary code of the active input line. $A_2 = D_4 + D_5 + D_6 + D_7$ $A_1 = D_2 + D_3 + D_6 + D_7$ $A_0 = D_1 + D_3 + D_5 + D_7$ $D_0$ (code 000) needs no connection: when it is active all three outputs stay 0. Multiplexer from a decoder: the select lines are fed to the decoder's inputs; each decoder output is ANDed with one data input, and all the AND outputs go into one OR gate. Only the AND gate enabled by the selected decoder output passes its data input to the output. Application of a multiplexer: data selection/routing - sending one of many input signals onto a single line, e.g. in communication systems or onto a common data bus.
Diagram for this answer
2 marks · DrawingOpen: Following is the circuit diagram of a full adder. Redraw the circuit diagram by…

Draw the following.

Following is the circuit diagram of a full adder. Redraw the circuit diagram by adding missing logic gates.

Draw: Full adder logic circuit with missing gates (i), (ii), (iii), (iv) filled in

Must show: XOR gate, AND gate, OR gate

Figure for this question
Show answer

Answer

A full adder circuit with A, B and C_in as inputs, and Sum and C_out as outputs. Box (i) is a 2-level XOR block computing Sum = A XOR B XOR C_in (first XOR combines A and B, second XOR combines that result with C_in). The pre-drawn AND gate, plus boxes (ii) and (iv), are the three AND gates AB, B.C_in and A.C_in (one input pair each). Box (iii) is an OR gate that combines the outputs of all three AND gates to give C_out = AB + B.C_in + A.C_in.
Diagram for this answer
2 marks · DrawingOpen: Draw the logic circuit diagram for the simplified form of the following…

Draw the following.

Draw the logic circuit diagram for the simplified form of the following expression: $AB'C' + AB'C + ABC$ The circuit diagram should only contain one AND, one OR and one NOT gates.

Draw: Logic circuit diagram for simplified expression AB'C' + AB'C + ABC = A(B' + C) using one AND, one OR and one NOT gate

Must show: AND gate, OR gate, NOT gate

Show answer

Answer

A circuit with three inputs A, B, C. A NOT gate inverts B to give B'. An OR gate combines B' and C to give (B'+C). An AND gate combines A and (B'+C) to give the output F = A(B'+C), which equals the given expression AB'C' + AB'C + ABC.
Diagram for this answer
1 mark · Short answerOpen: A full adder needs five gates and those are 3 AND gates, 1 OR gate and 1 XOR…

Answer the following.

A full adder needs five gates and those are 3 AND gates, 1 OR gate and 1 XOR gate. When a full adder is constructed using 2 half adders, it also requires 5 gates. State the names along with the quantity those gates.
Show answer

Answer

Official answer key
When a full adder is constructed using 2 half adders, it requires 2 AND gates, 1 OR gate and 2 XOR gates - one AND gate and one XOR gate come from each of the two half adders, plus one extra OR gate is added to combine the two carry outputs into the final carry.
2 marks · Case basedOpen: Answer the following questions related to the below image: What is the output…

Answer the following from the logic gate diagram.

Answer the following questions related to the below image:
Figure for this question
(a)[1]
What is the output of the above gate if input $A = 0$, $B = 1$?
(b)[1]
What are the values of the inputs if output = 1?
Show answer

Answer (a)

Official answer key
The gate shown is a NOR gate. Output = $(A+B)' = (0+1)' = 1' = 0$.

Answer (b)

Official answer key
The gate shown is a NOR gate, whose output is 1 only when all of its inputs are 0. So the output is 1 when A = 0 and B = 0.
5 marks · DrawingOpen: What is an encoder? Draw the logic gate diagram for an octal to binary encoder…

Draw the following.

What is an encoder? Draw the logic gate diagram for an octal to binary encoder. State one application of a decoder.

Draw: logic gate diagram for an octal to binary encoder

Show answer

Answer

An encoder is a combinational logic circuit that converts $2^n$ input lines (of which only one is active/HIGH at a time) into an n-bit binary code on its output lines - it performs the reverse operation of a decoder. Application of a decoder: Decoders are used in memory address decoding, to select one specific memory location / register out of many, from its binary address. Octal to binary encoder: 8 input lines $D_0$ to $D_7$ (only one active at a time) and 3 outputs $A_2 A_1 A_0$: $A_2 = D_4 + D_5 + D_6 + D_7$ $A_1 = D_2 + D_3 + D_6 + D_7$ $A_0 = D_1 + D_3 + D_5 + D_7$ $D_0$ (code 000) needs no connection: when it is active all three outputs stay 0.
Diagram for this answer

About Computer Hardware

Computer Hardware is a unit of the ISC Class 12 Computer Science syllabus.

The syllabus lists these topics: Elementary logic gates, Half adders, Full adders, Encoders, Decoders, Multiplexers and Universal gates.

Prashnika has 59 past-paper questions on Computer Hardware, from papers of 2017-2026, asked in 9 different years. By kind: Drawing (25), Short answer (14), MCQ (8) and Long answer (7). They carry between 0.5 and 5 marks, and most are worth 1 mark.

To practise, use the paper generator, which can build a practice paper from this chapter.

Common questions

What topics are in Computer Hardware in ISC Class 12 Computer Science?

The syllabus lists Elementary logic gates, Half adders, Full adders, Encoders, Decoders, Multiplexers and Universal gates.

How many questions on Computer Hardware are in ISC Class 12 Computer Science past papers?

Prashnika has 59 questions on Computer Hardware, from papers of 2017-2026 (board, specimen, improvement and practice papers together).

What kinds of questions are asked on Computer Hardware?

By kind: Drawing (25), Short answer (14), MCQ (8) and Long answer (7).

Questions on other pages on Computer Hardware