chapter 4 gates Flashcards

1
Q

what are gates ?

what are circuits?

what are transistors

A

gates: A device that performs a basic operation on electrical
signals

circuits: Gates combined to perform more complicated tasks

transistors: Very small electronic switches that acts like a switch ( open (0) and closed (1))

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

how do you describe the behavior of gates and circuits?

A

3 parts
1.boolean expressions
2.logic diagrams
3.truth tables

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

what are the six types of gates?

A

NOT
AND
OR
XOR
NAND
NOR

NOT Inverts its single input

AND Produces 1 if all input values are 1

OR Produces 0 if all input values are 0

XOR Produces 0 if both input values are the same

NAND Produces 0 if all input values are 1

NOR Produces 1 if all input values are 0

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

what does a NOT gate look like?

what is the expression?

what is the truth table?

how many inputs accepted?

A

Look like : a triangle with a circle on the end

expression: x = A’

truth table
0 1=1
1 1 =0

input: one and returns the complementary (opposite) signal as output

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

what does a AND gate look like?

what is the expression?

what is the truth table?

how many inputs accepted?

A

Look like : a square with a round edge on it

X = AB or X = A . B

everything is zero but 1 + 1 =1

input two signals

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

what does a OR gate look like?

what is the expression?

what is the truth table?

how many inputs accepted?

A

Look: a spear head

X = A + B

everything is 1 but 0+0=0

accepts two inputs

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

what does a XOR gate look like?

what is the expression?

what is the truth table?

how many inputs accepted?

A

looks like a OR gate but with a line before it

X = A (+) B

0+0=0
0+1=1
1+0=1
1+1=0

accepts two inputs signals

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

what does a NAND gate look like?

what is the expression?

what is the truth table?

how many inputs accepted?

A

looks like a AND gate but with a circle at the end

X = (AB)’

everything is 1 but 1+1=10

accepts two inputs

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

what does a NOR gate look like?

what is the expression?

what is the truth table?

how many inputs accepted?

A

looks like a spear head with a circle at the end of it

X + (A+B)’

everything is zero but 0+0=1

accepts two inputs

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

how would you simplify
AB + BC + B’C

A

Solution
AB+ C(B+B’)
AB+C(1)
AB+C

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

how would you simplify

A’B + B’C’ + AB + B’C

A

1) A’B + B’C’ + AB + B’C
a. B(A’+A)+C(B’+B) distributive
b. B(1)+C(1) complment
c. Answer = B+C

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

how would you simplify

xy + xy′

A

a. xx+xy’+xx+yx commutative
b. x(y+y’+y) distributive
c. x(1+y) null elements
d. x(1) =identity
e. answer = x

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

how would you simplify
(x+y)(x+y′)

A

a. xx +xy’+yx+yy’ distributive
b. x+xy’+yx+0 idempotency and complement
c. x(y’+y) distributive
d. x(0) complement
e. answer = x

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

how would you simplify
(A+B)′(A′+B′)′

A

a. A’B’+AB de morgan law
b. A’A+B’+B communtative
c. 0+0 complement
d. Answer 0

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

what is a multiplexer?

A

Multiplexer (or MUX)
A circuit that uses a few input control signals to determine
which of several input data signals is routed to its output
signal

It is nothing but an electronic rotary switch!

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

what does VLSI stand for

A

Very-large-scale integration - more than 100,000

17
Q

what is a half adder?

A

A half adder is a basic binary addition circuit that adds two single-bit binary numbers (A and B) and produces two outputs: the sum (S) and the carry (C).
It doesn’t consider any carry input from previous additions.

The truth table for a half adder is as follows:
A B Sum (S) Carry (C)
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1

18
Q

what is a full adder?

A

A full adder is an extension of the half adder, and it can handle three inputs: A, B, and a carry input (C_in) from a previous addition.
It produces two outputs: the sum (S) and a carry output (C_out).

The truth table for a full adder is as follows:
A B C_in Sum (S) Carry Out (C_out)
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1