Question
An algorithm partially named for this computer scientist is employed when there are too many variables to easily solve a Karnaugh map by hand. For 10 points each:
[10m] Name this computer scientist, who developed that Boolean minimization algorithm with Edward McCluskey.
ANSWER: Willard Van Orman Quine
[10h] The first step of the Quine-McCluskey algorithm involves finding these things, the terms of a Boolean function that cannot be removed without leaving some subset of the output uncovered.
ANSWER: prime implicants [prompt on implicants alone]
[10e] Douglas Hofstadter coined the term “quine” for a program that outputs this. This stuff is transformed by compilers and edited in programs like vim and Emacs.
ANSWER: its own source code
<DM>
Summary
| 2023 BHSU @ Northwestern | 02/25/2023 | Y | 5 | 12.00 | 80% | 40% | 0% |
Data
| Brownstein et al. | Northwestern | 0 | 0 | 10 | 10 |
| Chicago A | Illinois | 10 | 0 | 10 | 20 |
| Epic | Purdue | 0 | 0 | 10 | 10 |
| Amartya Senpai Notice Me | Michigan | 10 | 0 | 10 | 20 |
| Mojo Shojo | WUSTL | 0 | 0 | 0 | 0 |