# Search results

**Create the page "Karnaugh map" on this wiki!** See also the search results found.

- The Karnaugh map, also known as a Veitch diagram (K-map or KV-map for short), is a tool to facilitate management of Boolean algebraic expressions. A Karnaugh15 KB (2,070 words) - 10:31, 19 July 2016
- Lecture, Digital Logic Gates Lecture, Combinatorial Functions Lecture, Karnaugh Map Reductions Lecture, Arithmetic Lecture, Flip-flops Mid-term Exam Lecture167 bytes (26 words) - 22:26, 5 September 2008
- CMOS Lecture 3, Combinatorial Functions Basic logic gates Lecture 4, Karnaugh Map Reductions Lecture 5, Arithmetic Half Adder, Full Adder Lecture 6, Flip-flops8 KB (198 words) - 19:37, 21 May 2016
- Lecture, Digital Logic Gates Lecture, Combinatorial Functions Lecture, Karnaugh Map Reductions Lecture, Arithmetic Lecture, Flip-flops Mid-term Exam Lecture6 KB (560 words) - 09:48, 19 July 2016
- Algebra Logic Gates and Symbols Minimization and Implementation with Karnaugh Maps Adders, Subtracters, Multipliers, and Comparators Multiplexers, Encoders27 KB (294 words) - 01:19, 7 May 2016
- order to understand some of the notation used within this article. A Karnaugh Map makes simplification of truth tables into functions much easier, but2 KB (414 words) - 10:18, 11 July 2012
- Lecture, Digital Logic Gates Lecture, Combinatorial Functions Lecture, Karnaugh Map Reductions Lecture, Arithmetic Lecture, Flip-flops Mid-term Exam Lecture13 KB (2,238 words) - 09:48, 19 July 2016
- 11 KB (1,403 words) - 16:18, 21 April 2016
- Simplification of functions using Karnaugh map and Quine McCluskey methods, Variable Entered Mapping, Minimization and combinational design, Combinational985 bytes (118 words) - 20:41, 20 April 2016