Name: Yasser Cabrera  CST 111 Exam #1                    3/20/11

1- b)104 base 8
   c)7B base 16
   d)10001
   e)11
   f)21
   g)11 base 16 = 102 base 3, 
     21 base 8  = 210 base 9
   h)11 base 16 = 12 base 9
     21 base 8  = 23 base 9
2-            Decimal  Hex  Octal  Binary   
   First : Y    89      59   131   01011001
   Middle: C    67      43   103   01000011
   Last  : A    65      41   101   01000001

3-           OldDec  NewDec  ASCII  Hex    Binary    Complement
   X = a-5   89-5     84       T     54   01010100    10101011
   Y = B+10  67+10    77       M     4D   01001100    10110011
   Z = C+32  65+32    97       a     61   01100001    10011110

4-    Complement  Ones-comp  Twos-comp  Sign-magn  Offset-128
   X'  10101011      84         85         171        171
   Y'  10110011      76         77         179        179
   Z'  10011110      97         98         158        158

5- a) Pink
   b) Yellow
   c) Red
   d) White
   e) Magenta
   f) Green
   g) It would be the same color, since all number are going to change.  

6- a) 15 Bits
   b) They all have the same amount of bits
   c) 29 Bits
   d) They all have the same amount of bits
   e) 1,048,576
   f) 2,097,152
   g) 35 Bits

7- a) 300,000,000,000
   b) 5,000,000,000
   c) 50,000,000,000
   d) 3GHz (3 billion cycle per second)
   e) 1MHz (1 million cycle per second)

8- R = AB + c' + BC
   
          Truth Table
   A  B  C  AB  BC  C'  AB+C'  R
   0  0  1  0   0   0    0     0
   0  1  0  0   0   1    1     1
   1  0  1  0   0   0    0     0 
   1  1  0  1   0   1    1     1

9-       Sum = A xor B xor C
   Carry-out = AB + (A xor B)C

10- DeMorgan's Law don't apply for those expressions
 
11- Because the collections of gates, or complete circuits, are often embedded into a single integrated circuit, or chip, which we call Central Processing Unit (CPU)