Logic Gates Flashcards

1
Q

What are the three most basic logical operations?

A

AND, OR, NOT

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the output of an AND operation for inputs 1 and 0?

A

0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the output of an OR operation for inputs 0 and 1?

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the output of a NOT operation for input 0?

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Fill in the blank: A truth table of a Boolean function lists the output values for every possible _______.

A

input value combination

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What does a combinational logic function output if more inputs are 1 than 0?

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the alternative symbol for the AND logic function?

A

∧ or &

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the alternative symbol for the OR logic function?

A

∨ or |

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the alternative symbol for the NOT logic function?

A

¬ or ‘ or ! or ~

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What defines Boolean algebra?

A

Algebra over two elements: 0 and 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What are the two binary operations in Boolean algebra?

A

+ and ∙

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is the result of 1’ in Boolean algebra?

A

0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the result of 0’ in Boolean algebra?

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Who is the inventor of Boolean logic?

A

George Boole

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is the priority order of Boolean operators from high to low?

A

Parentheses, NOT, AND, OR

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What does the duality principle state?

A

The dual of any true statement is also a true statement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

What is the commutative law in Boolean algebra?

A

x ∙ y = y ∙ x and x + y = y + x

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

What does DeMorgan’s Theorem state for (x ∙ y)’?

A

x’ + y’

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

What does the absorption law state for x ∙ (x + y)?

A

x

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

What is the result of x ∙ x’?

A

0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

What is the result of x + x’?

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

What is the output of a NAND gate for inputs 1 and 1?

A

0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

What is the output of a NOR gate for inputs 0 and 0?

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Fill in the blank: Boolean functions can often be expressed in _______ forms.

A

canonical

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

What is the result of 1 + x in Boolean algebra?

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

What is the result of 0 ∙ x in Boolean algebra?

A

0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

What is the associative law in Boolean algebra?

A

x ∙ (y ∙ z) = (x ∙ y) ∙ z and x + (y + z) = (x + y) + z

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

True or False: Two Boolean expressions may specify the same function.

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
29
Q

What is the output of an OR operation for inputs 1 and 0?

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
30
Q

What does the annihilation law state for 0 ∙ x?

A

0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
31
Q

What is the output of an AND operation for inputs 0 and 0?

A

0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
32
Q

What is a truth table used for in Boolean functions?

A

To list output values for every possible input combination

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
33
Q

What is the result of the expression x ∙ (y + z)?

A

x ∙ y + x ∙ z

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
34
Q

What is the result of (x + y)’?

A

x’ ∙ y’

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
35
Q

What are some applications of Boolean algebra?

A

Set theory, mathematical logic, digital system design

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
36
Q

What is a minterm?

A

An AND term consisting of all the variables in their normal form or complement form

For two binary variables x and y, the minterms are xy, xy’, x’y, x’y’.

37
Q

What is a maxterm?

A

An OR term consisting of all the variables in their normal form or complement form

Also called standard sums.

38
Q

What is the number of minterms for n variables?

A

2^n

This indicates the possible combinations of the variables.

39
Q

What is the Absorption Property in Boolean algebra?

A

x ∨ (x ∧ y) = x

40
Q

What is the Idempotence Law in Boolean algebra?

A

x = x ∨ x

41
Q

What is the Sum of Minterms Form?

A

A Boolean function expressed as a sum of minterms that produce output 1

Example: f1 = x’y’z + xy’z’ + xyz = m1 + m4 + m7.

42
Q

What is the Product of Maxterms Form?

A

The complement of a function expressed as a product of maxterms that produce output 0 for the original function

Example: If f = m1 + m4 + m7, then f’ = m0 + m2 + m3 + m5 + m6.

43
Q

What are Canonical forms in Boolean algebra?

A

Forms that can be expressed as a sum of minterms or a product of maxterms.

44
Q

What is DeMorgan’s theorem?

A

It provides a way to express the complement of a function in terms of its minterms and maxterms.

45
Q

What is the difference between Sum-of-Products (SOP) and Product-of-Sums (POS)?

A

SOP form is a sum of products of literals; POS form is a product of sums of literals.

46
Q

What does a module in Verilog represent?

A

A basic unit of design in hardware description language (HDL)

It contains declarations for inputs, outputs, and internal signals.

47
Q

What does the assign statement do in Verilog?

A

It creates a continuous assignment to a wire signal.

48
Q

What is the output of a three-input majority function in Verilog?

