CSC 211: Exam 1

CSC 211 - Computer Organization and Architecture - Weinman

1  Learning Outcomes

1. Calculate current, resistance, or voltage on simple circuits using Ohm's and/or Kirchoff's laws
2. Describe the difference in behaviors between PNP and NPN transistors
3. Implement a simple logic function (i.e., gates) in a circuit from either PNP or NPN transistors, using pull-up and/or pull-down resistors appropriately
4. Translate descriptions of logical problems to truth table representations
5. Translate between truth tables and boolean logic formulas
6. Write a boolean logic formula in the sum-of-products representation
7. Reduce a boolean logic function using boolean laws and Karnaugh maps
8. Implement boolean logic in a circuit with logic gates (AND, OR, NOT, XOR, XNOR, etc.)
9. Calculate the gate delay and truth table of a combinational logic circuit
10. Construct a PLA from a sum-of-products representation
11. Know when and how to use decoders and multiplexors to solve logic problems
12. Convert numbers between decimal, hexadecimal, and binary (using twos complement representation)
13. Calculate using powers of two up to 12
14. Calculate using SI the prefixes giga-, mega-, kilo-, milli-, micro-, and nano- with respect to time
15. Calculate using quantities given in kibibytes, mebibytes, and gibibytes
16. Add and subtract numbers in binary
17. Identify when an addition causes overflow
18. Construct and operate an N-bit ALU (including control elements and overflow detection)
19. Complete the characteristic table for a sequential logic circuit, including S-R latches, D latches, and D flip-flops
20. Complete a sequential circuit timing diagram
21. Use a register file to store and retrieve data
22. Describe the bus, decoder, and multiplexor sizes for a given SRAM or DRAM configuration

2  Study Problems

Appendix B

1-2, 5-15, 17, 35-36, 39