LAB 10 - LOGIC GATES AND BOOLEAN

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

1/33

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.

34 Terms

1
New cards

Purpose of AND gate

Return 1 if both inputs are 1

2
New cards

Purpose of OR gate

Return 1 if either input is 1 or both are 1

3
New cards

Purpose of NOT gate

Inverse

4
New cards

Purpose of NOR gate

Combination of NOT and OR: return 1 if both inputs are not 1.

5
New cards

Purpose of NAND gate

Combination of NOT and AND: return 1 if either input is 0.

6
New cards

Purpose of XOR gate

  • Used to perform modulo sum.

  • To check difference:

    • If both inputs are odd → return 1.

    • If both inputs are similar → return 0.

7
New cards

Purpose of XNOR gate

  • Used to compare 2 inputs.

  • Return 1 if both inputs are equivalent.

  • Return 0 if both inputs are different.

8
New cards
term image

AND gate

9
New cards
term image

OR gate

10
New cards
term image

NOT gate

11
New cards
term image

NOR gate

12
New cards
term image

NAND gate

13
New cards
term image

XOR gate

14
New cards
term image

XNOR gate

15
New cards

Combinational system

  • Has no memory component.

  • Output depends only on the present input and present state.

16
New cards

Sequential system

  • Store and use previous state information to determine their next state.

  • Produce output based on current input and previous output variables.

  • Include memory elements.

17
New cards

The result of X.1 and X + 0

X and X

18
New cards

The result of X.0 and X + 1

0 and 1

19
New cards

The result of X.X’ and X + X’

0 and 1

20
New cards

The result of X.X and X + X

X and X

21
New cards

The result of X + X.Y and X(X + Y)

X and X

22
New cards

3 methods of simplification

Boolean, Karnaugh, and McCluskey

23
New cards

Truth table

  • (n + 1) columns with the last column as the ouput.

  • 2^n rows of each combination of variables

24
New cards

Cells of a Karnaugh map

  • Each cell is a row of combination of variables in truth table.

  • Each cell stores the output of f() at the corresponding row in the truth table.

25
New cards

Adjacent cells in Karnaugh map

Must only different in 1 variable when it comes to 2 adjacent cells.

26
New cards

Loop characteristic

Cell at the head and tail of column/row can be adjacent of each others since they are only different in 1 variable.

27
New cards

How many cells can we group in a group in Karnaugh map?

2^i cells, meaning that we can group (2, 4, 8, 16, …) cells.

28
New cards

The process of simplifying in Karnaugh map

  1. Group those cells that = ‘1’.

  2. Look for variable that change throughout each cell. If it changes, get rid of it.

  3. Look for variable that does not change, keep it.

  4. Then we can have a simplified function by summing up the simplified terms.

29
New cards

30
New cards
31
New cards
32
New cards
33
New cards
34
New cards