Title: Theory / Unimportant / CS / Hardware / Structured computer organization - Tanenbaum, Austin / 3 The Digital Logic Level
Tags: fromAlgorithm hasNotNewEffectReturnsMeaning computer_to_instruction récupéré hasSeenConjDef oldAlgoNewName seen_description

Name: A digital circuit
Definition: A circuit in which only two logical values are present.
Page: 148
Chapter: 3
Section: 1.1

Name: Classical representation of 0
Definition: A signal between 0 and 0.5 volt
Page: 148
Chapter: 3
Section: 1.1
Context: Circuit

Name: Classical representation of 1
Definition: A signal between 1 and 1.5 volt
Page: 148
Chapter: 3
Section: 1.1
Context: Circuit

Name: Gate
Definition: Tiny electronic device which compute various functions of two-valued signals.
Page: 148
Chapter: 3
Section: 1.1
Context: Circuit

Page: 148
Section: 1.1
Chapter: 3
Name: Inverter
Returns: Not gate
Context: Circuit

Page: 148
Section: 1.1
Chapter: 3
Effect: Nand gate

Page: 149
Effect: Nor gate
Chapter: 3
Section: 1.1

Name: An externally regulated voltage
Page: 148
Chapter: 3
Section: 1.1
Denoted by: \(V_{cc}\)

Page: 148, 149
Section: 1.1
Chapter: 3
Effect: Nor gate

Page: 149
Effect: And gate
Chapter: 3
Section: 1.1

Name: Inversion bubble
Definition: Indicate that the content of the wire/gate input/gate output is negated
Page: 149
Chapter: 3
Section: 1.1
Context: Circuit

Name: Boolean algebra
Definition: The algebra with two values, 0 and 1
Page: 150
Chapter: 3
Section: 1.2
Name2: Switching algebra

Name: Its truth table
Definition: The table whose column \(n\) are labelled with input, and last column with output. Each line state the value of an input, and the associated output.
Page: 150
Chapter: 3
Section: 1.2
Variables: \(f\) a Boolean function with \(n\) input

Question: The number of Boolean functions with \(n\) inputs is
Answer: \(2^n\).
Page: 150
Chapter: 3
Section: 1.2

Definition: The negation of \(A\)
Page: 152
Chapter: 3
Section: 1.2
Variables: \(A\) a Boolean variable
Notation: \(\overline A\)

Definition: The and of \(A\) and \(B\)
Page: 152
Chapter: 3
Section: 1.2
Variables: \(A,B\) Boolean terms
Notation: \(AB\)

Smaller0: \(\overline{\sum A_i}\)
Greater0: \(\Pi\overline{A_i}\)
Page: 155
Chapter: 3
Section: 1.4
Variables: \(A_i\) be some Boolean terms
Smaller to greater: =
Name: De Morgan Law

Smaller0: \(\sum{\overline A_i}\)
Greater0: \(\overline{\Pi A_i}\)
Page: 155
Chapter: 3
Section: 1.4
Variables: \(A_i\) be some Boolean terms
Smaller to greater: =
Name: De Morgan Law

Question: \(1A\)
Answer: \(=A\)
Page: 156
Chapter: 3
Section: 1.4
Variables: \(A\) be some Boolean term
Name: Identity law

Question: \(0A\)
Answer: \(=0\)
Page: 156
Chapter: 3
Section: 1.4
Variables: \(A\) be some Boolean term
Name: Null law

Question: \(AA\)
Answer: \(=A\)
Page: 156
Chapter: 3
Section: 1.4
Variables: \(A\) be some Boolean term
Name: idempotent law

Question: \(A\overline A\)
Answer: \(=0\)
Page: 156
Chapter: 3
Section: 1.4
Variables: \(A\) be some Boolean term
Name: Inverse law

Question: \(A(A+B)\)
Answer: \(=A\)
Page: 156
Chapter: 3
Section: 1.4
Variables: \(A,B\) be some Boolean term
Name: Absorption law

Question: \(A+AB\)
Answer: \(=A\)
Page: 156
Chapter: 3
Section: 1.4
Variables: \(A,B\) be some Boolean term
Name: Absorbtion law

Question: \(0+A\)
Answer: \(=A\)
Page: 156
Chapter: 3
Section: 1.4
Variables: \(A\) be some Boolean term
Name: Null law

Question: \(1+A\)
Answer: \(=1\)
Page: 156
Chapter: 3
Section: 1.4
Variables: \(A\) be some Boolean term

Question: \(A+A\)
Answer: \(=A\)
Page: 156
Chapter: 3
Section: 1.4
Variables: \(A\) be some Boolean term
Name: Idempotent law

Question: \(A+\overline A\)
Answer: \(=1\)
Page: 156
Chapter: 3
Section: 1.4
Variables: \(A\) be some Boolean term

Name: Commutative law
Definition: \(AB=BA\)
Page: 156
Chapter: 3
Section: 1.4
Variables: \(A,B\) be some Boolean term
Definition2: \(A+B=B+A\)

Name: Associative law
Definition: \(A(BC)=(AB)C\)
Page: 156
Chapter: 3
Section: 1.4
Variables: \(A,B\) be some Boolean term
Definition2: \(A+(B+C)=(A+B)+C\)

Smaller0: \(A+(BC)\)
Greater0: \(AB+AC\)
Page: 156
Chapter: 3
Section: 1.4
Smaller to greater: =
Name: Distributive law
Context: Boolean logic

Smaller0: \(A(B+C)\)
Greater0: \((A+B)(A+C)\)
Page: 156
Chapter: 3
Section: 1.4
Smaller to greater: =
Name: Distributive law

Name: Positive logic
Definition: Sending 0 volt to 0 and 1.5 volt to 1
Page: 157
Chapter: 3
Section: 1.4

Name: Negative logic
Definition: Sending 0 volt to 1 and 1.5 volt to 0
Page: 157
Chapter: 3
Section: 1.4