 Readings: Chapter 1-8 (Berger)  Instructor: Rob Nash  Exam: Monday, Mar 11 th  Same time and place

 Aside: me with questions or your decided topic  A good percentage of your grade, and helps balance out exams  Paper + Presentation!

 2 hr exam  2-5 small questions  2-5 medium questions  2-4 large questions  Closed book & notes, calculators & translators allowed  Without storage, of course

 This will be on the message board  to be completed by Friday (should be final)

 We will likely do some or all of the following  Examine code for its output  Be asked to write code that accomplishes something  Loops, ifs  Memory checks  See examples today  Given code, what are the problems?  Given a Move or Add instruction in binary, identify the fields  I gave you a start on this with Move

 Specifically: ones compliment addition & hex  6 : 0110  -6: 1001  2: 0010   1011 (:-4)

 Discussion will be centered around topics covered in class  Gates  ISA  FlipFlops (SR, JK, MS, D)  Busses (Address & Memory & Status/Control)  PCs, Stack pointers  Memory paging  Register types  Address, Data, CCR

 Gates  Circuit diagrams (and/or corresponding tt)  Truth Tables  K-Maps  Given C  Given Asm  Given a Truth Table  provide the circuit diagram

 How much is addressable in the 68K?  What if we have 3 chips that are 128K x 8  What is the total addressable space  What if we want to address words and not bytes?

 Moores Law  Amdahl’s Law  DeMorgan’s Law  Know some basic Boolean Identities  Performance  Know nanosecond to hertz conversion

 I borrow from the homework a bunch.  Consider reviewing some of the homework topics that line up with the list here

 We’ll dive right into the OS book