Chapter 5

Question 1

2 types of Logic Systems

Answer 1

1. Combinational Circuit
2. Sequential Circuit

Question 2

• Consists of Logic gates only
• The output is dependent only on the input of the logic levels.

Answer 2

Combinational Circuit

Question 3

• Consists of logic gates and Memory elements.
• The output of the system is not only dependent on its inputs but also dependent on the present state of the output which is stored in its memory.

Answer 3

Sequential Circuit

Question 4

The characteristic of a logic circuit allows us to use Boolean Algebra as a tool for analyzing and designing a digital circuit or a digital system.

Readings

Question 5

________________ is a simple mathematical tool that allows us to describe the relationship between a logic circuits output to its input. It is represented by algebraic equation also called the _______________

Answer 5

Boolean algebra, Boolean expression.

Question 6

A Boolean variable is a quantity that may be equal to either ________

Answer 6

0 or 1.

Question 7

A _______________ are often used to represent the voltage level present on a wire or the input and output terminals of a given logic circuit.

Answer 7

Boolean variable

Question 8

In boolean algebra, ___________ is a symbol used to represent an action, a condition, or data. A single variable can only have a value of 1 or 0.

Answer 8

Variable

Question 9

represents the inverse of a variable and is indicated with an overbar or a prime (‘). So the complement of A is A’.

Answer 9

Complement

Question 10

A __________ is a variable or its complement.

Answer 10

Literal

Question 11

In Boolean algebra, ______________ is equivalent to the ______ operation. The product of literals forms a product term. The product term will be 1 only if all of the literals are 1.

Answer 11

multiplication, AND

Question 12

The Theorems in Boolean algebra are very useful especially when we need to simplify a ____________________. Using this technique we can transform the given into a meaningful equivalent expression.

Answer 12

complex Boolean Expression

Question 13

are applied to addition and multiplication.

Answer 13

Commutative Laws

Question 14

These law indicates that the order in which we ORed or ANDed the two variables is not important; the result is the same.

Answer 14

Commutative Laws

Question 15

are also applied to addition and multiplication.

Answer 15

Associative Laws

Question 16

This theorem states that we can group the variable in an AND expression or OR expression in any way we want.

Answer 16

Associative Laws

Question 17

is the factoring law.

Answer 17

Distributive Law

Question 18

These law states that an expression can be expanded by multiplying term by term just like in ordinary algebra. And also a common variable can be factored from an expression.

Answer 18

Distributive Law

Question 19

Two of the most important theorems of Boolean algebra were contributed by a great mathematician named De Morgan.

Answer 19

DeMorgan’s 1st Theorem, DeMorgan’s 2nd Theorem

Question 20

“The complement of a product of variables is equal to the sum of the complemented variables.”

Answer 20

DeMorgan’s 1st Theorem

Question 21

“The complement of a sum of variables is equal to the product of the complemented variables.”

Answer 21

DeMorgan’s 2nd Theorem

Question 22

Any expression can be implemented by the basic logic gates; AND, OR and Inverter gate. But it is also possible that these three basic logic gates are implemented using NAND gate and NOR gate. That is why it is called the _______________

Answer 22

Universal gates.