Posted by chrislego88 on Sep 29, 2009 in
Basic Computer Engineering Concepts
TweetWhat are Karnaugh Maps used for? Karnaugh maps or K-maps for short are used for simplifying Boolean expressions. K-maps are constructed depending on the number of variables, or bits, in the expression. For example if the expression is f(A,B,C,D) = A + D, there areĀ 4 bits to consider. Before starting to construct the K-Map you [...]
Tags: Binary, Boolean expressions, K Maps, Karnaugh Maps, Truth Tables
TweetHow do binary numbers work? Binary numbers work exactly like our decimal system. It’s called Decimal because it has 10 total combinations per digit. For instance we count 0-1-2-3-4-5-6-7-8-9 which gives us 10 total numbers we can use in a single digit. When we run out of digits we add one to the leading digit [...]
Tags: Binary, counting in binary