1.4.3 Flashcards

1
Q

Which logic gate is this truth table representing?

A

XOR

Only 1 single input can be true

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

Which logic gate is this truth table representing?

A

AND

Both inputs must be true

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

Which logic gate is this truth table representing?

A

OR

At least one input needs to be true

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

Which logic gate is this truth table representing?

A

NAND

The flip of the AND gate - both inputs must not be true

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

Which logic gate is this truth table representing?

A

NOR

The flip of an OR gate - both inputs need to be false

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

Which logic gate is this truth table representing?

A

NOT

Inverts the input

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

What would the logic circuit look like for this truth table?

A

Half-Adder

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

What are the Boolean expressions for the following circuit?

A

S = (A V B) V Cin

COUT = ((A V B) Λ Cin) V (A Λ B)

Full Adder

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

How big would the expressions be for each of the following group sizes on a Karnaugh map?

  • Group of 8
  • Group of 4
  • Group of 2
  • Group of 1
A

8 = Evaluates to single expression (A)

4 = Evaluates to two expressions (A Λ B)

2 = Evaluates to three expressions (A Λ B Λ C)

1 = Evaluates to four expressions (A Λ B Λ C Λ D)

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

What would be the simplified expression for this Karnaugh map?

A

(NOT A and NOT D)

OR

(A AND B AND C)

OR

(NOT B AND NOT C AND NOT D)

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

What can an adder do that a half-adder cannot?

A

Half-adder only handles 2 inputs so cannot handle previous carries

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

What are the key facts about D-Type flip flops?

A

Data Input (D) can be at 1 or 0

Output (Q) can only change at a clocks rising edge (goes high)

When clock is high output(Q) changes to input (D)

Triggered by a clock pulse

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

What are the De Morgan’s Laws?

A

Each term is complemented, and then the ORs become ANDs, and
the ANDs become ORs

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

What is commutation?

A

It doesn’t matter which way around expressions go,
they mean the same thing both ways

X ^ Y = Y ^ X

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

What is association?

A

It doesn’t matter how we group the numbers it will produce the same answer.

X ^ (Y ^ Z) = (X ^ Y) ^ Z

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

What is absorption?

A

The operators inside and outside must be different and the term outside must also be inside.

X v (X ^ Y) = X

17
Q

What is double negation?

A

If you invert something twice, you return to the original value.

¬¬X = X

18
Q

What is distribution?

A

These are similar to the way multiplying out brackets works. 5 x (6 + 2) is the same as (5 x 6) + (5 x 2).

X ^ (Y v Z) = (X ^ Y) v (X ^ Z)