Description
Boolean Arithmetic
| 1. Given the following Truth Table | a) Write the function in its canonical form |
| b) Draw the K-Map of the function | |
|
|
c) Write the function in its simplified form |
| d) What is the difference in the number of gates used between canonical and simplified forms? | |
| 2. Given the following Truth Table | a) Write the function in its canonical form |
| b) Draw the K-Map of the function | |
|
|
c) Write the function in its simplified form |
| d) What is the difference in the number of gates used between canonical and simplified forms? | |
| 3. Given the following Truth Table | a) Write the function in its canonical form |
| b) Draw the K-Map of the function | |
|
|
c) Write the function in its simplified form |
| d) What is the difference in the number of gates used between canonical and simplified forms? | |
Converting between Binary and Decimal Numbers
| 4. Convert 11100012 to decimal (base 10)
Use sum of expansion of products (don’t skip steps!) |
| 5. Convert 110111002 to decimal (base 10)
Use sum of expansion of products (don’t skip steps!) |
Converting between Decimal and Binary Numbers
| 6. Convert 3510 to binary (base 2)
Use the Double-Dabble method of successive division (don’t skip steps!) |
| 7. Convert 11110 to binary (base 2)
Use the Double-Dabble method of successive divsion (don’t skip steps!) |
Adding Unsigned Binary Numbers
| 8. Add 7 + 5 in binary.
First convert to binary, then compute the sum.
|
Adding Signed Binary Numbers (with Negatives)
| 9. Add 7 + (-5) in binary. Same as subtraction.
First convert to binary, then compute the sum.
|
Multiplexor (Mux) Design
| 10. Write the Boolean function for the output (out). Use K-maps if needed. Then write the HDL code. | |
| out(a,b,sel) = | |
| CHIP Mux {
IN a, b, sel; OUT out;
PARTS:
} |
|
Demultiplexor (DMux) Design
| 11. Write the Boolean function for the output (out). Use K-maps if needed. Then write the HDL code. | |
|
a(in, sel) =
b(in, sel) = |
|
| CHIP DMux {
IN in, sel; OUT a, b;
PARTS:
} |
|
