跳到主要内容

题型分析:Boolean Algebra and Logic Circuits


题型 1:根据电路图填写 Truth Table​

典型例题:9618/s21/qp/31 Q7(a)​

题目:A logic circuit has three inputs AA, BB, CC and two outputs SS and CoutC_{out}. The circuit contains XOR, AND, and OR gates. Complete the truth table.

S = A XOR B XOR C_in
C_out = (A AND B) OR (C_in AND (A XOR B))

Truth Table(Full Adder):

AABBCinC_{in}SSCoutC_{out}
00000
00110
01010
01101
10010
10101
11001
11111
📝 MS 展开查看
  • M1:正确构造 8 行输入组合
  • A1:全部 SS 值正确
  • A1:全部 CoutC_{out} 值正确
  • Note: This is a full adder circuit.

题型 2:K-map 化简​

典型例题:9618/s23/qp/32 Q9​

题目:Complete the K-map from the truth table and derive the simplest sum-of-products (SOP) expression.

K-map 填入(4 variables: AA, BB, CC, DD):

CD
AB 00 01 11 10
00 1 0 1 1
01 0 1 0 0
11 1 0 1 0
10 1 0 1 1

化简结果(SOP):D‾+B‾CD+A‾BC‾D+ABCD\overline{D} + \overline{B}CD + \overline{A}B\overline{C}D + ABCD

📝 MS 展开查看
  • M1:正确将 truth table 填入 K-map
  • M1:正确圈出相邻的 1
  • A1:得到正确的简化表达式
  • A1:最终 SOP 形式正确

题型 3:布尔代数化简(De Morgan's Laws)​

典型例题:9618/w22/qp/32 Q8(c)​

题目:Simplify the expression (A+B)⋅C‾\overline{(A + B) \cdot C} using De Morgan's laws.

解题步骤:

  1. Apply De Morgan's: (A+B)⋅C‾=A+B‾+C‾\overline{(A + B) \cdot C} = \overline{A + B} + \overline{C}
  2. Apply De Morgan's again: A+B‾=A‾⋅B‾\overline{A + B} = \overline{A} \cdot \overline{B}
  3. Result: A‾⋅B‾+C‾\overline{A} \cdot \overline{B} + \overline{C}
📝 MS 展开查看
  • M1:正确应用 De Morgan's 第一次
  • M1:正确应用 De Morgan's 第二次
  • A1:最终简化结果正确

题型 4:Flip-flop 电路​

典型例题:9618/w22/qp/32 Q8(a)​

题目:Complete the truth table for the SR flip-flop.

SR Flip-flop 特性表:

SSRRQ(t)Q(t)Q(t+1)Q(t+1)状态
0000Hold
0011Hold
0100Reset
0110Reset
1001Set
1011Set
110-Invalid
111-Invalid
📝 MS 展开查看
  • B1:S=0,R=0S=0, R=0 时 Q(t+1)=Q(t)Q(t+1)=Q(t)
  • B1:S=0,R=1S=0, R=1 时 Q(t+1)=0Q(t+1)=0
  • B1:S=1,R=0S=1, R=0 时 Q(t+1)=1Q(t+1)=1
  • B1:S=1,R=1S=1, R=1 时 Invalid / not allowed