[go: up one dir, main page]
Scribd
Upload
55 views7 pages

Asufra, FermoJrB ProfElec1 FinalProject

The document is the final examination for a course on logic design and digital circuits. It contains 4 questions: 1. Simplify Boolean expressions using K-maps, including expressions F(x,y,z)=yz'+xy+x'z' and F(x,y,z)=yz'+x'z+yz. 2. Simplify Boolean functions of 4 variables using K-maps, including F(w,x,y,z)=xz'+w'y'z+wxy and F(w,x,y,z)=wy+w'y'z+x'y'z. 3. Simplify Boolean functions with 5 variables by

Uploaded by

FJ Asufra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
55 views7 pages

Asufra, FermoJrB ProfElec1 FinalProject

The document is the final examination for a course on logic design and digital circuits. It contains 4 questions: 1. Simplify Boolean expressions using K-maps, including expressions F(x,y,z)=yz'+xy+x'z' and F(x,y,z)=yz'+x'z+yz. 2. Simplify Boolean functions of 4 variables using K-maps, including F(w,x,y,z)=xz'+w'y'z+wxy and F(w,x,y,z)=wy+w'y'z+x'y'z. 3. Simplify Boolean functions with 5 variables by

Uploaded by

FJ Asufra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Republic of the Philippines

BOHOL ISLAND STATE UNIVERSITY


Balilihan Campus
Magsija, Balilihan, Bohol

Vision: A premier S & T university for the formation of world class and virtue-laden human resource for sustainable
development in Bohol and beyond.
Mission: Committed to provide quality and innovative education in strategic sectors for the development of Bohol
and the Country.

COLLEGE OF TECHNOLOGY AND ALLIED SCIENCES


First Semester - A.Y. 2020 - 2021
Prof Elec 1- Logic Design and Digital Computer Circuits
Final Examination
February 1-5, 2020

Name: FERMO JR. B. ASUFRA Date: FEBRUARY 3, 2021


Course & Year: BSIT- 3 Instructor: DR. BENJAMIN N. OMAMALIN, CoE.

I. Gate Level Minimization

1. Simplify the following Boolean expression using the three variable K-maps and
draw their schematic diagram.

a.yz F(x,y,z) = ∑(0,2,6,7) x y z


x
I1= yz’
I2= xy •
00 01 11 10 •
0 1F=0I1 +0 I2 1+ I3 I3= x’z’ •
• yz'
•
•
1 0 0 1 1 xy F

x'y'

x
yz F= yz' + xy + x'z'
I1= yz’
I2= x'z
b. F(x,y,z) = ∑(1,2,3,6,7)
I3= yz x •y z•

•
00 01 11 10 •
0 0F=1I1 +1 I2 1+ I3 yz'
1 0 0 1 1 •
• x'z F

yz
F= yz' + x'z + yz

2. Simplify the following Boolean functions using 4-variable K-map and draw its
schematic diagram.

a. F(w,x,y,z) = ∑(1,4,5,6,12,14,15) w x y z
yz
wx 00 01 11 10
00 0 1 0 0 xz'
01 1 1 0 1
•
I1= xz’ •
11 1 0 1 1 w'y'z F
I2= w'y'z
10 0 0 0 0 I3= wxy •
• • wxy
•
F= I1 + I2 + I3 •
•
F= xz' + w'y'z + wxy

b. F(w,x,y,z) = ∑(1,5,9,10,11,14,15) w x y z
yz
wx
00 01 11 10
00 0 1 0 0 wy
•
01 0 1 0 0 I1= wy •
11 0 0 1 1 I2= w'y'z
w'y'z F
I3= x'y'z •
•
10 0 1 1 1 •

• x'y'z
F= I1 + I2 + I3 •
•
F= wy + w'y'z + x'y'z

3. Simplify the following Boolean functions by finding the essential prime implicants.

a. F(v,w,x,y,z) = ∑(0,2,7,8,9,10,12,13,14,15,17,18,20,21,27,28,29,30)
yz
wx 00 01 11 10

00 0 0
1 1
I1= v'x'z'
0 1 0 1
01 0 0 1 0 I2= v'wy'
1 1 0 0 I3= wxz'
I4= vxy'
11 1 1 1 1 I5= vw'x'yz'
I6= v'xyz
1 1 0 1
I7= vw'y'z
10
1 1 0 1
I8= vwx'yz
0 0 1 0
F= I1 + I2 + I3 + I4 + I5 + I6 + I7 + I8
F= v'x'z' + v'wy' + wxz' + vxy' + vw'x'yz' + v'xyz + vw'y'z + vwx'yz