A

It outputs true when at least two of the three inputs are true.

49
Q

Fill in the blank: A logical function can be represented by a _______.

A

logic diagram (schematic)

50
Q

What is the significance of the wire type in Verilog?

A

It represents a signal type that is continuously driven by an assign statement or connected to a module output.

51
Q

What does the always block do in Verilog?

A

It allows for the evaluation of conditions whenever the specified signals change.

52
Q

True or False: The SOP/POS form of a function is unique.

53
Q

What is the purpose of a testbench in Verilog?

A

To simulate the behavior of the design and verify its functionality.

54
Q

What does the case statement do in Verilog?

A

It allows for multiple conditions to be checked and corresponding outputs to be assigned.

55
Q

What is a Hardware Description Language (HDL)?

A

A language used to describe the structure and behavior of electronic circuits.

56
Q

Fill in the blank: The output of a majority function is true when _______.

A

at least two of the three inputs are true.

57
Q

What does the term ‘combinational logic’ refer to in Verilog?

A

Logic where the output depends only on the current inputs.

58
Q

What is an always block in Verilog?

A

An always block is a continuous procedural block that gets triggered each time a signal in its sensitivity list changes.

59
Q

What does the case statement do in Verilog?

A

The case statement selects values based on the expression provided, allowing for multiple conditions to be evaluated.

60
Q

What does the default case cover in a Verilog case statement?

A

The default case covers values not listed in the case statement.

61
Q

What is one characteristic of combinational modules in Verilog?

A

Combinational modules use only assign statements, case or casex statements, if-else statements within an always block.

62
Q

What should be avoided in Verilog combinational modules?

A

Do not use loops.

63
Q

What is the guideline for naming signals in Verilog?

A

Use meaningful signal names, such as tempHigh instead of th.

64
Q

What is the recommended length for leaf modules in Verilog?

A

Leaf modules should not be more than 40 lines.

65
Q

What is the importance of comments in Verilog code?

A

to clarify the code.

66
Q

What should activation lists for case statements include?

A

Activation lists should include ALL inputs or use ‘*’.

67
Q

When should constants be defined in Verilog?

A

All constants should be defined if used more than once.

68
Q

How should buses (multi-bit signals) be numbered?

A

Buses should be numbered high to low.

69
Q

What is the preferred signal state for all signals in Verilog?

A

All signals should be high-true, except primary inputs and outputs.

70
Q

What should you do if you can’t visualize the logic your Verilog will generate?

A

If you can’t visualize it, the result will not be pretty.

71
Q

What is Boolean algebra used for?

A

Boolean algebra is used to manipulate logic equations.

72
Q

What does Verilog describe?

A

Verilog describes hardware for simulation and synthesis.

73
Q

Fill in the blank: Logic diagrams represent _______.

A

[logic equations]

74
Q

True or False: Logic gates can be represented in Verilog.

75
Q

Mention Identity Axiom

A

1.X=X, 0+X=X

76
Q

Mention Annihilation Axiom

A

1+X=1, 0.X=0

77
Q

Mention Associative Theorem

A

X(YZ)=(XY)Z, (X+Y)+Z=X+(Y+Z)

78
Q

Mention Distributive Law

A

X(Y+Z)=XY+XZ, X+(YZ)=(X+Y).(X+Z)

79
Q

What theorem is this?
X.X=X
X+X=X

A

Idempotence

80
Q

What Theorem is this?
X.X’=0
X+X’=1

A

Complementation

81
Q

Mention Absorption Theorem

A

X(X+Y)=X, X+(XY)=X

82
Q

What Theorem is this?
XY+XY’= X
(X+Y)(X+Y’)=X

83
Q

Mention the De Morgan’s Theorem

A

(XY)’= (X+Y)’
(X’+Y’)=X’Y’

84
Q

What Theorem is this?
(X’)’=X

A

Involution

85
Q

What Theorem is this?
(XY) + (X’Z)+(YZ)=XY+X’Z
(X+Y)(X’+Z)(Y+Z)=(X+Y)(X’+Z)

86
Q

To prove a Boolean equation we can use? The method is called?

A

Case or Truth table, Perfect Induction

87
Q

Give me the equation for Exclusive OR (XOR)

A

X’Y+XY’

88
Q

Give me the equation for The negated version of XOR

A

XY+X’Y’

89
Q

What other gates do we have other than AND, OR, & NOT

A

NOR, NAND, XOR