Download CSC 323

CSC 323
Test 1 Study Guide
Test 1 will cover chapters 1, 2 and 3 of the Mano text as well as Labs 1, 2, and 3.
1. Know the operation, symbol, and truth table of the 8 basic digital logic gates.
2. Know the two symbols for the NAND gate and know why they are equivalent.
3. Know the two symbols for the NOR gate and know why they are equivalent.
4. Know the basic identities for Boolean algebra. Know trick used in simplifying – add
the same term that already appears in the function using the OR connective.
5. Be able to algebraically reduce a Boolean function.
6. Know DeMorgan’s Laws.
7. Given either the binary circuit, the Boolean function, or the truth table, be able to
generate the other two corresponding representations.
8. Which of the above representations in Problem #7 are unique?
9. Be able to apply K-map simplification process to a binary circuit.
10. Be able to obtain simplified SOP or simplified POS form of a binary circuit.
11. Be able to implement a binary circuit with just one type of gate (NAND or NOR).
12. What is a combinational circuit?
13. Be able to design a combinational circuit.
14. Know the half-adder circuit combinational circuit.
15. Know the full-adder combinational circuit.
16. In Lab 1, what did you find a disconnected input to be taken as, a zero or a one? How
did you decide this?
17. What voltage levels does the TTL family of chips use to represent the binary 0 and 1?
18. In a TTL 14-pin chip, what pin is typically connected to +5v and which pin is
typically connected to ground?
19. What fundamental gate is assigned the lowest number in the TTL family of chips?
What number is this? Why is the lowest number assigned to this gate?
20. What does it mean for a Boolean function to be in Normal Form?
21. What shorthand notations (two) have we used to represent a Boolean function?
22. What Boolean function did we wire up in Lab 2?
23. What Boolean function did we wire up in Lab 3?
24. Explain active-high and active-low inputs.
25. Explain active-high and active-low outputs.
26. Know operations of MUX and DEMUX
27. Know operation of Encoder and Decoder.
28. Know that DEMUX and Decoder are the same thing, just a different view.
29. Know how TRUE and FALSE are represented inside the digital computer.
30. Know base 2, 8, and 16 notation and how to convert from one to the other.
31. Be able to do binary addition and subtraction by hand.