Question

In: Computer Science

1. write a truth table using this symbol: --> 2. write the inputs for the truth...

1. write a truth table using this symbol: -->

2. write the inputs for the truth table to the left of the --> and write the outputs for the truth table to the right of the -->

3. write the compliment, or NOT using '

As an example:

The truth table for AND is written this way:

A B --> A AND B

0 0 --> 0

0 1 --> 0

1 0 --> 0

1 1 --> 1

or this way:

A B --> A AND B

a' b' --> 0

a' b --> 0

a b' --> 0

a b --> 1

As another example:

For a 3 input, 2 output truth table, the truth table is written this way:

A B C --> X Y

0 0 0 --> 0 0

0 0 1 --> 1 0

0 1 0 --> 1 0

0 1 1 --> 0 1

1 0 0 --> 1 0

1 0 1 --> 0 1

1 1 0 --> 0 1

1 1 1 --> 1 1

Part a) Write the truth table for the boolean algebra equation

F1 = A+BD+CD

Part b) Write the truth table for the boolean algebra equation

F2 = (A+B+C)•(A+B+D)•(A+C+D)

Part c) Explain in English how F1 and F2 are related. Write your explanation in 4 sentences or less.

(Note: a) is the truth table for logic represented using sum of products b) is the truth table for logic represented using product of sums. In general, any logic that can be written as a sum of products can also be written as a product of sums)

Expert Solution

Truth Table of F1=A+BD+CD

A	B	C	D	BD	CD	A+BD	---> A+BD+CD
0	0	0	0	0	0	0	0
0	0	0	1	0	0	0	0
0	0	1	0	0	0	0	0
0	0	1	1	0	1	0	1
0	1	0	0	0	0	0	0
0	1	0	1	1	0	1	1
0	1	1	0	0	0	0	0
0	1	1	1	1	1	1	1
1	0	0	0	0	0	1	1
1	0	0	1	0	0	1	1
1	0	1	0	0	0	1	1
1	0	1	1	0	1	1	1
1	1	0	0	0	0	1	1
1	1	0	1	1	0	1	1
1	1	1	0	0	0	1	1
1	1	1	1	1	1	1	1

Truth Table of F2=(A+B+C)(A+B+D)(A+C+D)

A	B	C	D	A+B+C	A+B+D	A+C+D	--> (A+B+C).(A+B+D)(A+C+D)
0	0	0	0	0	0	0	0
0	0	0	1	0	1	1	0
0	0	1	0	1	0	1	0
0	0	1	1	1	1	1	1
0	1	0	0	1	1	0	0
0	1	0	1	1	1	1	1
0	1	1	0	1	1	1	1
0	1	1	1	1	1	1	1
1	0	0	0	1	1	1	1
1	0	0	1	1	1	1	1
1	0	1	0	1	1	1	1
1	0	1	1	1	1	1	1
1	1	0	0	1	1	1	1
1	1	0	1	1	1	1	1
1	1	1	0	1	1	1	1
1	1	1	1	1	1	1	1

F1=A+BD+CD

F2=(A+B+C)(A+B+D)(A+C+D)

=(A+B+CD).(A+C+D) (BY DISTRIBUTIVE THEOREM (A+B+C)(A+B+D)=(A+B+CD))

=A+(B+CD).(C+D)

=A+BC+BD+CD+CD

=A+BC+BD+CD

= F1+BC

THERE IS ONE TERM DIFFERENCE BETWEEN F1 AND F2 THAT IS BC TERM

venereology answered 6 months ago

Question 1: A Multiplexer (MUX) a) Write truth table and draw symbol for a 4-to-1 MUX....

Question 1: A Multiplexer (MUX) a) Write truth table and draw symbol for a 4-to-1 MUX. (1 mark) b) Write VHDL code for the above multiplexer. (1 mark) c) Write VHDL code for a test bench and simulate the design. (1 mark) d) Implement the design on FPGA, with inputs connected to switches and output to LED. (1 mark)

QUESTION 2 Suppose you are creating a truth table with 3 inputs (a, b, and c)...

QUESTION 2 Suppose you are creating a truth table with 3 inputs (a, b, and c) and 1 output (F). If an 'x' symbol indicates "don't care" (the value of the input does not effect the output), how many input combinations are covered by the single row of a truth table shown below? a b c F x 1 x 1 - 1 - 2 - 3 - 4 - None of the above QUESTION 3 Suppose you have a...

write a truth table of 74LS164- an 8-Bit Serial In/Parallel Out Shift Register using behavioral style...

write a truth table of 74LS164- an 8-Bit Serial In/Parallel Out Shift Register using behavioral style using VHDL

Answer the following questions: (a) Show that the following is a tautology by using truth table...

Answer the following questions: (a) Show that the following is a tautology by using truth table and using list of equivalences. (This problem should be solved using 2 different methods mentioned above). ((¬p −→ q) ∧ (¬p −→ ¬q)) −→ p (b) Show that the compound propositions are logically equivalent, by using truth table and using list of equivalences. ¬p ∨ (r −→ ¬q) and (¬p ∨ ¬q) ∨ ¬r (c) Show that the propositions ¬p ∨ (¬r ∨ q)...

Write a truth table for the proposition: ¬(q ∧ r) → (¬p ∨ ¬r). Consider a “1” to be true and a “0” to be false.

Using Python. Write a program that reads a sequence (unknown number of inputs) of integer inputs...

Using Python. Write a program that reads a sequence (unknown number of inputs) of integer inputs and prints the number of even and odd inputs in the sequence. please explain. Thanks

Write a truth table for Moore finite state machine modeling a traffic light.

Write a C++ program to construct the truth table of P ∨￢(Q ∧ R) If you...

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!

Write down the truth table fora 4-to-2 priority encoderhaving input W[3:0]and with priority levels in the...

Write down the truth table fora 4-to-2 priority encoderhaving input W[3:0]and with priority levels in the decreasing order (i.e., W[0]-Highest, ....., W[3]-Least). Write down the Verilog code for implementing the same. plz asap fast

Symbolize the following arguments then check for validity using a truth table. To simplify, leave the...

Symbolize the following arguments then check for validity using a truth table. To simplify, leave the parenthetical parts out of your symbolization. All of the arguments are based loosely on arguments in Chapter One of The Branded Mind by Eric Du Plessis. A.(The primary function of emotions is to direct attention, so) If your client’s purchase was motivated by emotion then it was related to attention. Your client’s purchase was (motivated by a desire for well-being or cultural acceptance and...