fardware & Architecture HW #7-100 Pts f= DCBA DEBA + PC BA + DC BA+ 2. (10 Pts) Derive an Un-simplified SOP Boolean expression for the Binary output DC BA+ + DCBA DCBA 3. (10 Pts) Simplify the SOP Boolean expression for the Binary output using a Karnaugh Map CP 9/0/0/01 0 1 L 10 SOP CD+ BBFABC Grouping COD=1 BD=W ABC=W 4. (20 Pts) Draw the logic circuit for the simplified Boolean expression for the Binary output. A ABC BD CD F= CB+BD+ ABC 5. (20 Pts) Implement the design using a 4 to 16 Decoder and logic gates, combining the "Yes" combinations into a single output and the "Maybe" combinations into another output 6. (20 Pts) Implement the design using a 1 to 16 Multiplexer. Only the "Yes" output needs to be represented by this implementation. 0 ware & Architecture HW #7 - 100 Pts Four individuals own a small corporation. The distribution of the corporate shares are as follows: Mr. Digital owns 4 shares Mrs. Chip owns 3 shares Mr. Boole owns 2 shares In this assignment you will design a voting machine that will be used when the owners vote on corporate issues. Each of the owners has a switch that is closed to record a 'yes' vote and opened to record a 'no' vote. example, when Mrs. Chip votes 'yes', her vote counts three times that of Ms. Adder. When one of the owners casts a 'yes' vote, the number of that owner's shares weights that vote. For - maybe a lighted LED? -- when the result The output of the voting machine will be a visual indication -- 1 of any vote is a 'yes' by the majority of the shareholders. In case of a tie, or the issue does not get a majority vote, the indicator LED will not light. 1. (20 Pts) Complete the following Truth Table Binary Mr. Digital D (4 Shares) Mrs. Chip (3 Shares) Mr. Boole (2 Shares) C B Ms. Adder (1 Share) A Total "Yes" Vote Shares Output 1=Yes Output Yes/No/Maybe 0=No/Maybe Janu D 0 1 010 1 0200 no 0 2 O-no D 3 - -no 0 6 Ono 0 4 0-no 0 0 6 |< Yes! 1 0 य no 5 be 0 6 Kyes 1 0 7. *Yes * Yes 8 Yes O = A 1 = A 9 K-Yes 10 K-Yes
fardware & Architecture HW #7-100 Pts f= DCBA DEBA + PC BA + DC BA+ 2. (10 Pts) Derive an Un-simplified SOP Boolean expression for the Binary output DC BA+ + DCBA DCBA 3. (10 Pts) Simplify the SOP Boolean expression for the Binary output using a Karnaugh Map CP 9/0/0/01 0 1 L 10 SOP CD+ BBFABC Grouping COD=1 BD=W ABC=W 4. (20 Pts) Draw the logic circuit for the simplified Boolean expression for the Binary output. A ABC BD CD F= CB+BD+ ABC 5. (20 Pts) Implement the design using a 4 to 16 Decoder and logic gates, combining the "Yes" combinations into a single output and the "Maybe" combinations into another output 6. (20 Pts) Implement the design using a 1 to 16 Multiplexer. Only the "Yes" output needs to be represented by this implementation. 0 ware & Architecture HW #7 - 100 Pts Four individuals own a small corporation. The distribution of the corporate shares are as follows: Mr. Digital owns 4 shares Mrs. Chip owns 3 shares Mr. Boole owns 2 shares In this assignment you will design a voting machine that will be used when the owners vote on corporate issues. Each of the owners has a switch that is closed to record a 'yes' vote and opened to record a 'no' vote. example, when Mrs. Chip votes 'yes', her vote counts three times that of Ms. Adder. When one of the owners casts a 'yes' vote, the number of that owner's shares weights that vote. For - maybe a lighted LED? -- when the result The output of the voting machine will be a visual indication -- 1 of any vote is a 'yes' by the majority of the shareholders. In case of a tie, or the issue does not get a majority vote, the indicator LED will not light. 1. (20 Pts) Complete the following Truth Table Binary Mr. Digital D (4 Shares) Mrs. Chip (3 Shares) Mr. Boole (2 Shares) C B Ms. Adder (1 Share) A Total "Yes" Vote Shares Output 1=Yes Output Yes/No/Maybe 0=No/Maybe Janu D 0 1 010 1 0200 no 0 2 O-no D 3 - -no 0 6 Ono 0 4 0-no 0 0 6 |< Yes! 1 0 य no 5 be 0 6 Kyes 1 0 7. *Yes * Yes 8 Yes O = A 1 = A 9 K-Yes 10 K-Yes
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
This is not a quiz it is homework
When I sent questions 5 and 6 I forgot to send in the truth table which will help with doing those questions so here it is
Transcribed Image Text:fardware & Architecture HW #7-100 Pts
f= DCBA DEBA + PC BA + DC BA+
2. (10 Pts) Derive an Un-simplified SOP Boolean expression for the Binary output DC BA+
+ DCBA DCBA
3. (10 Pts) Simplify the SOP Boolean expression for the Binary output using a Karnaugh Map
CP
9/0/0/01
0
1 L
10
SOP
CD+ BBFABC
Grouping
COD=1
BD=W
ABC=W
4. (20 Pts) Draw the logic circuit for the simplified Boolean expression for the Binary output.
A
ABC
BD
CD
F= CB+BD+ ABC
5. (20 Pts) Implement the design using a 4 to 16 Decoder and logic gates, combining the "Yes"
combinations into a single output and the "Maybe" combinations into another output
6. (20 Pts) Implement the design using a 1 to 16 Multiplexer. Only the "Yes" output needs
to be represented by this implementation.
Transcribed Image Text:0
ware & Architecture HW #7 - 100 Pts
Four individuals own a small corporation.
The distribution of the corporate shares are as follows:
Mr. Digital owns 4 shares
Mrs. Chip
owns 3 shares
Mr. Boole owns 2 shares
In this assignment you will design a voting machine that will be used when the owners vote on corporate
issues. Each of the owners has a switch that is closed to record a 'yes' vote and opened to record a 'no' vote.
example, when Mrs. Chip votes 'yes', her vote counts three times that of Ms. Adder.
When one of the owners casts a 'yes' vote, the number of that owner's shares weights that vote. For
- maybe a lighted LED? -- when the result
The output of the voting machine will be a visual indication -- 1
of any vote is a 'yes' by the majority of the shareholders. In case of a tie, or the issue does not get a
majority vote, the indicator LED will not light.
1. (20 Pts) Complete the following Truth Table
Binary
Mr.
Digital
D
(4 Shares)
Mrs. Chip
(3 Shares)
Mr. Boole
(2 Shares)
C
B
Ms.
Adder
(1 Share)
A
Total
"Yes" Vote
Shares
Output
1=Yes
Output
Yes/No/Maybe 0=No/Maybe
Janu
D
0
1
010
1
0200
no
0
2
O-no
D
3
-
-no
0
6
Ono
0
4
0-no
0
0
6
|< Yes!
1
0
य
no
5
be
0
6
Kyes
1
0
7.
*Yes
* Yes
8
Yes
O = A
1 = A
9
K-Yes
10
K-Yes
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 4 images
Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education