In Section 3.1 (page 94) , we showed how to represent computer circuits with logical expressions. We represented a series by the expression p ∧ q and a parallel circuit by p ∨ q . The logical form ( p ∨ q ) ∧ ( p ∨ r ) and p ∨ ( q ∧ r ) are equivalent, which means that the following two circuits will behave identically. In Exercise 65-68, represent each circuit by a logical form and then rewrite that logical form in an equivalent form. Use truth tables to prove that the second form is equivalent to the first. Draw a circuit that corresponds to the second logical form. If possible, try to choose the second form so that the corresponding circuit has fewer switches than the original circuit.
In Section 3.1 (page 94) , we showed how to represent computer circuits with logical expressions. We represented a series by the expression p ∧ q and a parallel circuit by p ∨ q . The logical form ( p ∨ q ) ∧ ( p ∨ r ) and p ∨ ( q ∧ r ) are equivalent, which means that the following two circuits will behave identically. In Exercise 65-68, represent each circuit by a logical form and then rewrite that logical form in an equivalent form. Use truth tables to prove that the second form is equivalent to the first. Draw a circuit that corresponds to the second logical form. If possible, try to choose the second form so that the corresponding circuit has fewer switches than the original circuit.
In Section 3.1 (page 94), we showed how to represent computer circuits with logical expressions. We represented a series by the expression
p
∧
q
and a parallel circuit by
p
∨
q
.
The logical form
(
p
∨
q
)
∧
(
p
∨
r
)
and
p
∨
(
q
∧
r
)
are equivalent, which means that the following two circuits will behave identically.
In Exercise 65-68, represent each circuit by a logical form and then rewrite that logical form in an equivalent form. Use truth tables to prove that the second form is equivalent to the first. Draw a circuit that corresponds to the second logical form. If possible, try to choose the second form so that the corresponding circuit has fewer switches than the original circuit.
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
MFCS unit-1 || Part:1 || JNTU || Well formed formula || propositional calculus || truth tables; Author: Learn with Smily;https://www.youtube.com/watch?v=XV15Q4mCcHc;License: Standard YouTube License, CC-BY