Everything from exam 1

Algorithms you should
* binary to decimal
* decimal to binary
* find smallest, largest, compute average.
* caesar cipher encryption/decryption
  (shift each letter by some fixed amount)
* testing if a number is prime.
  (test each possible factor up to square root of the number ...)

Everything in the memorize directory
* probably one of the programs that does loops.


New stuff...
* Arrays.  
  - Example: declare an array of 100 integers.
               int numbers[100];
             set the first 10 to be 0.
* for loopsl
  - 4 parts of a for loop
    for(initializer; condition; increment) {
      body
    }
* functions
  - define a new function
  - call new functions or existing ones.


Not on the test
* html, javascript