UNIT I DIGITAL FUNDAMENTALS PART 1

12345678910
Across
  1. 4. 1’s complement can be easily obtained by using _________
  2. 5. A three digit decimal number requires ________ for representation in the conventional BCD format
  3. 6. The logical sum of two or more logical product terms is called __________
  4. 7. The K-map based Boolean reduction is based on the following Unifying Theorem: A + A’ = 1.
  5. 9. Maxterm is the sum of __________ of the corresponding Minterm with its literal complemented
Down
  1. 1. Each group of adjacent Minterms (group size in powers of twos) corresponds to a possible product term of the given ___________
  2. 2. The code where all successive numbers differ from their preceding number by single bit is __________
  3. 3. A Karnaugh map (K-map) is an abstract form of ____________ diagram organized as a matrix of squares.
  4. 8. A product term containing all K variables of the function in either complemented or uncomplemented form is called a __
  5. 10. _____________ expressions can be implemented using either (1) 2-level AND-OR logic circuits or (2) 2-level NAND logic circuits