3.3. Hardware
A subsection of Computer Science, 9608, through 3. Advanced Theory
Listing 10 of 48 questions
A Boolean expression corresponds to the following truth table. INPUT OUTPUT A B C X Write the Boolean expression for the truth table by applying the sum‑of‑products. X = Complete the Karnaugh Map (K‑map) for the truth table. AB C The K‑map can be used to simplify the expression in part . Draw looparound appropriate groups of 1s in the table in part to produce an optimal sum‑of‑products. Write the simplified sum‑of‑products expression for your answer to part . X = A logic circuit with four inputs produces the following truth table. INPUT OUTPUT A B C D X Complete the K‑map that corresponds to the truth table. AB CD Draw looparound appropriate groups of 1s in the table in part to produce an optimal sum‑of‑products. Write the simplified sum‑of‑products expression for your answer to part . X =
9608_w18_qp_33
THEORY
2018
Paper 3, Variant 3
View
A Boolean expression produces the following truth table. INPUT OUTPUT A B C X Write the Boolean expression for the truth table as a sum-of-products. X = Complete the Karnaugh Map (K-map) for the truth table above. AB C The K-map can be used to simplify the expression in part . Draw loops around appropriate groups in the K-map in part to produce an optimal sum-of- products. Write, using your answer to part , a simplified sum-of-products expression for the truth table. X =
9608_w19_qp_31
THEORY
2019
Paper 3, Variant 1
View
A Boolean expression produces the following truth table. INPUT OUTPUT A B C X Write the Boolean expression for the truth table as a sum-of-products. X = Complete the Karnaugh Map (K-map) for the truth table above. AB C The K-map can be used to simplify the expression in part . Draw loops around appropriate groups in the K-map in part to produce an optimal sum-of- products. Write, using your answer to part , a simplified sum-of-products expression for the truth table. X =
9608_w19_qp_33
THEORY
2019
Paper 3, Variant 3
View
The following truth table represents a logic circuit with three inputs and two outputs. INPUT OUTPUT A B C X Y Write the Boolean expressions for the truth table as sum-of-products. X = Y = Complete the Karnaugh Maps (K-maps) for the truth table. OUTPUT X OUTPUT Y AB AB C C The K-maps can be used to simplify one of the expressions in part . Draw looparound appropriate groupof 1s to produce an optimal sum-of-products for the single output table that can be simplified in part . Write the simplified sum-of-products expressions for this output from part . Identify the common logic circuit given by the truth table in part . Give the use of each output. Logic circuit Use of X Use of Y
9608_w20_qp_31
THEORY
2020
Paper 3, Variant 1
View
The following truth table represents a logic circuit with three inputs and two outputs. INPUT OUTPUT A B C X Y Write the Boolean expressions for the truth table as sum-of-products. X = Y = Complete the Karnaugh Maps (K-maps) for the truth table. OUTPUT X OUTPUT Y AB AB C C The K-maps can be used to simplify one of the expressions in part . Draw looparound appropriate groupof 1s to produce an optimal sum-of-products for the single output table that can be simplified in part . Write the simplified sum-of-products expressions for this output from part .
9608_w20_qp_32
THEORY
2020
Paper 3, Variant 2
View
The following truth table represents a logic circuit with three inputs and two outputs. INPUT OUTPUT A B C X Y Write the Boolean expressions for the truth table as sum-of-products. X = Y = Complete the Karnaugh Maps (K-maps) for the truth table. OUTPUT X OUTPUT Y AB AB C C The K-maps can be used to simplify one of the expressions in part . Draw looparound appropriate groupof 1s to produce an optimal sum-of-products for the single output table that can be simplified in part . Write the simplified sum-of-products expressions for this output from part . Identify the common logic circuit given by the truth table in part . Give the use of each output. Logic circuit Use of X Use of Y
9608_w20_qp_33
THEORY
2020
Paper 3, Variant 3
View
The truth table for a logic circuit with four inputs is shown. INPUT OUTPUT P Q R S X Write the Boolean algebraic expression for the truth table as a sum-of-products. X = Complete the following Karnaugh Map (K-map) for the truth table. PQ RS The K-map can be used to simplify the expression in part . Draw looparound appropriate groups in the K-map to produce an optimal sum-of-products. Write the simplified sum-of-products from the K-map. X = Simplify the expression for X, as represented by the truth table in part , using Boolean Algebra.
9608_w21_qp_31
THEORY
2021
Paper 3, Variant 1
View
The truth table for a logic circuit with four inputs is shown. INPUT OUTPUT P Q R S X Write the Boolean algebraic expression for the truth table as a sum-of-products. X = Complete the following Karnaugh Map (K-map) for the truth table. PQ RS The K-map can be used to simplify the expression in part . Draw looparound appropriate groups in the K-map to produce an optimal sum-of-products. Write the simplified sum-of-products from the K-map. X = Simplify the expression for X, represented by the truth table in part , using Boolean Algebra.
9608_w21_qp_32
THEORY
2021
Paper 3, Variant 2
View
Questions Discovered
48