A+
truth table gives relation between i/p & o/p. excitation table is use for design of ff & counters.
P Q (/P or /Q) T T F T F T F T T F F T
p --> q and q --> p are not equivalent p --> q and q --> (not)p are equivalent The truth table shows this. pq p --> q q -->(not)p f f t t f t t t t f f f t t t t
A truth table has one column for each input variable (for example, P and Q), and one final column showing all of the possible results of the logical operation that the table represents (for example, P XOR Q). Each row of the truth table contains one possible configuration of the input variables (for instance, P=true Q=false), and the result of the operation for those values. Truth tables can be used to prove many other logical equivalences. Truth tables are also used to specify the function of hardware look-up tables (LUTs) in digital logic circuitry. For an n-input LUT, the truth table will have 2^nvalues (or rows in the above tabular format), completely specifying a boolean function for the LUT. By representing each boolean value as a bit in a binary number, truth table values can be efficiently encoded as integer values in electronic design automation (EDA) software. For example, a 32-bit integer can encode the truth table for a LUT with up to 5 inputs. Truth tables are a simple and straightforward way to encode boolean functions, however, given the exponential growth in size as the number of inputs increase, they are not suitable for functions with a large number of inputs. Other representations which are more memory efficient are text equations and binary decision diagrams.
A+
Construct a truth table for ~q (p q)
truth table gives relation between i/p & o/p. excitation table is use for design of ff & counters.
Making a truth table is actually very simple.For the statement P, it can either be true, or false.P--TFNOT P, or -p (or ~p) is the opposite. If P is true, then not P is... false!The same holds true for if P is false, what is not P? True!The truth table for ~p looks like thisP | ~p--------T | FF | T
True
The correct spelling is A-P-P-R-O-V-A-L.
. p . . . . . q. 0 . . . . . 1. 1 . . . . . 0
If p is true and q is false, p or q would be true. I had a hard time with this too but truth tables help. When using P V Q aka p or q, all you need is for one of the answers to be true. Since p is true P V Q would also be true:)
1)p->q 2)not p or q 3)p 4)not p and p or q 5)contrudiction or q 6)q
Not sure I can do a table here but: P True, Q True then P -> Q True P True, Q False then P -> Q False P False, Q True then P -> Q True P False, Q False then P -> Q True It is the same as not(P) OR Q
30psi
P Q (/P or /Q) T T F T F T F T T F F T