PYQ Vault
EbooksTutor

Switching circuit for a given logical statement

This type of question, asked 4 times: 3 May 2023 S1, 21 Apr 2025 S2, 18 Apr 2026 S2, 12 May 2026 S2. All 4 questions below, oldest first.

Try each one first, then open its answer.

  1. Question 1

    3 May 2023 S1

    147
    Consider the following statements: p: the switch S1 is closed. q: the switch S2 is closed. r: the switch S3 is closed. Then the switching circuit represented by the statement (p∧q)∨(∼p∧(∼q∨p∨r))(p\wedge q)\vee(\sim p\wedge(\sim q\vee p\vee r)) is

    Tap an option to check your answer.

  2. Question 2

    21 Apr 2025 S2

    134
    The correct simplified circuit diagram for the logical statement [{q∧(∼q∨r)}∧{∼p∨(p∧∼r)}]∨(p∧r)\mathbf{\lbrack\{ q \land ( \sim q \vee r)\} \land \{ \sim p \vee (p \land \sim r)\}\rbrack \vee (p \land r)} Where p,q,rp,q,r represents switches s1,s2,s3s_{1},s_{2},s_{3} respectively.

    Tap an option to check your answer.

  3. Question 3

    18 Apr 2026 S2

    59
    In a switching circuit, if the combination (S1∧S2)(S_1 \wedge S_2) is connected in parallel to the combination (S1′∧S2′)(S_1' \wedge S_2'), then the room is lit only when …\ldots

    Tap an option to check your answer.

  4. Question 4

    12 May 2026 S2

    63
    The switching circuit for the logical expression (p∧q)∨∼(p∧q)(p \wedge q) \vee \sim(p \wedge q) is simplified and found to be equivalent to a circuit with:

    Tap an option to check your answer.