v w x y z

• v'x'z'
• •

• • v'wy'
•
• • wxz'
•
• •
•
• vxy'
• • • •
F
• vw'x'yz'
•
• •
v'xyz
• • •
•
•
vw'y'z
• •
• • • • •
vwx'yz

wx F(v,w,x,y,z) = vwx + v’yz + x’y’z’ + xyz + vyz + vwx


yz
b.
1 0 1 0
000 01 0 111 10 0 I1= v'w'x'y'z'
0 0 0 0 I2= w'x'yz
00
0 0 1 0 I3= vw'yz
I4= vwxy'
0 0 0 0
01
1 1 0 0 F= I1 + I2 + I3 + I4
0 0 0 0
11 0 0 0 0

F= v'w'x'y'z' + v'w'yz + vw'yz + vwxy'


10

4. Simplify the following Boolean functions together with the don’t care conditions d
and draw its schematic diagram
yz
x •
a. F(x,y,z) = ∑(2,3,4,6,7) x
•
y z
F= 1 / F=x'y+xz'+xy
d ( x,y,z) = ∑(0,1,5)
•
•
00 01 11 10
•
•
0 x x 1 1
F
1 1 x 1 1 F= ∑(0,1,2,3,4,5,6,7)

AB F(A,B,C,D) = ∑(0,6,8,13,14)
b.CD

d (A,B,C,D) = ∑(2,4,10) A B• C D
•
I1= B'D'
00 01 11 10 I2= CD' •
•
I3= ABC'D
00 1 0 0 x • B'D'
• • •
01 x 0 0 1
CD' F
11 0 B'D'
F= 1 +0 CD'
1 + ABC'D
10 1 0 0 x ABC'D

F= ∑(0,2,6,8,10,13,14)

5. Design at least 3 functions of the BCD code conversion to Seven Segment Display.

a a a a

b f b b f
f g g g

e c e c e e c

d d d d
Binary Pattern Individual Segments
Octal A B C Display
a b c d e f g
4 2 1
0 0 0 0 1 1 1 1 1 1 0 0
1 0 0 1 0 1 1 0 0 0 0 1
2 0 1 0 1 1 0 1 1 0 1 2
3 0 1 1 1 1 1 1 0 0 1 3
4 1 0 0 0 1 1 0 0 1 1 4
5 1 0 1 1 0 1 1 0 1 1 5
6 1 1 0 1 0 1 1 1 1 1 6
7 1 1 1 1 1 1 0 0 0 0 7
Republic of the Philippines
BOHOL ISLAND STATE UNIVERSITY
Balilihan Campus
Magsija, Balilihan, Bohol

Vision: A premier S & T university for the formation of world class and virtue-laden human resource for sustainable
development in Bohol and beyond.
Mission: Committed to provide quality and innovative education in strategic sectors for the development of Bohol
and the Country.

COLLEGE OF TECHNOLOGY AND ALLIED SCIENCES


First Semester - A.Y. 2020 - 2021
Prof Elec 1- Logic Design and Digital Computer Circuits
Final Project

Name: FERMO JR. B. ASUFRA Date: FEBRUARY 2, 2021


Course & Year: BSIT- 3 Instructor: DR. BENJAMIN N. OMAMALIN, CoE.

I. Design your own BCD Code Decoder and Provide the Truth Table, Karnaugh Map
and Schematic Diagram.
a a a

b b f b
f g g g

e c e c e e

d d d d

Binary Pattern Individual Segments


