Review notes for the final exam. 
November 25, 2014.

Format:  Short answer, problem solving.   Possibly some multiple choice.
Time Limit:  2 Hours
Closed book, closed notes.  All computations will be simple and "exam clean".
That means no calculator is allowed.

Sources for short answer, multiple choice:
 1) "Questions from last week", 
 2) Reading assignments, 
 3) General comprehension from the text.
 4) Slides

Sources for problem solving:

 1) (Some) problems that appeared on the midterm.

 2) Reading assignments

 3) In class exercises:

  A) You should be able to understand simple Java wait/notify code.

  B) Given state machines for individual processes, you should be able to 
  form state machines for possible interleavings of those processes.

  C) You should be able to determine sequential consistency for an interleaving
  of reads and writes.

  D) You should be able to analyze results from a Byzantine agreement protocol,
  and decide who (if anyone) has failed (and what, if any, the final values are).

  E) Given a simple expression for message encryption and/or hashing, you 
  should be able to work out what is being sent, and what the consequences/
  guaranteess of that transmission are (both in terms of performance and in 
  terms of security).

  F) Given quality of service specifications you should be able to work out
  whether a given service configuration is satisfactory.