Vous êtes sur la page 1sur 10

# Last (family) name: _________________________ First (given) name: _________________________ Student I.D.

## #: _____________________________ Circle section: Kim Hu

Department of Electrical and Computer Engineering University of Wisconsin - Madison ECE/CS 352 Digital System Fundamentals

Quiz #1
Thursday, September 26, 2002, 7:15 8:30 PM

Instructions:
1. Closed book examination. 2. No calculator, hand-held computer or portable computer allowed. 3. Five points penalty if fail to enter name, ID#, or instructor selection. 4. No one shall leave room during last 5 minutes of the examination. 5. Upon announcement of the end of the exam, stop writing on the exam paper immediately. Pass the exam to isles to be picked up by a TA. The instructor will announce when to leave the room. 6. Failure to follow instructions may result in forfeiture of your exam and will be handled according to UWS 14 Academic misconduct procedures.

Problem 1 2 3 4 5 Total

Points 15 15 25 20 25 100

Score

## ECE/CS 352 Quiz #1

2/6/03

1. (15 points) number representations and conversion (a) (3 points) Find a number in radix 5, which satisfy following: ( 31)10 = (

)5

(b) (6 points) Let r and s be two unknown positive integers, and w, x, y, z be four nonnegative integers such that 0 w, x r, and 0 y, z s. Suppose that the following base conversion holds true: ( w1.x ) r = ( y 2.z ) s Find equations that describe the relations between these integers.

## ECE/CS 352 Quiz #1

2/6/03

2. (15 points) arithmetic operations, binary code (a) (4 points) Find the binary representation of the following BCD number: 0101 1001 = ( )2 Answer:

(b) (11 points) Perform arithmetic operations in the following number representation. Indicate carries (for addition), borrows (for subtraction), and partial products (for multiplication) in addition to final answer. (3 points) Hexadecimal (3 points) Binary (5 points) Radix = 7

9 +

D E

F E

1 1 0 0 1 1 0 1 1 0

6 5 1 5

## ECE/CS 352 Quiz #1

2/6/03

3. (25 points) Boolean Algebra, Truth table, canonical forms (a) (5 points) Express the following Boolean function in product of Maxterm canonical form. f (a ,b ,c ,d ) = (b + c + d )( a + b + d )( a + c + d)

f (a ,b ,c ,d ) = M (

(b) (5 points) Express the following Boolean function in sum of min-term canonical form. f ( A , B ,C ) = ( A + B ) C + ABC . Solution:

f ( A , B ,C ) = m (

## ECE/CS 352 Quiz #1

2/6/03

(c) (8 points) Let f (x, y) be a two-variable Boolean function such that (i) f (x,y) y, and (ii) x + f (x , y ) = x + y Find THREE DIFFERENT possible solutions to f (x, y). Give your answer in sum-of-minterm canonical form. Hint : consider the Truth Table entries of x + f (x, y) x 0 0 1 1 y 0 1 0 1 f (x,y) x +f (x, y)

(d) (7 points) Proof the following identity algebraically. B + AC + AB = A + B + C There is no need to explicitly list the use of commutative law as it is used frequently. You may use all the Boolean identities listed at the end of this exam paper (page 10). You should not need more than the spaces provided. Boolean Expression B + AC + AB = Boolean Identity used

## ECE/CS 352 Quiz #1

2/6/03

4. (20 points) Boolean function realizations, K-Map (a) (5 points) Implement the following Boolean function using AND, OR, NOT logic gates. The logic diagram should correspond exactly to the equation. Assume the complements of Boolean variables are NOT available. DO NOT simplify or modify the Boolean expression. f (W , X , Y , Z ) = (WX + Y )( X + YZ )

(b) (5 points) Refer to the Boolean function f (W,X,Y,Z) in part (a). Draw the corresponding four variable K- map. Solution: WX\YZ 00 01 11 10 00 01 11 10

## ECE/CS 352 Quiz #1

2/6/03

(c) (10 points) The K-map of a Boolean function f (a,b,c,d ) is as follows: ab\cd 00 01 11 10 00 01 11 0 0 1 1 0 1 1 1 1 0 1 1

## ECE/CS 352 Quiz #1

2/6/03

5. (25 points) Systematic Boolean simplification (a) (7 points) Consider the Boolean function below: f (a ,b , c) = M ( 0,3,4,5) Identify ALL the prime implicants of f (a,b,c) using the tabular method. a b c a b c

(b) (10 points) A Boolean function f (a, b, c) is said to contain two essential prime implicants: ac and bc. The simplified sum-of-product expression of f (a,b,c) consists of exactly three product terms. Find two different possible solutions of this Boolean function, and give your answer in the product of maxterm format.

## ECE/CS 352 Quiz #1

2/6/03

(c) (8 points) A Boolean function g(w,x,y,z) consists of the following six prime implicants: y z , x z , w x y , x y , w x , w z Use a covering table, categorize these PIs into (i) essential PI(s), (ii) Less-than PI(s) (LTPI), or (iii) secondary essential PI(s) (SEPI). Answer: w x y z -- -- 0 0 -- 0 -- 0 0 0 1 --- 1 0 -1 1 -- -1 -- -- 0 0 2 3 4 5 8 10 12 13 14 15 PI category

2/6/03

## Basic Identities of Boolean Algebra

1. X + 0 = X 3. X + 1 = 1 5. X + X = X 7. X + X =1 9. X =X 10. X + Y = Y + X 11. X Y = Y X Commutative Law Associative Law 2. X 1 = X 4. X 0 = 0 6. X X = X 8. X X = 0

## Useful Boolean Identities

X + XY = X
XY + X Y = X X + XY = X + Y XY + X Z + YZ = XY + X Z

( X + Y )( X + Y ) = X Y + X Y

( X + Y )( X + Y ) = X

2/6/03

10