[MC][TF] Computer System and Architecture - Boolean Algebra, Truth Tables, and Logic Gates

Question Type: Multiple Choice

According to the Boolean Algebra rule, A + 0 = ?

A. A

B. 0

C. A.0

D. all of the above

A. A

Question Type: True False

Boolean multiplication corresponds to the logical function of an AND gate.

True

Question Type: Multiple Choice

Double Negation states that ¬(¬A)=?

A. ¬A

B. A

C. ¬A(¬A)

D. all of the above

B. A

Question Type: Multiple Choice

Under this law, the output always matches the input

A. Double Negation Law

B. Identity Law

C. Idempotent Law

D. none of the above

B. Identity Law

Question Type: Multiple Choice

Under this law, the input of A has no effect.

A. Identity Law

B. Idempotent Law

C. De Morgan's Law

D. Annulment Law

D. Annulment Law

Question Type: Multiple Choice

The Annulment Law states that A ∨ 1 can be written as ?.

A. 0

B. 1

C. A

D. none of the above

B. 1

Question Type: Multiple Choice

The Commutative Property states that A ∧ B can be written as ?.

A. B ∧ A

B. A V B

C. B V A

D. none of the above

A. B ∧ A

Question Type: Multiple Choice

(C AND D) OR (NOT(A OR B)) = Q, If A=1, B=1, C=0 and D=1, what does Q equal?

A. 0

B. 1

A. 0

Question Type: True False

The Idempotent Law states that A ∨ A =A.

True

Question Type: Multiple Choice

According to this rule, A ∧ 1=A

A. De Morgan's Law

B. Idempotent Law

C. Identity Law

D. none of the above

C. Identity Law

Question Type: Multiple Choice

Boolean multiplication corresponds to the logical function of an AND gate.

01=?

A. 0

B. 1

C. product

D. none of the above

A. 0

Question Type: True False

We can use these "Laws of Boolean" to both reduce and simplify a complex Boolean expression in an attempt to increase the number of logic gates required.

False

Question Type: Multiple Choice

The Idempotent Law states that A ∨ A can be written as ?

A. A

B. A ∧ A

C. ¬A

D. none of the above

A. A

Question Type: Multiple Choice

The Associative Property states that (A ∧ B) ∧ C can be written as ?.

A. A ∧ (B∧ C )

B. A V (B V C )

C. A (B V C )

D. none of the above

A. A ∧ (B∧ C )

Question Type: Multiple Choice

THE Double Negation states that ¬(¬A) can be written as ?

A. ¬A

B. A

C. ¬(A)

D. none of the above

B. A

Question Type: Multiple Choice

The Annulment Law states that A ∧ 0 can be written as ?.

A. 1

B. 0

C. A

D. none of the above

B. 0

Question Type: Multiple Choice

The De Morgan's Law states that ¬(A V B) can be written as ?.

A. ¬A ∧ ¬B

B. ¬A V ¬B

C. A V B

D. none of the above

A. ¬A ∧ ¬B

Question Type: Multiple Choice

The Distributive Property states that A ∧ (B V C) can be written as ?.

A. (A V B) ∧ (A VC)

B. (A ∧ B) V (A ∧ C)

C. (A V B) V (A VC)

D. none of the above

B. (A ∧ B) V (A ∧ C)

Question Type: Multiple Choice

These are electronic circuits that manipulate voltages.

A. circuits

B. resistors

C. Logic Gates

D. none of the above

C. Logic Gates

Question Type: Multiple Choice

A NOT gate has...

A. Two inputs and one output

B. One input and two outputs

C. One input and one output

D. Two inputs and two outputs

C. One input and one output

Question Type: True False

The complement law states that A ∨ ¬A=¬A

False

Question Type: True False

Double Negation states that ¬(¬A)=A

True

Question Type: Multiple Choice

Boolean addition corresponds to the logical function of an OR gate.

0 + 0 =?

A. 1

B. 0

C. sum

D. none of the above

B. 0

Question Type: Multiple Choice

The Identity Law states that, A ∨ 0 can be written as ?

A. 0

B. A

C. 1

D. none of the above

B. A

Question Type: Multiple Choice

The Distributive Property states that AV (B ∧ C) can be written as ?.

A. (A∧ B) ∧ (A ∧C)

B. (A V B) ∧ (A VC)

C. (A ∧ B) V (A ∧C)

D. none of the above

B. (A V B) ∧ (A VC)

Question Type: True False

We can use these "Laws of Boolean" to both reduce and simplify a complex Boolean expression in an attempt to reduce the number of logic gates required.

True

Question Type: Multiple Choice

The Idempotent Law states that A ∧ A can be written as ?.

A. A

B. ¬A

C. 0

D. none of the above

A. A

Question Type: True False

The Complement law states that A ∧ ¬A can be written as A.

False

Question Type: True False

You can't combine Logic Gates.

False

Question Type: Multiple Choice

What gate is the notation '∨' representing?

A. AND

B. OR

C. NOR

D. NOT

B. OR

Question Type: Multiple Choice

What is the output of a NOT gate if the inputs is 0?

A. 1

B. 0

A. 1

Question Type: Multiple Choice

Which of the following is not a boolean algebra law?

A. Modus Ponens

B. De Morgan's Law

C. Annulment Law

D. Double Negation

A. Modus Ponens

Question Type: Multiple Choice

The Absorptive Property states that AV (A ∧ B) can be written as ?.

A. A V B

B. A ∧ B

C. A

D. none of the above

C. A

Question Type: Multiple Choice

A AND B = Q, If A=1 and B=1 what does Q equal?

A. 1

B. 0

C. 1 AND 0

D. none of the above

A. 1

Question Type: Multiple Choice

What is the output of an AND gate if its inputs are 1 and 0?

A. 1

B. 0

B. 0

Question Type: Multiple Choice

It is the mathematics we use to analyze digital gates and circuits.

A. Algebra

B. Boolean Algebra

C. Arguments

D. none of the above

B. Boolean Algebra

Question Type: Multiple Choice

Which is not a Boolean Algebra Law?

A. De Morgan's Law

B. Modus Tollens

C. Identity Law

D. all of the above

B. Modus Tollens

Question Type: True False

Boolean addition corresponds to the logical function of an AND gate.

False

Question Type: True False

The Complement law states that A ∧ ¬A can be written as 0.

True

Question Type: True False

Boolean multiplication corresponds to the logical function of an OR gate.

False

Question Type: Multiple Choice

What is the output of an AND gate if its inputs are 1 and 1?

A. 1

B. 0

A. 1