Scribd
Upload
6 views7 pages

Sample1 Midterm

The document is a sample midterm exam for ITI 1100: Digital Systems 1, containing various questions related to binary numbers, Boolean expressions, and circuit design. It includes tasks such as converting numbers between different bases, simplifying Boolean expressions, and designing logic circuits. The exam assesses students' understanding of digital systems concepts and their ability to apply them in practical scenarios.

Uploaded by

Maysam Jaber
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
6 views7 pages

Sample1 Midterm

The document is a sample midterm exam for ITI 1100: Digital Systems 1, containing various questions related to binary numbers, Boolean expressions, and circuit design. It includes tasks such as converting numbers between different bases, simplifying Boolean expressions, and designing logic circuits. The exam assesses students' understanding of digital systems concepts and their ability to apply them in practical scenarios.

Uploaded by

Maysam Jaber
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

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?

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

c. 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

2
Question 2

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

a. 20/3=6

b. 12+24=40

3
Question 3

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

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

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

c. x’yz + xz

Question 4

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

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

4
Question 5

Draw the logic diagram corresponding to the following Boolean expression by using
NAND gates without simplifying it:

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

Question 6

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)

5
Question 7

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.

6
Question 8

a. Given the following Boolean function

F(A,B,C) = m(0,3,4,7)

Implement the function F with a decoder (use a block diagram for the decoder) (with
required number of inputs) only.

b. Given the following Boolean function

F(A,B,C) = m(0,1,3,6)

Build the truth table and implement the function F using a 4-to-1 multiplexer

You might also like