csmasters.dev

Combinational Logic Circuit Simulation

Work from inputs towards the output. Label intermediate wires so you can evaluate one gate at a time.

A and B feed AND to produce X; C feeds NOT to produce Y; X and Y feed OR to produce Q

Worked row

The circuit means X = A AND B, Y = NOT C, Q = X OR Y. For A=1,B=0,C=1, X=0 and Y=0, so Q=0. For A=1,B=1,C=1, X=1 and Y=0, so Q=1.

The expression is (A AND B) OR (NOT C). Parentheses preserve the intended structure. To build a truth table, list all eight combinations of A,B,C and add columns for X,Y,Q. Evaluate each column in dependency order.

Independent construction

A fan should run when Hot AND Occupied are both 1, or when Manual is 1. Draw the circuit on paper, then write its expression and complete its truth table. Keep the gates corresponding to the stated rule; do not simplify away part of the required representation.

Self-review: use one AND feeding one OR; Hot and Occupied enter AND, Manual enters the other OR input. There are three inputs and one output. Check the row Hot=0,Occupied=1,Manual=1: the output must be 1.

AI Socratic Tutor

All-Access
Sign in or create an account. AI Tutor is an All-Access benefit.
Sign Up

Need guidance? Ask a question or use the hint below.

AI Socratic Tutor is an All-Access Benefit

Unlock step-by-step Socratic hints, algorithm trace table walkthroughs, and error diagnostics for every Cambridge exercise.

View All-Access Plans

You're chatting with an AI tutor, not a person. AI can make mistakes, so double-check its answers.

Exercise:
Task 1 Task 2 Task 3

Exam-Style Check: Tracing Combinational Circuit Intermediate Signals

• Multiple Choice
+25 XP
Question

A combinational logic circuit processes three binary inputs $A = 0$, $B = 1$, and $C = 1$ through three logic gates:

  • Intermediate node $P = A \text{ OR } B$ (Gate 1: OR)
  • Intermediate node $Q = \text{NOT }(B \text{ AND } C)$ (Gate 2: NAND)
  • Final output $X = P \text{ AND } Q$ (Gate 3: AND)

What are the resulting binary values at nodes $P$, $Q$, and final output $X$?

All-Access Required

Interactive exercises for Module 2 and beyond require an active plan.

Unlock All-Access ($30/mo) Already subscribed? Sign in