UNIVERSITY AT BUFFALO, THE STATE UNIVERSITY OF NEW YORK
The Department of Computer Science & Engineering

For all problems involving math, please show your work. I won't be able to give you credit otherwise.

1. Consider the following sequence of memory cells in a computer: [9pts]
   
      10000001, 01000010, 00100100, 11111111, 00100100, 01000010, 10000001
   
   
   1. Suppose these are printed out one byte per line. If this were interpreted by a computer as a black and white bitmap image using the technique described in class (1 = black pixel, 0 = white pixel), what is this an image of?
   2. Suppose it is interpreted as a sequence of decimal numerals. What is that sequence?
   3. Suppose it is interpreted as a sequence of ASCII characters. What are those characters?
2. Show the truth table for and draw the circuit for (A ^ B) v (C ^ (A (+) B)) [6pts]
3. Read Rapaport, William J. (1985), "Turing Machines" [PDF], from Morton L. Schagrin, Randall R. Dipert, & William J. Rapaport, Logic: A Computer Approach (New York: McGraw-Hill, 1985): 327-339.