While preparing a pizza order for a party, you encounter some restrictions (appa
ID: 2247619 • Letter: W
Question
While preparing a pizza order for a party, you encounter some restrictions (apparently many of the pizza shops are busy tonight). There are two readily available types: Sausage or Pepperoni. There are medium and large sizes, thin or thick crust, and regular or extra cheese. To maximize the pizza availability, different vendors can readily supply your pizzas as follows:
Sausage, medium, thin crust, regular cheese must come from Little Caesars
Pepperoni, medium, regular cheese must come from Papa Johns
Pepperoni, thick crust, extra cheese must come from Dominoes
Pepperoni, large, thin crust must come from Little Caesars and Domino’s
Sausage, thick crust, extra cheese must come from Papa Johns and Domino’s
a. Set up a truth table specifying the different vendors that can fulfill your order.
b. Set up a Karnaugh map for Domino’s.
c. Derive an equation showing its minimum implementation
Explanation / Answer
I understand that this may seem confusing because the question is not direct. I will break it up for you.
Here are the steps to do it.
Step1: This Truth table will have 4 variables - type, size, crust, cheese.
type - sausage (0) or pepperoni (1)
size - medium (0) or large (1)
crust - thin (0) or thick (1)
cheese - regular (0) or extra (1)
We can easily draw a 4 variable truth table.
Step 2: There are 3 output columns - Domino's, Little Caesars, Papa Johns. Each of them gets 1 when we can get from them or 0 when we can't get from them.
Step 3: K-map is draw for the outputs using the 4 variables we defined earlier.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.