Introduction To IT - Boolean Logic | Attempts: 356 - Quiz, Trivia , Flashcards & Questions

2.

The OR function is Boolean multiplication and the AND function is Boolean addition.

True
False

Correct Answer

A. False

Explanation

The given statement is false. The OR function in Boolean logic is actually Boolean addition, where the output is true if at least one of the inputs is true. On the other hand, the AND function is Boolean multiplication, where the output is true only if both inputs are true.

Rate this question:

1

3.

This image represents a gate.

Correct Answer
NOT

Explanation
The easiest way to remember this is that it has a "knot" at the tip of the triangle

Rate this question:

4.

The symbol shown below is for a 2-input NAND gate.

True
False

Correct Answer

A. False

Explanation

The symbol shown below is not for a 2-input NAND gate.

Rate this question:

1

5.

Which of the following is true of a NOR gate?

It always yields a positive result.
It always yields a negative result.
It is the negative of the OR gate
It is the same as the OR gate

Correct Answer

A. It is the negative of the OR gate

Explanation

With the NOR gate, where ever the OR gate would have yielded a 1(positive), it becomes a negative (0)

Rate this question:

6.

By applying De Morgan's theorem to a NOR gate, two identical truth tables can be produced.

True
False

Correct Answer

A. True

Explanation

De Morgan's theorem states that the complement of a logical operation can be obtained by interchanging the operation with its complement and negating the result. In the case of a NOR gate, it performs the logical operation of OR followed by negation. By applying De Morgan's theorem to a NOR gate, we can interchange the OR operation with its complement (AND) and negate the result. This results in a new gate that performs the AND operation followed by negation, which is equivalent to a NAND gate. Since the truth tables for NOR and NAND gates are identical, it is true that two identical truth tables can be produced by applying De Morgan's theorem to a NOR gate.

Rate this question:

7.

An equivalent representation for the Boolean expression A' + 1 is

1
A
A'
0

Correct Answer

A. 1

Explanation

From the Boolean property A + 1 = 1, let A = A'. It's that simple!

Rate this question:

8.

Draw a logic table for the diagram above and determine the output.

No answer is needed. You can skip this question.
No answer is needed. You can skip this question.

Correct Answer

A. No answer is needed. You can skip this question.

9.

SOP stands for sum-of-powers

True
False

Correct Answer

A. False

Explanation

The statement is false because SOP does not stand for "sum-of-powers." SOP stands for "Standard Operating Procedure," which refers to a set of step-by-step instructions or guidelines that must be followed to carry out a specific task or operation.

Rate this question:

10.

Simplification of the Boolean expression AB + ABC + ABCD + ABCDE + ABCDEF yields which of the following results?

ABCDEF
AB
A + B + C + D + E + F
A + B(C+D(E+F))

Correct Answer

A. AB

Explanation

Repeated application of the absorption theorem x + xy = x, gives the desired result.

Rate this question:

11.

Which of the following is the best definition of a literal?

1 or 2
The complement of a Boolean variable
The actual understanding of a Boolean variable
A Boolean variable

Correct Answer

A. 1 or 2

Explanation

A literal can be defined as either 1 or 2. In Boolean algebra, a literal is a variable or its complement, represented by either its true or false value. So, option 1 or 2 accurately describes this definition of a literal. Option 3, "A Boolean variable," is not a complete definition of a literal as it does not include the concept of complement. Option 2, "The actual understanding of a Boolean variable," is not a clear or accurate definition of a literal.

Rate this question:

12.

When output is determined solely by output, it is called a logic.

Correct Answer
Combinational

Explanation
When output is determined solely by input, it is called combinational logic. In this type of logic, the output is a function of the current input values and does not depend on any previous inputs or outputs. It is called "combinational" because the output is determined by combining the input values using logical operations such as AND, OR, and NOT. This is in contrast to sequential logic, where the output also depends on the previous state of the system.

Rate this question:

13.

Also OR can be represented by?

Correct Answer
+ (plus)

Explanation
The correct answer is + (plus) because the symbol "+" is commonly used to represent the logical operator "OR" in computer programming and boolean algebra. It signifies that at least one of the conditions or operands is true.

Rate this question:

14.

In boolean logic, what symbol can be used to represent AND?

Correct Answer
. (full stop)

Explanation
In boolean logic, the symbol "." (full stop) is used to represent the AND operation. This symbol is used to combine two or more conditions or statements, and it returns true only if all the conditions are true.

Rate this question:

0

Introduction To IT - Boolean Logic

In Boolean algebra, A + 1 = 1.

Quiz Preview

The OR function is Boolean multiplication and the AND function is Boolean addition.

This image represents a gate.

The symbol shown below is for a 2-input NAND gate.

Which of the following is true of a NOR gate?

By applying De Morgan's theorem to a NOR gate, two identical truth tables can be produced.

An equivalent representation for the Boolean expression A' + 1 is

Draw a logic table for the diagram above and determine the output.

SOP stands for sum-of-powers

Simplification of the Boolean expression AB + ABC + ABCD + ABCDE + ABCDEF yields which of the following results?

Which of the following is the best definition of a literal?

When output is determined solely by output, it is called a logic.

Also OR can be represented by?

In boolean logic, what symbol can be used to represent AND?