CS130 Homework 2 Spring ‘09

Due: Monday, Feb. 2nd, 2009

1. Write the Boolean expression in sum-of-products form for the function, F, represented by the truth table below.

F= ____________________________________________________

Inputs output

X Y Z | F

0 0 0 | 1

0 0 1 | 0

0 1 0 | 0

0 1 1 | 1

1 0 0 | 0

1 0 1 | 0

1 1 0 | 1

1 1 1 | 0

2. Simplify the following Boolean expression: F= AB’ + A’B + A’B’

Show the steps and state the rule used to simplify the expression.

3. Create a truth table for the circuit below: Use as many rows and columns as needed.

4. Draw a circuit for the following Boolean function. (Do not simplify)
   F(A,B,C) = (A+B’) (A + BC’)
   
   
   
   
   
   
   
   

5.  Write the decimal number, 25, using the 7-bit ASCII code. _____________________________________________________
   How many bits were required? ___
   
   
   
6. Write the decimal number, 25, as a twos complement number, using the least bits possible.____________________________
   
   
   
   
7. How many bytes are needed to store one hour of video in an uncompressed format if we assume that 30 frames per second are needed, the frame size is 1024 x 768 pixels, and the video is stored using 24bit graphics?