1.简单
点选 4 变量卡诺图中属于最小项 m6 的格子（变量 A、B、C、D，A 为最高位）。
m6
- 1AB = 00, CD = 00
- 2AB = 00, CD = 01
- 3AB = 00, CD = 11
- 4AB = 00, CD = 10
- 5AB = 01, CD = 00
- 6AB = 01, CD = 01
- 7AB = 01, CD = 11
- 8AB = 01, CD = 10
- 9AB = 11, CD = 00
- 10AB = 11, CD = 01
- 11AB = 11, CD = 11
- 12AB = 11, CD = 10
- 13AB = 10, CD = 00
- 14AB = 10, CD = 01
- 15AB = 10, CD = 11
- 16AB = 10, CD = 10
2.简单
对于所示的逻辑电路，输入 A、B、C 的 8 种组合中有多少种使输出 F = 1？求 N。
A, B, C → F
N =
3.中等
在这个卡诺图中，恰有一个 1 没有相邻的 1，所以它在最简 SOP 形式中仍是单个格子的圈（含四个文字的完整最小项）。跨越卡诺图边界的相邻关系也要计入。点选该格子。
F = Σm(0, 1, 4, 8, 10, 11, 13, 14)
- 1AB = 00, CD = 00
- 2AB = 00, CD = 01
- 3AB = 00, CD = 11
- 4AB = 00, CD = 10
- 5AB = 01, CD = 00
- 6AB = 01, CD = 01
- 7AB = 01, CD = 11
- 8AB = 01, CD = 10
- 9AB = 11, CD = 00
- 10AB = 11, CD = 01
- 11AB = 11, CD = 11
- 12AB = 11, CD = 10
- 13AB = 10, CD = 00
- 14AB = 10, CD = 01
- 15AB = 10, CD = 11
- 16AB = 10, CD = 10
4.中等
用卡诺图求 F(A, B, C, D) = Σm(0, 1, 2, 4, 6, 8, 9, 13, 15) 的最简积之和 (SOP) 形式。它有多少个乘积项 N？
F(A, B, C, D) = Σm(0, 1, 2, 4, 6, 8, 9, 13, 15)
N =
5.困难
求 F(A, B, C, D) = Σm(2, 4, 5, 12) + d(3, 8, 9, 10, 13, 15) 的最简 SOP 形式，其中 d 表示无关项。它包含多少个文字 L？
F(A, B, C, D) = Σm(2, 4, 5, 12) + d(3, 8, 9, 10, 13, 15)
L =
6.困难
一个 4 位移位寄存器 Q₃Q₂Q₁Q₀ 中存有 1100。每个时钟边沿，各位向右移动一位（Q₃ → Q₂ → Q₁ → Q₀，Q₀ 丢失），串行输入进入 Q₃。串行输入在 4 个边沿处为 1, 0, 0, 0。给出最终状态 Q = Q₃Q₂Q₁Q₀，用十进制数表示。
Q₃Q₂Q₁Q₀ = 11001, 0, 0, 0
Q =