unit 8 Flashcards

(34 cards)

1
Q

how are boolean operators represented as?

A

TRUE or FALSE
1 or 0

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

what does boolean logic refer to?

A

refers to the principles of logic based on binary values

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

what does boolean algebra refer to?

A

the mathematical system used to manipulate Boolean values

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

what are the different types of logic gates?

A

AND, OR, NOT,XOR

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

what is the operation AND?

A

A ^ B

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

what is the operation OR?

A

A v B

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

what is the operation/symbol for NOT?

A

¬A

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

what is the operation for XOR?

A

A (+) B

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

what is the truth table for AND?

A

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
10
Q

what is the truth table for OR?

A

0 0 0
0 1 1
1 0 1
1 1 1

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

what is the truth table for NOT?

A

0 1
1 0

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

what is the truth table for XOR?

A

0 0 0
0 1 1
1 0 1
1 1 0

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

what is the purpose of a karnaugh map?

A

a tool used for simplifying Boolean algebra expressions

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

what are the rules for making groups in a karnaugh map?

A

make rectangular groups, as larger as possible, either 8, 4, 2, 1
groups can overlap and can wrap round

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

what is X AND 0?

A

0

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

What is X AND 1?

17
Q

what is X AND A?

18
Q

what is ¬X and X?

19
Q

what is X OR 0?

20
Q

what is X OR 1?

21
Q

what is X OR A?

22
Q

what is ¬X OR X?

23
Q

what is De Morgan’s Law?

A

¬(A ^ B) = ¬A v ¬B
¬(A v B) = ¬A ^ ¬B

24
Q

what is the distributive law?

A

A ^ (B v C) = (A^B) v (A^C)

Av(B^C) = (AvB) ^ (AvC)

25
what is the associative law?
(A^B)^C = A ^ (B^C) = A ^ B ^ C (AvB)vC = A v (B v C) = A v B v C
26
what is the commutative law?
A ^ B = B ^ A A v B = B v A
27
what is the double negation law?
¬(¬A) = A
28
what is a D type flip flop?
a fundamental component in circuits which contain two stable states used to store the state of 1 bit of data changes state on the edge of the clock pulse
29
what are D type flip flops used in?
used in shift registers, counters and memory units helpful in edge triggered devices
30
what is a half adder circuit?
a basic digital circuit used in computation to perform the addition of two single bit numbers
31
what are the inputs and outputs of a half adder?
two inputs labelled A and B, two outputs labelled as Carry out and Sum
32
what logic gates make up a half adder?
for the sum, A XOR B for the carry out, A AND B
33
what is a full adder?
2 half adders to handle the addition of 3 bits has 3 inputs, A, B and Carry in has 2 outputs Carry out and Sum
34
what logic gates make up a full adder?
A XOR B -> XOR with Cin = Sum A AND B -> OR with (A XOR B AND C in)