A/B/6 y-output dware & Architecture HW #6 Bit (LSB) must be tested. 6. (6 Pts - 3 Pts Each) To determine whether a binary number is Odd or Even, the Least Significant a. Assume only Exclusive-OR Gates are available, design and sketch a simplified circuit to output a 1 if the binary number is Even and a 0 if the binary number is Odd. b. Then design and sketch the circuit assuming only Exclusive-NOR Gates are available. 7. (8 Pts) For the following Truth Table, se a K-Map to derive a minimum Boolean expression for the Expression output. Draw the logic circuit. Label the output of each gate and the final output with a Boolean Inputs Output Y A B C D 0 0 0 0 X 0 0 0 1 0 0 0 1 0 0 0 1 1 0 1 0 0 000 0 1 0 1 0 0 1 1 0 I 0 1 1 1 1 1 0 0 0 1 1 0 0 1 1 1 0 1 0 X I 0 1 1 X 1 1 0 0 X 1 1 0 1 X 1 1 1 0 X 1 1 X 8. (9 Pts - 3 Pts Each) Apply DeMorgan's Theorem for NAND gates and use only 2-Input NAND Gates to a. Create and sketch a simplified circuit with AND gate functionality. b. Prove the function of your design using DeMorgan's and/or other Boolean Theorems. c. Prove the function of your design using Truth Tables rdware & Architecture HW #6 4. (4 Pts) Use a Karnaugh Map to complete the simplification of the Boolean Expression in the previous question. AB CO 이 B 01 0 5. (8 Pts) Use a Karnaugh Map to derive the Minimum Boolean Expression that will implement the following Truth Table. ("x" Don't Care) Sketch the logic Circuit, providing an intermediate expression for the output of each gate used and the final output. Inputs Output A B C D Y 0 0 0 0 1 0 0 0 1 0 0 0 1 0 1 0 0 1 1 0 0 1 0 0 1 0 1 0 1 X 0 1 1 0 1 0 1 1 1 0 1 0 0 0 1 1 0 0 1 0 1 0 1 0 X 1 0 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
A/B/6
y-output
dware & Architecture HW #6
Bit (LSB) must be tested.
6. (6 Pts - 3 Pts Each) To determine whether a binary number is Odd or Even, the Least Significant
a. Assume only Exclusive-OR Gates are available, design and sketch a simplified circuit to
output a 1 if the binary number is Even and a 0 if the binary number is Odd.
b. Then design and sketch the circuit assuming only Exclusive-NOR Gates are available.
7. (8 Pts) For the following Truth Table, se a K-Map to derive a minimum Boolean expression for the
Expression
output. Draw the logic circuit. Label the output of each gate and the final output with a Boolean
Inputs
Output
Y
A B C D
0 0 0 0
X
0
0 0 1
0
0
0 1 0
0
0 1 1
0
1 0
0
000
0
1 0
1
0
0
1
1
0
I
0
1
1
1
1
1
0
0
0
1
1
0
0
1
1
1
0
1
0
X
I
0
1
1
X
1
1
0
0
X
1
1
0
1
X
1
1
1
0
X
1
1
X
8. (9 Pts - 3 Pts Each) Apply DeMorgan's Theorem for NAND gates and use only 2-Input NAND Gates to
a. Create and sketch a simplified circuit with AND gate functionality.
b. Prove the function of your design using DeMorgan's and/or other Boolean Theorems.
c. Prove the function of your design using Truth Tables
Transcribed Image Text:A/B/6 y-output dware & Architecture HW #6 Bit (LSB) must be tested. 6. (6 Pts - 3 Pts Each) To determine whether a binary number is Odd or Even, the Least Significant a. Assume only Exclusive-OR Gates are available, design and sketch a simplified circuit to output a 1 if the binary number is Even and a 0 if the binary number is Odd. b. Then design and sketch the circuit assuming only Exclusive-NOR Gates are available. 7. (8 Pts) For the following Truth Table, se a K-Map to derive a minimum Boolean expression for the Expression output. Draw the logic circuit. Label the output of each gate and the final output with a Boolean Inputs Output Y A B C D 0 0 0 0 X 0 0 0 1 0 0 0 1 0 0 0 1 1 0 1 0 0 000 0 1 0 1 0 0 1 1 0 I 0 1 1 1 1 1 0 0 0 1 1 0 0 1 1 1 0 1 0 X I 0 1 1 X 1 1 0 0 X 1 1 0 1 X 1 1 1 0 X 1 1 X 8. (9 Pts - 3 Pts Each) Apply DeMorgan's Theorem for NAND gates and use only 2-Input NAND Gates to a. Create and sketch a simplified circuit with AND gate functionality. b. Prove the function of your design using DeMorgan's and/or other Boolean Theorems. c. Prove the function of your design using Truth Tables
rdware & Architecture HW #6
4. (4 Pts) Use a Karnaugh Map to complete the simplification of the Boolean Expression in the
previous question.
AB
CO
이
B
01
0
5. (8 Pts) Use a Karnaugh Map to derive the Minimum Boolean Expression that will implement the
following Truth Table. ("x" Don't Care) Sketch the logic Circuit, providing an intermediate
expression for the output of each gate used and the final output.
Inputs
Output
A
B
C D
Y
0
0 0
0
1
0
0
0
1
0
0
0
1
0
1
0
0
1
1
0
0
1
0
0
1
0
1
0
1
X
0
1
1
0
1
0
1
1
1
0
1
0
0
0
1
1
0
0
1
0
1
0
1
0
X
1
0
1
1
1
1
1
0
0
1
1
1
0
1
1
1
1
1
0
1
1
1
1
1
0
Transcribed Image Text:rdware & Architecture HW #6 4. (4 Pts) Use a Karnaugh Map to complete the simplification of the Boolean Expression in the previous question. AB CO 이 B 01 0 5. (8 Pts) Use a Karnaugh Map to derive the Minimum Boolean Expression that will implement the following Truth Table. ("x" Don't Care) Sketch the logic Circuit, providing an intermediate expression for the output of each gate used and the final output. Inputs Output A B C D Y 0 0 0 0 1 0 0 0 1 0 0 0 1 0 1 0 0 1 1 0 0 1 0 0 1 0 1 0 1 X 0 1 1 0 1 0 1 1 1 0 1 0 0 0 1 1 0 0 1 0 1 0 1 0 X 1 0 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0
Expert Solution
steps

Step by step

Solved in 2 steps with 4 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY