Four chairs are arranged in a circle as shown here... They are designated A, B, C, D. Each chair may have an occupant (logic 1), or may be empty (logic 0). Create both the TTM(..) and Em(...) (Maxterm and Minterm) expressions for the following functions... a) F(D, C, B, A) = 1 iff there are no adjacent empty chairs b) G(D, C, B, A) = 1 iff there are at least 3 adjacent empty chairs c) H(D, C, B, A) = 1 iff there are more people sitting in chairs A, D than in chairs B, C.

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
Four chairs are arranged in a circle as shown here...
They are designated A, B, C, D.
Each chair may have an occupant (logic 1),
or may be empty (logic 0).
Create both the |M...) and Em(...)
(Maxterm and Minterm) expressions for
the following functions...
a) F(D, C, B, A) = 1 iff there are no adjacent empty chairs
b) G(D, C, B, A) =1 iff there are at least 3 adjacent empty chairs
c) H(D, C, B, A) = 1 iff there are more people sitting in chairs A, D than in chairs B, C.
Hint: create a truth table of all possibilities and fill it in with the logic from your understanding of
the problem sentence. Then create the minterm and maxterms expressions for each.
Transcribed Image Text:Four chairs are arranged in a circle as shown here... They are designated A, B, C, D. Each chair may have an occupant (logic 1), or may be empty (logic 0). Create both the |M...) and Em(...) (Maxterm and Minterm) expressions for the following functions... a) F(D, C, B, A) = 1 iff there are no adjacent empty chairs b) G(D, C, B, A) =1 iff there are at least 3 adjacent empty chairs c) H(D, C, B, A) = 1 iff there are more people sitting in chairs A, D than in chairs B, C. Hint: create a truth table of all possibilities and fill it in with the logic from your understanding of the problem sentence. Then create the minterm and maxterms expressions for each.
Expert Solution
Step 1

Since A, B, C, D are four variables, so the truth table contain 24 = 16 rows. 

(a) Given F(D, C, B, A) = 1 iff there are no adjacent empty chairs. The truth table is:

A B C F Minterms Maxterms
0 0 0 0 0   (A+B+C+D)
0 0 0 1 0   (A+B+C+D')
0 0 1 0 0   (A+B+C'+D)
0 0 1 1 0   (A+B+C'+D')
0 1 0 0 0   (A+B'+C+D)
0 1 0 1 1 A'BC'D  
0 1 1 0 0   (A+B'+C'+D)
0 1 1 1 1 A'BCD  
1 0 0 0 0   (A'+B+C+D)
1 0 0 1 0   (A'+B+C+D')
1 0 1 0 1 AB'CD'  
1 0 1 1 1 AB'CD  
1 1 0 0 0   (A'+B'+C+D)
1 1 0 1 1 ABC'D  
1 1 1 0 1 ABCD'  
1 1 1 1 1 ABCD  

Now to get desired SOP expression add the minterms for the output 1's.
F=A'BC'D + A'BCD + AB'CD' + AB'CD + ABC'D + ABCD' + ABCD =  (5, 7, 10, 11, 13, 14, 15)

Now to get desired POS expression multiply the maxterms for the output 0's.
F= (A+B+C+D)(A+B+C+D')(A+B+C'+D)(A+B+C'+D')(A+B'+C+D)(A+B'+C'+D)(A'+B+C+D)(A'+B+C+D')(A'+B'+C+D)
 =  (0, 1, 2, 3, 4, 6, 8, 9, 12)

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
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