Scribd
Upload
374 views7 pages

Erik Demaine's Digital Systems Exam Solutions

This document contains sample solutions to a midterm exam for a digital systems course. The exam questions cover topics such as binary, octal, and hexadecimal number conversion; arithmetic operations using binary complement representations; Boolean algebra; logic gate implementations; and digital circuit design. The solutions show the step-by-step work for each problem, including conversions between number bases, arithmetic calculations, Boolean simplifications, logic diagrams, Karnaugh maps, and final circuit designs.

Uploaded by

Arnav Chaturvedi
Copyright
© © All Rights Reserved
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
374 views7 pages

Erik Demaine's Digital Systems Exam Solutions

This document contains sample solutions to a midterm exam for a digital systems course. The exam questions cover topics such as binary, octal, and hexadecimal number conversion; arithmetic operations using binary complement representations; Boolean algebra; logic gate implementations; and digital circuit design. The solutions show the step-by-step work for each problem, including conversions between number bases, arithmetic calculations, Boolean simplifications, logic diagrams, Karnaugh maps, and final circuit designs.

Uploaded by

Arnav Chaturvedi
Copyright
© © All Rights Reserved
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

ITI 1100: Digital Systems 1

SAMPLE MIDTERM EXAM SOLUTIONS

First Name:

Last Name:

Student Number:

1
Question 1

a. What is the largest binary number that can be expressed with 16 bits? What are the
equivalent decimal and hexadecimal numbers?

16-bit binary: 1111_1111_1111_1111


Decimal equivalent: 2^16 -1 = (65535)10
Hexadecimal equivalent: (FFFF)16

b. Convert (333)10 and (25.625)10 into binary, octal and hexadecimal.

(333)10 = (14D)16 = (515)8 = (101001101)2


(25.625)10 = (19.A)16 = (31.5)8 = (11001.101)2

c. Perform subtraction on the given unsigned decimal numbers by using the 10’s
complement. Where the result should be negative, find its 10’s complement and affix
a minus. Consider sign extension with 10s complement arithmetic. Show your work.

23 - 47

Note: Consider sign extension with 10s complement arithmetic.


023 + (10s complement) of 047 = 023 + 953 = 976 =
-(10s complement) of 976 = - 24

d. Perform subtraction on the given unsigned binary numbers by using the 2’s
complement. Where the result should be negative, find its 2’s complement and
affix a minus. Consider sign extension with 2s complement arithmetic. Show
your work.

1001 – 110101

Note: Consider sign extension with 2s complement arithmetic.


01001 + (2s compl) of 0110101 = 0001001 + 1001011 = 1010100 = -(2s compl)
of 1010100 = - 0101100 = -44

2
Question 2

Determine the base of the numbers in each case for the following operations to be
correct:

a. 20/3=6

2b+0 /3 = 6 so b = 9

b. 12+24=40

b+2 + 2b+4 = 4b so b = 6

c. 12*13=211

(b+2)(b+3) = 2b2 + b +1 so b = 5

3
Question 3

Simplify the following Boolean expressions to a minimum number of literals:

a. (x+y)’(x’+y’)

x’y’

b. (a' + c')(a + b' + c')

a’b’ + c’

c. x’yz + xz

xz + yz

Question 4

Simplify the following expressions to (1) sum-of-products and (2) products-of-sums:

x'z' + y'z' + yz' + xy

SOP : z’+ xy

POS: (z’+x)(z’+y)

4
Question 5

Draw the logic diagram corresponding to the following Boolean expressions by using
NAND and NOR gates without simplifying them:

a. (AB + A'B')(CD' + C'D)

given in the assignment and your past tutorial

b. A + CD + (A + D')(C' + D)

5
Question 7

a. Convert the following Boolean function from a sum-of-products form to a simplified


product-of-sums form.

F(w,x,y,z) = ∑(0,1,2,5,8,10,13)

Draw the KMAP for F and find a simplified form for F’ (complement of F) by using
the 0’s. Then find the complement of F’ which yields F in a POS form.

b. Simplify the following function and implement them with two-level NOR gate
circuits:

F(w,x,y,z) = ∑(0,3,12,15)

Simplify F in POS form and then draw cicuit with two-vele NOR gates.

6
Question 8

Design a 4-bit circuit with 2 outputs A and B. A is 1 if the input is divisible by 2 and B is
1 if the input is divisible by 3. Simplify A and B and implement the circuit.

W X Y Z A B
0 0 0 0 1 1
0 0 0 1 0 0
0 0 1 0 1 0
0 0 1 1 0 1
0 1 0 0 1 0
0 1 0 1 0 0
0 1 1 0 1 1
0 1 1 1 0 0
1 0 0 0 1 0
1 0 0 1 0 1
1 0 1 0 1 0
1 0 1 1 0 0
1 1 0 0 1 1
1 1 0 1 0 0
1 1 1 0 1 0
1 1 1 1 0 1

Draw KMAP for A and B and simplify them and then draw circuit

You might also like