National University of Singapore

Department of Mechanical Engineering

Tutorial : Digital Electronics 1. Prove the following identities ME 2143

a) b) c)

a b ab 1

a ba ba c a ba bb c
A B AB A B AB

abc abc a bc c a b

2.

Simplify (using Boolean Algebra)

a) b) c) d)

A B AB A B AB A B AB C A B AB C

Ams: a) 1; b) 0; c) C ; d) C

3.

a)

Minimize the expression

X AB AC BC
using i) Boolean Algebra ii) Karnaugh Map If the results are different, explain why the two approaches give different results. Implement the simplified expression in (a) using AND, NOT and OR gates. Implement the simplified expression in (a) using only NAND gates. What are the advantages, if any, of only using NAND gates?

b) c)

4. Design a logic circuit that has three inputs, A, B, and C and whose output will be high only when a majority of the inputs is high. Implement this circuit using only 7400 ICs (contain 2-input NAND gates).

5.

Design a circuit with three inputs A, B, C that provides a 0 output when an even number of its inputs are 1. Use XOR gates where possible.

tut_digital.doc

6. Use K-map to simplify the truth table below and design a circuit to implement the simplified expression. The Xs are dont care conditions and should be changed to 0 or 1 to produce the simplest expression.

A 0 0 0 0 1 1 1 1

B 0 0 1 1 0 0 1 1

C 0 1 0 1 0 1 0 1

Z 0 0 0 X X 1 1 1

7. Determine the minimized Boolean expressions required to convert from an EXCESS 3 BCD code to an ASBAK BCD code. The respective codes are given in the following table. DECIMAL NUMBER 0 1 2 3 4 5 6 7 8 9 EXCESS 3 BCD CODE W X Y Z 0 0 0 0 0 1 1 1 1 1 0 1 1 1 1 0 0 0 0 1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 0 1 0 ASBAK BCD CODE A B C D 0 1 0 1 0 1 0 1 0 1 0 0 1 1 0 0 1 1 0 0 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 0 0 1 1