# Digital Electronics Boolean Algebra and Logic Simplification Online Test

## Digital Electronics Boolean Algebra and Logic Simplification Online Test

#### Finish Quiz

0 of 30 questions completed

Questions:

- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30

#### Information

Digital Electronics Boolean Algebra and Logic Simplification Online Test. The Digital Electronics Full online mock test paper is free for all students and Very Helpful for Exam Preparation. Digital Electronics Question and Answers in English. Digital Electronics Online Mock test for Digital Electronics Boolean Algebra and Logic Simplification Topic. Here we are providing** Digital Electronics Boolean Algebra and Logic Simplification Online Test Series in English. Check Digital Electronics **Mock Test Series 2019.

This paper has **30 questions**.

Time allowed is **30 minutes**.

The Digital Electronics online Mock Test Exam is Very helpful for all students. Now Scroll down below n click on **“Start Quiz” or “Start Test” **and Test yourself.

You have already completed the quiz before. Hence you can not start it again.

Quiz is loading...

You must sign in or sign up to start the quiz.

You have to finish following quiz, to start this quiz:

#### Results

0 of 30 questions answered correctly

Your time:

Time has elapsed

You have reached 0 of 0 points, (0)

Average score | |

Your score |

#### Categories

- Not categorized 0%

Pos. | Name | Entered on | Points | Result |
---|---|---|---|---|

Table is loading | ||||

No data available | ||||

- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30

- Answered
- Review

- Question 1 of 30
##### 1. Question

Which of the following expressions is in the sum-of-products (SOP) form?

CorrectIncorrect - Question 2 of 30
##### 2. Question

The commutative law of Boolean addition states that A + B = A × B.

CorrectIncorrect - Question 3 of 30
##### 3. Question

The systematic reduction of logic circuits is accomplished by:

CorrectIncorrect - Question 4 of 30
##### 4. Question

An AND gate with schematic “bubbles” on its inputs performs the same function as a(n)________ gate.

CorrectIncorrect - Question 5 of 30
##### 5. Question

How many gates would be required to implement the following Boolean expression before simplification? XY + X(X + Z) + Y(X + Z)

CorrectIncorrect - Question 6 of 30
##### 6. Question

What is the primary motivation for using Boolean algebra to simplify logic expressions?

CorrectIncorrect - Question 7 of 30
##### 7. Question

How many gates would be required to implement the following Boolean expression after simplification? XY + X(X + Z) + Y(X + Z)

CorrectIncorrect - Question 8 of 30
##### 8. Question

AC + ABC = AC

CorrectIncorrect - Question 9 of 30
##### 9. Question

Which Boolean algebra property allows us to group operands in an expression in any order without affecting the results of the operation [for example, A + B = B + A]?

CorrectIncorrect - Question 10 of 30
##### 10. Question

When grouping cells within a K-map, the cells must be combined in groups of ________.

CorrectIncorrect - Question 11 of 30
##### 11. Question

Use Boolean algebra to find the most simplified SOP expression for F = ABD + CD + ACD + ABC + ABCD.

CorrectIncorrect - Question 12 of 30
##### 12. Question

Occasionally, a particular logic expression will be of no consequence in the operation of a circuit, such as a BCD-to-decimal converter. These result in ________terms in the K-map and can be treated as either ________ or ________, in order to ________ the resulting term.

CorrectIncorrect - Question 13 of 30
##### 13. Question

The NAND or NOR gates are referred to as “universal” gates because either:

CorrectIncorrect - Question 14 of 30
##### 14. Question

Converting the Boolean expression LM + M(NO + PQ) to SOP form, we get ________.

CorrectIncorrect - Question 15 of 30
##### 15. Question

A Karnaugh map is a systematic way of reducing which type of expression?

CorrectIncorrect - Question 16 of 30
##### 16. Question

Which statement below best describes a Karnaugh map?

CorrectIncorrect - Question 17 of 30
##### 17. Question

Which of the examples below expresses the distributive law of Boolean algebra?

CorrectIncorrect - Question 18 of 30
##### 18. Question

Which of the following is an important feature of the sum-of-products (SOP) form of expression?

CorrectIncorrect - Question 19 of 30
##### 19. Question

An OR gate with schematic “bubbles” on its inputs performs the same functions as a(n)________ gate.

CorrectIncorrect - Question 20 of 30
##### 20. Question

Which of the examples below expresses the commutative law of multiplication?

CorrectIncorrect - Question 21 of 30
##### 21. Question

The expression W(X + YZ) can be converted to SOP form by applying which law?

CorrectIncorrect - Question 22 of 30
##### 22. Question

The commutative law of addition and multiplication indicates that:

CorrectIncorrect - Question 23 of 30
##### 23. Question

Which of the following combinations cannot be combined into K-map groups?

CorrectIncorrect - Question 24 of 30
##### 24. Question

A variable is a symbol used to represent a logical quantity that can have a value of 1 or 0.

CorrectIncorrect - Question 25 of 30
##### 25. Question

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

CorrectIncorrect - Question 26 of 30
##### 26. Question

In Boolean algebra, A + 1 = 1.

CorrectIncorrect - Question 27 of 30
##### 27. Question

The product-of-sums (POS) is basically the ORing of ANDed terms.

CorrectIncorrect - Question 28 of 30
##### 28. Question

SOP stands for sum-of-powers.

CorrectIncorrect - Question 29 of 30
##### 29. Question

The VHDL editor provided with a schematic editor development system will produce a file with the extension .vhd, which can be used by the simulator to test the output of the logic design.

CorrectIncorrect - Question 30 of 30
##### 30. Question

In the commutative law, in ORing and ANDing of two variables, the order in which the variables are ORed or ANDed makes no difference.

CorrectIncorrect