Write a C++ program to construct the truth table of P ∨¬(Q ∧
R)
If you could include comments to explain the code that would be
much appreciated!!! :)
Thank you so much!
1.) Suppose that the statement form ((p ∧ ∼ q)∨(p ∧ ∼ r))∧(∼ p ∨
∼ s) is true. What can you conclude about the truth values of the
variables p, q, r and s? Explain your reasoning
2.Use the Laws of Logical Equivalence (provided in class and in
the textbook page 35 of edition 4 and page 49 of edition 5) to show
that: ((∼ (p ∨ ∼ q) ∨ (∼ p ∧ ∼ r)) ∧ s) ≡ ((r...
Complete the table below by computing and filling in
the missing values for (a) Avg. fixed Cost, (b) Avg. Variable cost,
(c) Total Cost, (d) Avg. Total Cost, (E) Marginal
cost
(1)
Quantity of
Output, Q
(units)
(2)
Total
Fixed Cost
($)
(3)
Average
Fixed
Cost (AFC)
(4)
Total Variable
Cost (TVC)
(5)
Average
Variable
Cost (AVC)
(6)
Total Cost
(TC)
(7)
Average
Total Cost
(ATC)
(8)
Marginal
cost (MC)
0
$200
$0
1
200
30
2
200
50
3...
Q2) (a) construct a truth table for the following function: ?(?,
?, ?) = (?? + ?̅?) ̅̅̅ + ??
(b) Use the truth table of (a) to write the function F in sum of
minterms form.
(c) Expand the function ?(?, ?, ?) = ? + ?̅? to product of
Maxterms form.
(d) Simplify the following function using K-Map. ?(?, , ?, ?, ?)
= ?̅? + ?? + ?̅? + ??̅?