1.4.3: Boolean Algebra Flashcards
1
Q
What is a Truth Table?
A
- A table showing every possible output for inputs of a logic gate
2
Q
What are all of De Morgan’s Laws?
A
- A ^ (B V C) = (A ^ B) V (A ^ C)
- A V (B ^ C) = (A V B) ^ (A V C)
- A ^ (B ^ C) = (A ^ B) ^ (A ^ C)
- A V (B V C) = (A V B ) V (A V C)
- (A ^ B) ^ C = A ^ (B ^ C) = A ^ B ^ C
- (A V B) V C = A V (B V C) = A V B V C
3
Q
What is a D-Type Flip Flop?
A
- A type of logic circuit which can store the value of one bit
4
Q
What inputs does a Flip Flop have?
A
- Two inputs: A Control Signal, and a Clock Input
5
Q
What is a Clock Input?
A
- The regular pulse of the CPU used to coordinate operations
- The pulse rises and falls, with edges labelled rising or falling
6
Q
When does the output of a D-Type Flip Flop change?
A
- Only at a Rising Edge, the start of a clock tick
7
Q
What is a Flip Flop?
A
- A basic unit of memory
8
Q
What can Flip Flops be combined to form?
A
- Registers
9
Q
How do Half Adders work?
A
- When both A and B are False, both outputs are False
- When either A or B are True, Sum (S) is True
- When both inputs are True, Carry (C) is True
10
Q
Why can Full Adders be chained together?
A
- Because Full Adders have the Carry input, circuits can be chained together to form Ripple Adders