CSC 211: Exam 1

CSC 211 - Computer Organization and Architecture - Weinman

1  Learning Outcomes

• Calculate current, resistance, or voltage on simple circuits using Ohm's law
• Describe the difference in behaviors between PNP and NPN transistors
• Implement a simple logic function in a circuit from transistors, using pull-up and/or pull-down resistors appropriately
• Translate descriptions of logical problems to truth table representations
• Translate between truth tables and boolean logic formulas
• Write a boolean logic formula in the sum-of-products representation
• Reduce a boolean logic function using boolean laws and Karnaugh maps
• Implement boolean logic in a circuit with logic gates (AND, OR, NOT, XOR, XNOR, etc.)
• Calculate the gate delay and truth table of a combinational logic circuit
• Construct a PLA from a sum-of-products representation
• Know when and how to use decoders and multiplexors to solve logic problems
• Convert numbers between decimal, hexadecimal, and binary (using twos complement representation)
• Calculate using powers of two up to 12
• Calculate using SI the prefixes giga-, mega-, kilo-,milli-, micro-, and nano- with respect to time
• Calculate using quantities given in kibibytes, mebibytes, and gibibytes
• Add and subtract numbers in binary
• Identify when an addition causes overflow
• Construct and operate an N-bit ALU (including control elements and overflow detection)
• Complete the characteristic table for a sequential logic circuit, including S-R latches, D latches, and D flip-flops
• Complete a sequential circuit timing diagram
• Use a register file to store and retrieve data
• 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