Scribd
Upload
27 views

Tutorial 01

This document provides a tutorial on digital electronics concepts including: 1) Converting binary and decimal numbers 2) Identifying appropriate Boolean logic operations 3) Drawing truth tables and converting Boolean equations to logic circuits It contains 20 problems covering additional topics like Boolean algebra, Karnaugh maps, and converting analog to digital signals.

Uploaded by

Device Samsung
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
27 views

Tutorial 01

This document provides a tutorial on digital electronics concepts including: 1) Converting binary and decimal numbers 2) Identifying appropriate Boolean logic operations 3) Drawing truth tables and converting Boolean equations to logic circuits It contains 20 problems covering additional topics like Boolean algebra, Karnaugh maps, and converting analog to digital signals.

Uploaded by

Device Samsung
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

EN 33001 Digital Electronics Tutorial 01

1. Convert the following binary numbers to decimal numbers:


a. 100
b. 1011
c. 0000000000001
d. 111111

2. Which Boolean operation, AND, OR or NOT, is appropriate for each of the following:
a. Detecting motion in any motion sensor surrounding a house (each motion
sensor outputs 1 when motion is detected).
b. Detecting that three buttons are being pressed simultaneously (each button
outputs 1 when a button is being pressed).
c. Detecting the absence of light from a light sensor (the light sensor outputs 1
when light is sensed).

3. Draw the truth table for the following function


F= ab + c + d

4. Convert each of the following equations directly to gate-level circuits


a. F = ab’ + bc + c’
b. F = ab + b’c’d’
c. F = ((a + b’) + (c’ + d)) + (c + d + e’)

5. For the function F = a + a’b + acd + c’


a. List all the variables.
b. List all the product terms.

6. For the function F = a’d’ + a’c + b’cd’ + cd


a. List all the variables.
b. List all the product terms.

7. Use algebraic manipulation to convert the following equation to sum-of-products


form: F = a(b + c)(d’) + ac’(b + d)

8. Use DeMorgan’s Law to find the inverse of the following equations.


Reduce to sum-of-products form.
a. F = abc+a’b’ Hint: Start with F’ = (abc + a’b)’
b. F = ac’ + abd’ + acd.

9. Convert the following Boolean equations to a digital circuit:


a. F(a,b,c) = a’bc + ab
b. F(a,b,c) = a’b
c. F(a,b,c) = abc + ab + a + b + c
d. F(a,b,c) = c’

1
EN 33001 Digital Electronics Tutorial 01

10. Create a Boolean equation representation of the digital circuit shown below:

11. Convert each of the following Boolean equations to a truth table:

a. F(a,b,c) = a’ + bc’
b. F(a,b,c) = (ab)’ + ac’ + bc
c. F(a,b,c) = ab + ac + ab’c’ + c’
d. F(a,b,c,d) = a’bc + d’

12. Express the Boolean function F as a sum of minterms.


a. F = A’B’C + AB’C + AB’C + ABC’ + ABC

13. Convert the function F shown in the truth table to an equivalent Boolean equation.

14. Use algebraic manipulation to minimize the equation obtained

15. Create a Boolean equation representation for the digital circuit

16. Determine whether the Boolean function G = a’b’c + ab’c + abc’ + abc is equivalent
to the function represented by the circuit.

2
EN 33001 Digital Electronics Tutorial 01

17. Draw the truth table for the function F given as sum of minterms.

F (A, B, C, D) = Sum (0, 1, 2, 5, 8, 9, 10)

a. Find Sum of Products using K Map


b. Provide the gate-level implementation of the simplified expression

18. For the provided truth table provide


a. F in sum of minterms form.
b. Find the Simplified sum of products for F (Hint: Use the K Map)

19. Suppose an analog audio signal comes in over a wire, and the voltage on the wire can range
from 0 Volts (V) to 3 V. You want to convert the analog signal to a digital signal. You decide
to encode each sample using two bits, such that 0 V would be encoded as 00, 1 V as 01, 2
V as 10, and 3 V as 11. You sample the signal every 1 millisecond and detect the following
sequence of voltages:
0V 0V 1V 2V 3V 2V 1V.

Show the signal converted to digital as a stream of 0s and 1s.

20. Encode the following words into bits using the ASCII encoding table.
a. LET
b. RESET!
c. HELLO $1

You might also like