Boolean Algebra Flashcards

1
Q

¬(¬A) =

A

A

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

A∧ ¬A =

A

0

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

A∨ ¬A =

A

1

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

De Morgan’s Law (first)

A

¬ (A∨B) = (¬ A) ∧(¬ B)

NOT (A OR B) is the same as (NOT A) AND (NOT B)

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

Distribution LAW (OR)

A

A∧(B∨C)=(A∧B)∨(A∧C)

A AND (B OR C) is the same as (A AND B) OR (A AND C)

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

Distribution LAW (AND)

A

A∨(B∧C)= (A∨B)∧(A∨C)

A OR (B AND C) is the same as (A OR B) AND (A OR C)

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

Association LAW (OR)

A

A∨(B∨C)=(A∨B)∨C= A∨B∨C

A OR (B OR C) is the same as (A OR B) OR C is the same as A OR B OR C

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

Association LAW (AND)

A

A∧(B∧C)=(A∧B)∧C= A∧B∧C

A AND (B AND C) is the same as (A AND B) AND C is the same as A AND B AND C

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

Commutation LAW AND

A

A∧B = B∧A

The order in which two variables are AND’ed makes no difference

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

Commutation LAW OR

A

A∨B = B∨A

The order in which two variables are OR’ed makes no difference

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

Absorption Law AND

A

A∨(A∧B) = A

A OR (A AND B) is the same as A

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

Absorption Law OR

A

A∧(A∨B)=A

A AND (A OR B) is the same as A

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

X∧0=

A

0

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

X∧1=

A

X

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

X∧X=

A

X

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

X∧¬X=

A

0

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

X∨0 =

A

X

18
Q

X∨1 =

A

1

19
Q

X∨X=

A

X

20
Q

X∨¬X=

A

1

21
Q

What does “AND” do?

A

The output it true if both inputs are true, else its false

used for multiplication

22
Q

What does OR do?

A

The output is true if 1 or both inputs are true, else the output is false

used for addition

23
Q

What does NOT do?

A

reverses the input

24
Q

What does XOR do?

A

The output is true if one input is true, else the output is false

25
Q

What is De Morgan’s Law (second)?

A

¬(A∧B) = (¬ A)∨(¬ B)

NOT (A AND B) is the same as (NOT A) OR (NOT B)

26
Q

What are the Karnaugh map rules?

A

no zeros in the blocks
no diagonal blocks
groups as large as possible
groups contain 2^n blocks
overlapping blocks are allowed
wrap around blocks are allowed
aim for the smallest number of groups

27
Q

what is the use of a Half adder?

A

adds two bits

28
Q

what are the Half adder outputs/inputs?

A

inputs: the two bits to be added
outputs: the result and the carry

29
Q

what are the two logic gates in a half adder?

A

XOR (to the sum)

AND (to the carry)

30
Q

what are the limitations of a half-adder?

A

can only add one bit numbers

  • only two inputs, the carry from a previous addition can’t be incorperated
31
Q

what does a Full adder do?

A

combines two half adders, used to add a series of bits

32
Q

what are the Full adder inputs/outputs

A

Inputs: the two bits to add, the previous carry bit
outputs: the result, the carry

33
Q

what is meant by Flip flop?

A

elemental sequential logic circuit that can store one bit and flip between two states

34
Q

what are the uses of Flip Flop?

A

used as a memory cell to store the state of a bit

35
Q

what is meant by a clock?

A

sequential circuit that changes state at regular time intervals

36
Q

what are the uses of a clock?

A

synchronise the change of state of flip flop circuits

37
Q

flip flop clock diagrams

A

on each rising edge of the clock change the result to whatever the input is (it may not need changing)

38
Q

example uses of flip flops

A

in registers
- static RAM

39
Q

flip flop logic gates

A

Two NAND gates with two inputs. The result of of each is the second input for the other.

40
Q

What is meant by a D-type flip flop

A

two flip flops combined

41
Q

how is a full adder different to a half adder?

A

a full adder is two half adders which is able to add 4-bit binary numbers.

42
Q

how can yuou make a full adder?

A

2 half adders can be joined together with an “OR” gate to form a full adder