It’s always a good idea to know your binary numbers, but you can also use the binary numbers reference in the exam.
- Data representation — signed and unsigned
- Binary logic operations — NOT, AND, OR, NAND, NOR
- Combinational logic gates
- Flip-flops & memories
- Finite state machines
- If you are given a table or mesh showing a finite state machine at the logical or binary level, you should be able to write the state transitions and output generated while processing an input sequence. Examples of state machines include the TCP connection finite state machine or this simpler example.
The most significant topics to study is anything covered in the first five homeworks.
Handy tables and reference sheets
Exams from this semester
Exams from Fall 2012
Exams from Fall 2010
Exams before Fall 2010
A different textbook was used before the Fall 2010 semester. With the exception of the first exam, these exams are not particular relevant to this semester.