Question
These diagrams are used to minimize the number of logic gates on hardware systems. For 10 points each:
[10h] Name these diagrams consisting of Gray-coded truth tables that are used for manual implementation of the Quine–McCluskey algorithm. Grouping cells of these diagrams into implicants assists with Boolean minimization.
ANSWER: Karnaugh maps [accept K-maps or Karnaugh–Veitch maps; prompt on Marquand diagrams or Marquand–Veitch diagrams or Svoboda charts by asking "what is the more common name?"; prompt on KM]
[10m] The number of terms in a minterm group of a Karnaugh map is one of these numbers. In binary, these numbers are represented with precisely one digit set to one.
ANSWER: powers of two [accept two to the n]
[10e] The Karnaugh map representing this function is a two-by-two grid with only one zero cell, since this Boolean function asserts true when one or both of its inputs are true.
ANSWER: OR [accept OR gate]
<Science - Other Science - Computer Science>
Data
| Team | Opponent | Part 1 | Part 2 | Part 3 | Total |
|---|---|---|---|---|---|
| Detroit Catholic Central A | Hunter A | 0 | 0 | 10 | 10 |
| Fremd | Innovation Academy A | 0 | 10 | 10 | 20 |
| Lexington | Strake Jesuit A | 10 | 0 | 10 | 20 |
Summary
| Tournament | Edition | Exact Match? | Heard | PPB | Easy % | Medium % | Hard % |
|---|---|---|---|---|---|---|---|
| 2025 PACE NSC | 06/07/2025 | Y | 3 | 16.67 | 100% | 33% | 33% |