Name (PRINTED):
Student ID #:
Section # (or TA's:
name and time)

CMSC 250

Quiz #4

Wed., Feb. 15, 2006

Write all answers legibly in the space provided. The number of points possible for each question is indicated in square brackets - the total number of points on the quiz is 30, and you will have exactly 15 minutes to complete this quiz. You may not use calculators, textbooks or any other aids during this quiz.

1. [9 pnts.] Give the long form of the logic expression represented by the truth table below (the long form means that each of the lines containing a 1 should be represented as a different term in the disjunction). Then use only the rules presented on the ``cheat sheet'' to reduce the equation to an expression that would require the smallest number of gates. The draw the circuit that represents the reduced expression.

   p	q	r	Output
   1	1	1	1
   1	1	0	1
   1	0	1	0
   1	0	0	0
   0	1	1	1
   0	1	0	0
   0	0	1	0
   0	0	0	0

   Long form of the expression: Reduce the expression:
   

   #	Statement		Rule Used
   1
   2
   3
   4
   5
   6
   7

   Draw the Circuit:
   
   
   
   
   
   
   
   $\downarrow$ TURN OVER $\downarrow$
2. [6 pnts.] Translate the following to/from the bases indicated: Assume they should all be done assuming 8-bit 2's complement is the storage representation.
   • $1B_{16}$ = $_{10}$
   • $11001010_{2}$ =$_{10}$
   • $-35_{10}$ =$_{2}$
3. [15 pnts.] Prove the following using only the rules on the ``cheat sheet.''

   P1	$q \vee r$
   P2	$\sim m \rightarrow (n \wedge \sim p)$
   P3	$m \rightarrow x$
   P4	$p \vee (q \rightarrow r)$
   P5	$r \rightarrow p$
   	therefore $p \wedge m$

   #	Statement	Rule	Lines Used
   1
   2
   3
   4
   5
   6
   7
   8
   9
   10
   11
   12
   13
   14
   15
   16

Web Accessibility