1.4.3 Boolean algebra - Ali Flashcards

1
Q

Name all the logic gates in A-Level specification

A

.NOT
.AND
.OR
.XOR

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

Draw a NOT gate with input labelled as A and output as Q

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

Write the truth table for a NOT gate

A

Input A - Output Q
0 1
1 0

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

Draw an AND gate with input labelled as A and B and output as Q

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

Write the truth table for AND gate

A

Input A - Input B - Output Q
0 0 0
0 1 0
1 0 0
1 1 1

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

What is the boolean algabraic expression of NOT gate

A

¬

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

What is the boolean algebraic expression for an AND gate

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

Draw a OR gate with input labelled as A and B and output as Q

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

Write the truth table for an OR gate

A

Input A - Input B - Output Q
0 0 0
1 0 1
0 1 1
1 1 1

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

What is the boolean algebraic expression for a OR gate

A

v

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

Draw a XOR gate with input labelled as A and output as Q

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

Write the truth table for an XOR Gate

A

Input A - Input B - Output Q
0 0 0
1 1 0
1 0 1
0 1 1

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

What is the boolean algebraic expression for a XOR gate

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

Define Boolean

A

Binary True or False

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

Define Boolean algebra

A

Branch of Algebra that deals with binary variables and logic operation

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

What are Karnaugh Maps used for

A

Simplify boolean expressions of 2,3, and 4 inputs

17
Q

Name all Simplifying Boolean algebra

A

. De Morgan Law
. Distribution
. Association
. Commutation
. Double Negation

18
Q

What is De Morgan Law

A

-(A^B) = -AV-B
-(AVB) = -A^-B

19
Q

What is the distribution law

A

A^(BVC) = (A^B)V(A^C)
AV(B^C) = (AVB)^(AVC)
A^(B^C) = (A^B)^(A^C)
AV(BVC) = (AVB)V(AVC)

20
Q

What is the association law

A

(A^B)^C = A^(B^C) = A^B^C
(AVB)VC = AV(BVC) = AVBVC

21
Q

What is the Commutation law

A

AVB = B^A
A^B = BVA

22
Q

What is the double negation law

23
Q

What are adders

A

When logic gates are physically combined to be used for addition in CPU

24
Q

What are the types of adders?

A

Full adder
Half adder

25
What is a half adder
Uses two inputs, a sum and carry output
26
When is half adders used
For simplistic addition
27
What are full adder
Uses 3 inputs, A, B and carry in from previous additions
28
When is full adders used
For complex additions
29
What are D-type flip flop
Logic circuit which can ​store the value of one bit
30
What do D-type flip flop contain
2 inputs, a control signal and clock
31
What is the purpose of the clock in D Type Flip Flop
Regular pulse generated by CPU which used to coordinate the computers components
32
What does the clock pulses do
Rise and fall
33
What do edges be classified as
rising or falling
34
How can the output of d type flip flop change
at resigning edge, the start of clock tick
35
What do logic circuit use
4 NAND gates
36