6. Control questions and tasks / Контрольні запитання і завдання
- Define a minterm and a maxterm of a row. State the polarity rule —
when is a variable complemented in each?
- How do you read the canonical DNF and the canonical CNF off a truth
table? Which rows does each use?
- Write the canonical DNF and the canonical CNF of the function that is 1 only on
the rows (1,1,0) and (0,0,1) (variables x,y,z).
- Why are canonical forms unique but usually not minimal?
The laws and algebraic minimization
- State the combining law and the absorption law. Which one removes a
variable, and which removes a whole term?
- Give the three steps of algebraic minimization (eliminate →; push ¬
inward; simplify). What is the method’s main weakness?
- Simplify xy∨xy∨xy using the laws to a
minimal DNF.
Karnaugh maps
- On a three-variable map, which cells are adjacent? Explain the
wrap-around (cylinder) adjacency and why the first and last columns group.
- A group of 2k cells eliminates how many variables? How do you read the
term of a group?
- State the rule for choosing groups to obtain a minimal DNF. How do you
instead obtain a minimal CNF from the map?
- Minimize f=xyz∨xyz∨xyz∨xyz∨xyz with a
Karnaugh map (this is Задача 1 — confirm f=y∨xz).
- On a four-variable map (rows xy, columns zt, both in Gray order), how
many cells can a single group contain, and which four cells does the
four-corners group combine? Minimize Variant 4 of Задача 4 and confirm
f=z∨xy∨yt.
Practical/Practical4/6questions.md · 1.9 KB · updated 2026-07-31 21:14