Logic Gates Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

Which logic gate is this?

A

Exclusive Disjunction (XOR)

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

What is the equation symbol for conjunction?

A

∧ (AND)

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

Which is the truth table for AND?

A

A B | A ∧ B

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

0 0 | 0

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

0 1 | 0

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

1 0 | 0

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

1 1 | 1

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

What will the value of Y be in this logic circuit if A = 1 and B = 0?

A

Y = 1

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

State De Morgan’s laws.

A
  1. ¬(A ∧ B) = ¬A ∨ ¬B
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q
  1. ¬(A ∨ B) = ¬A ∧ ¬B
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Simplify the Boolean expression A ∨ (A ∧ B).

A

A

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

Apply one of De Morgan’s laws to the Boolean expression ¬(A ∨ B).

A

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

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

What is the purpose of a D-type flip flop?

A

To store the value of a single bit.

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

When is the stored value in a D-type flip flop updated?

A

On the rising edge of the clock signal.

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

What is the logic circuit for a half adder?

A

A half adder can be constructed using an XOR gate for sum and an AND gate for carry.

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

Apply a distributive rule to the Boolean expression A ∨ (A ∧ B).

A

A ∨ (A ∧ B) = A.

17
Q

Complete the truth table for a full adder.

A

Truth table for a full adder:

18
Q

A B Cin | Cout Sum

A
19
Q

0 0 0 | 0 0

A
20
Q

0 0 1 | 0 1

A
21
Q

0 1 0 | 0 1

A
22
Q

0 1 1 | 1 0

A
23
Q

1 0 0 | 0 1

A
24
Q

1 0 1 | 1 0

A
25
Q

1 1 0 | 1 0

A
26
Q

1 1 1 | 1 1.

A