Computing

Question 1

1In Boolean algebra, A + A equals

Medium

A. 1 B. 0 C. A D. 2A

Question 2

2NOT(A + B) = Ā · B̄ is one of De Morgan's laws.

Hard

A. True B. False

Question 3

3A·B + A·B̄ simplifies to

Hard

A. A·B B. 1 C. A D. B

Question 4

4A·B + A·B̄ simplifies to ___.

Hard

Your answer (fill in the blank)

Question 5

5A · 0 equals

Medium

A. 1 B. A C. 0 D. Ā

Question 6

6The grid method used to simplify Boolean expressions is the ___ map.

Hard

Your answer (fill in the blank)

Question 7

7In Boolean algebra, A · A equals

Medium

A. A B. 1 C. 0 D. A²

Question 8

8Simplifying a Boolean expression is useful because it

Medium

A. adds more inputs B. reduces the number of logic gates needed C. removes the output D. makes circuits slower

Question 9

9A Karnaugh map is

Hard

A. a network diagram B. a flowchart C. a type of memory D. a grid used to simplify Boolean expressions

Question 10

10Which law says (A + B) + C = A + (B + C)?

Medium

A. associative law B. commutative law C. distributive law D. complement law