Scribd
Upload
8 views

Practice For Midterm

Uploaded by

best12380tsunderecbn
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
8 views

Practice For Midterm

Uploaded by

best12380tsunderecbn
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
You are on page 1/ 19

Digital Electronics

Practice for midterm exam


Outline
Below are common problems:
• Prob 1: Given the minterm expansion (standard SOP) or maxterm
expansion (standard POS) for a function F: simplify F using K-map
method and implement F just using NAND/NOR gates.
• Prob 2: Design a combinational logic circuit based on the
requirements.
• Prob 3: Proving Boolean equations.
• Prob 4: Analyze the combinational logic circuit and manipulate the
function to required form.
Problem 1: Given the minterm/maxterm expansion for a function
F: simplify F using K-map method and implement F just using
NAND/NOR gates.
Steps to solve:
• Step 1: Plot on a K-map (from 1 to 5 variables) (1 for minterm and 0 for
maxterm)
• Step 2: Determine all prime implicants
• Step 3: Determine essential prime implicants and forming the minimum
SOP/POS expression of F
• Step 4: Manipulate F to desired form (NAND/NOR..) using DeMorgan’s
laws, etc (2 ways)
Example:
Prob 2: Design a combinational logic circuit based on the
requirements.

Steps to solve the prob:

• B1: Determine input-output and encode them: usually using BCD8421


• B2: Construct the truth table
• B3: Plot the truth table on K-map to get the minimum SOP/POS form
• B4: Manipulate the function to desired form (NAND, NOR...) and
draw the circuit.
Example
Let’s encode
• Input: 4 bits abcd
o a represents the company: a = 0 => company A, a = 1 =>
company B
o bcd: represents type of containers, bcd = 000 - 111
corresponds to 7 types of container from 0 – 7
• Output: 2 bits F1F2 represents the number of floors from 0-3
=> We construct the truth table based on the rules
a b c d F1 F2
0 0 0 0 0 0
0 0 0 1 0 0
0 0 1 0 0 0
0 0 1 1 1 1
0 1 0 0 1 1
0 1 0 1 1 1
0 1 1 0 1 1
0 1 1 1 1 1
1 0 0 0 0 1
1 0 0 1 1 0
1 0 1 0 0 1
1 0 1 1 1 0
1 1 0 0 0 1
1 1 0 1 1 0
1 1 1 0 0 1
1 1 1 1 1 0
Prob 3: Proving Boolean equations.
Example:
Prob 4: Analyze the combinational logic circuit and
manipulate the function to required form.

Steps to solve:
• Step 1: Extract the function from the given circuit
• Step 2: Manipulate the function to required form
Example:
We have:
- Z1 = S'X + SY (1)
- Z2 = (cY)' (2)
- X = Si + c (3)
- Y = Ci (4)
- S = c (5)
- Si = a'b + ab’(6)
- Ci = ab (7)
=> From (1) (3) (4) (5) (6) (7) we have:
Z1 = S'X + SY
= c'(Si +c) + Ci.c = c'Si +Ci.c
= c'(a'b + ab') + abc = a'bc' + ab'c' + abc
= σ 𝑚(2,4,7)
=> From (2) (4) (7) ta có : Z2 = (cY)' = (c. Ci)' = (abc)' = a' + b' + c' =σ 𝑚(0,1,2,3,4,5,6)

You might also like