Scribd
Upload
50 views

EE - 18 Introduction To Digital Computers Exam 1 Solution Fall, 1999 Prof. Traver

This document contains the solutions to an exam for a digital computers course. It includes 10 multiple choice problems covering topics like binary and hexadecimal conversion, Boolean algebra, Karnaugh maps, logic circuits, adders, decoders, multiplexors and more. The problems range from performing basic conversions to deriving truth tables and logic expressions to drawing circuit diagrams.

Uploaded by

Mujeeb Abdullah
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
50 views

EE - 18 Introduction To Digital Computers Exam 1 Solution Fall, 1999 Prof. Traver

This document contains the solutions to an exam for a digital computers course. It includes 10 multiple choice problems covering topics like binary and hexadecimal conversion, Boolean algebra, Karnaugh maps, logic circuits, adders, decoders, multiplexors and more. The problems range from performing basic conversions to deriving truth tables and logic expressions to drawing circuit diagrams.

Uploaded by

Mujeeb Abdullah
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

EE 18 Introduction to Digital Computers Exam 1 Solution Fall, 1999 Prof.

Traver

Name________Key______________________ Show all your work for all problems and clearly indicate your final answer. All problems are worth 10 points. 1. a. Convert the following decimal number to binary. 31.75 11111.11

b. Convert the following binary number to hexidecimal. 1100101000010101.111 CA15.E

2. Find the complement of the following expression and write it in sum of product form.

F = (A' + B)(B + C')D F' = AB' + B'C + D'

3. Find the function represented by a closed path from the top to bottom of the N-type transistor network below.

A:A

B:B

C:C

D:D

B':B'

(A + B)C(D + B')

4. Create a K-map for the following function. You do NOT have to minimize the function. F = A(B + C) + AB C AB 00 01 11 10 0 0 0 0 0 1 1 1 1 1

5. Find a minimum sum of product expression for the function G. G(A,B,C,D) =

m(2,3,4,5,12,13) + d(10,11,14,15)

G = BC' + B'C

6. Draw a NAND-NAND circuit for the following function. F = XY + XYZ X' Y


F
X Y' Z

7. a. Find the 8-bit signed-magnitude representation of 30. + 30 = 00011110 - 30 = 10011110

b. Find the 8-bit ones complement representation of 30. -30 = 11100001

c. Find the 8-bit twos complement representation of 30. -30 = 11100010

8. Write expressions for the functions that are implemented by the decoder and NAND gates below.

A B C

S2 S1 S0

F0 F1 F2 F3 F4 F5 F6 F7

G1

G2

G1 = A'B'C' + A'B'C = m0 + m1 G2 = A'BC + AB'C' + ABC' = m3 + m4 + m6

9. The circuit below is a 2-bit adder, constructed from two full-adders. Fill in the truth table for this circuit.

A1 A0 B1 B0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1

C2 0 0 0 0 0 0 0 1 0 0 1 1 0 1 1 1

S1 S0 0 0 0 1 1 0 1 1 0 1 1 0 1 1 0 0 1 0 1 1 0 0 0 1 1 1 0 0 0 1 1 0

A1

B1

A0 B0

B Cin

B Cin

Full Adder Cout S

Full Adder Cout S

C2

S1

S0

10. Implement the function F with the multiplexor shown below. Notice that the function is given in product of maxterm form. Hint: Draw the truth table for the function. F(X,Y,Z) =

M(0,2,4,5,7)

Z Z 0 Z'

I0 4 to 1 I1 MUX I2 F I3 S1 S0
X Y

You might also like