CSE Exam 4

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/22

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

23 Terms

1
New cards
<p>Name of gate, when is Y = 1</p>

Name of gate, when is Y = 1

XOR, When A and B are different

2
New cards
<p>Name of gate, when is Y = 1</p>

Name of gate, when is Y = 1

NAND, When A = 0 or B = 0

3
New cards
<p>Name of gate, when is Y = 1</p>

Name of gate, when is Y = 1

NOR, When A = 0 and B = 0

4
New cards
<p>Name of gate, when is Y = 1</p>

Name of gate, when is Y = 1

XNOR, When A and B are the same

5
New cards

A logic circuit is composed of (4 things)

Inputs

Outputs

Functional Specification

Timing Specification

6
New cards

Two types of circuits, two attributes of each (Memory, Outputs determined by)

Combinational Logic

-Memoryless

-Outputs determined by current values of inputs

Sequential Logic

-Has memory

-Outputs determined by previous and current values of inputs

7
New cards

Minterm:

Product that includes all input variables

8
New cards

Maxterm:

Sum that includes all input variables

9
New cards

SOP Form

A sum (OR +) of products (AND *) Where the output is TRUE

10
New cards

POS Form

A product (AND *) of sums (OR +) where the output is FALSE.

11
New cards

A + A̅ =

1

12
New cards

A + 1 =

1

13
New cards

A * A̅ =

0

14
New cards

A + AB =

A

15
New cards

A * 1 =

A

16
New cards

A + BC =

(A+B) * (A+C)

17
New cards

AB + AB̅ =

AA

18
New cards

A + A̅B =

A + B

19
New cards

Three attributes of digital building blocks (Gates, multiplexers, decoders, registers, arithmetic circuits, counters, memory arrays, logic arrays)

Hierarchy, modularity, and regularity

20
New cards

Easiest (preferred) gates to create

NOT, NAND, NOR

21
New cards

Rules of Combinational Composition (3)

-Every element is combinational

-Every node is either an input or connects to exactly one output

-The circuit contains no cyclic paths

22
New cards

Create a decoder from a truth table : procedure

Write SOP boolean expression, create structure with every variable and it’s complement, combine them with AND gates to form every minterm in the SOP expression
N inputs, 2N outputs

23
New cards

Create a multiplexer from a truth table: procedure

Write simplified boolean expression, choose selection variable(s), replace non-selection variables with numbered inputs