Decimal A B C D Display
Fa Fb Fc Fd Fe Ff Fg
8 4 2 1
0 0 0 0 0 1 1 1 1 1 1 0 0
1 0 0 0 1 0 1 1 0 0 0 0 1
2 0 0 1 0 1 1 0 1 1 0 1 2
3 0 0 1 1 1 1 1 1 0 0 1 3
4 0 1 0 0 0 1 1 0 0 1 1 4
5 0 1 0 1 1 0 1 1 0 1 1 5
6 0 1 1 0 1 0 1 1 1 1 1 6
7 0 1 1 1 1 1 1 0 0 0 0 7
8 1 0 0 0 1 1 1 1 1 1 1 8
9 1 0 0 1 1 1 1 1 0 1 1 9
10-A 1 0 1 0 1 1 1 1 1 0 1 a
11-B 1 0 1 1 0 0 1 1 1 1 1 b
12-C 1 1 0 0 0 0 0 1 1 0 1 c
13-D 1 1 0 1 0 1 1 1 1 0 1 d
14-E 1 1 1 0 1 1 0 1 1 1 1 e
15-F 1 1 1 1 1 0 0 0 1 1 1 F
Truth Table

* K- Map for Fa A B C D

CD 00 01 11 10
AB
1 0 1 1 B'D'
00 •
•
Schematic
I1= B'D'
01 0 1 1 1 I2= A'C •
A'C Diagram
I3= BC •
11 0 0 1 1 BC
I4= A'BD • Fa
10 1 1 0 1 I5= AB'C' •

• A'BD
•
•
Fa= I1 + I2 + I3 + I4 + I5 AB'C'
•
Fa= B'D' + A'C + BC +A'BD +AB'C' •
•

* K- Map for Fb A B C D

CD 00 01 11 10
AB
1 1 1 1 A'B'
00 I1= A'B' •
•
Schematic
I2= B'C'
01 1 0 1 0 •
B'C' Diagram
I3= A'C'D' •
11 0 1 0 1 I4= A'CD A'C'D'
I5= AC'D •
1 1 0 1 •
10
I6= ACD'
• Fb
• A'CD
• •
Fb= I1 + I2 + I3 + I4 + I5 + I6 AC'D
•
Fb=A'B'+B'C'+A'C'D'+A'CD+AC'D+ACD' • •
• ACD'
• •

* K- Map for Fc A B C D

CD 00 01 11 10
AB
1 1 1 0 A'C'
00 I1= A'C' • Schematic
I2= A'D •
01 1 1 1 1 A'D Diagram
I3= C'D •
11 0 1 0 1 I4= AB' •
C'D
I5= BCD' •
Fc
10 1 1 1 1 •
AB'
•
Fc = I1 + I2 + I3 + I4 + I5 •
BCD'
Fc = A'C' + A'D + C'D + AB' + BCD' •
• •

* K- Map for Fd A B C D

CD 00 01 11 10
AB
1 0 1 1 B'D'
00 I1= B'D' • Schematic
I2= BC' •
01 0 1 0 1 BC' Diagram
I3= CD' •
•
11 1 1 0 1 I4= AC' CD'
I5= BC'D Fd
•
10 1 1 1 1 •
AC'
•
Fd = I1 + I2 + I3 + I4 + I5 •
BC'D
•
Fd = I1 + I2 + I3 + I4 + I5
BC'D
Fd = B'D' + B'C + CD' + AC' + BC'D •
• •

* K- Map for Fe A B C D

CD
AB 00 01 11 10
00 1 0 0 1 • B'D' Schematic
I1= B'D' •
01 0 0 0 1 I2= A'CD' Diagram
• A'CD'
1 1 1 0 I3= ACD •
11 • Fe
I4= ABC'
10 1 0 1 1 • ACD
• •

Fe = I1 + I2 + I3 + I4 • •
ABC'
•
Fe= B'D' + A'CD' + ACD + ABC'

* K- Map for Ff A B C D

CD 00 01 11 10
AB
00 1 0 0 0 I1= A'C'D' • A'C'D' Schematic
I2= A'BC' • •
01 1 1 0 1 I3= BCD' A'BC' Diagram
• •
11 0 0 1 1 I4= AB'C' • BCD'
I5= ACD •
Ff
10 1 1 1 0 •
•
AB'C'
•
•
Ff = I1 + I2 + I3 + I4 + I5 •
ACD
Ff = A'C'D' + A'BC + BCD' + AB'C+ ACD • • •

* K- Map for Fg A B C D

CD
AB 00 01 11 10
00 0 0 1 1 • A Schematic
I 1= A
01 1 1 0 1 I2= B'C Diagram
• B'C
1 1 1 1 I3= CD'
11 • Fg
I4= BC'
10 1 1 1 1 • CD'
•

Fg = I1 + I2 + I3 + I4 BC'
•
Fg = A + B'C + CD' + BC'

You might also like