Boolean Logic

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

1/48

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.

49 Terms

1
New cards

What notations are for NOT

¬x, x (“-” above the x), x ′

2
New cards

what is an F in NOT

T

3
New cards

What is a T in NOT

F

4
New cards

What are the notations for OR

x ∨ y, x + y

5
New cards

What is FF in OR

F

6
New cards

What is FT in OR

T

7
New cards

What is TF in OR

T

8
New cards

What is TT in OR

T

9
New cards

What are the notations for AND

xy, x . y, x^y

10
New cards

What is FF in AND

F

11
New cards

What is FT in AND

F

12
New cards

What is TF in AND

F

13
New cards

What is TT in AND

T

14
New cards

What are the notations for XOR

x ⊕ y = (x ∧ ¬y) ∨ (¬x ∧ y)

x ⊕ y = xy + xy (with lines over first y and second x)

15
New cards

What is FF in XOR

F

16
New cards

What is FT in XOR

T

17
New cards

What is TF in AND

T

18
New cards

What is TT in XOR

F

19
New cards

What does NOR mean

NOT OR

20
New cards

What are the notations for NOR

x ↓ y = ¬(x ∨ y)

21
New cards

Why is NOR sufficient to construct all functions?

Because NOR is functionally complete, meaning any boolean function can be expressed using only NOR gates. (AND OR NOT can be made using NOR gates)

22
New cards

What is FF in NOR

T

23
New cards

What is FT in NOR

F

24
New cards

What is TF in NOR

F

25
New cards

What is TT in NOR

F

26
New cards

What is NAND

NOT AND

27
New cards

Why is NAND sufficient to construct all functions?

NAND is functionally complete, NAND can create the basic gates (AND, OR, NOT) needed for any logical expression.

28
New cards

What are the notations for NAND

x ↑ y = ¬(x ∧ y)

29
New cards

What is FF in NAND

T

30
New cards

What is FT in NAND

T

31
New cards

What is TF in NAND

T

32
New cards

What is TT in NAND

F

33
New cards

Who is George Boole

Made Boolean Logic Algebra

34
New cards

Boolean Algebra

is a general model for mathematical systems

35
New cards

What values are computes with this BL

two values (T/F), (0/1)

36
New cards

What did Claude Shannon do

showed that for every boolean expression there exists a switching network through which current flows exactly when the expression is true.

37
New cards

George Stibitz

Made first electrical computer, and made model k (boolean logic using electromechanical relays)

38
New cards

What order do we do truth tables?

0011, 0101

39
New cards

what does a half adder do?

Add two 1 bit numbers

40
New cards

what does a full adder do?

Adds 3 numbers: 2 bts and one carry from previous addition.

41
New cards

What is Abstraction

Solid State physics

Transistor circiuits

Logic Desing

Systems design

System Software

Application Software

Theory

42
New cards

Who is Charles Babbage

Made Difference and Analytical Engine

43
New cards

Konrad Zuse

Made first programmable functional computer: z1, z2, z3

44
New cards

Vannevar Bush

Mechanical analog computer—differential analyzer

45
New cards

Howard Aiken

Harvard Mark I—electromechanical machine

46
New cards

J Presper Eckert and John Mauchly

– ENIAC – EDVAC – UNIVAC

47
New cards

Ada Lovelace

Made computer coding

48
New cards

Grace Hopper

Wrote Harvard Mark I manual – Developed early compiler technology – Major influence in COBOL

49
New cards

The ENIAC Six

Jean Jennings Bartik, Kay McNulty Mauchly, Betty Snyder Holburton, Fran Bilas Spence, Marlyn Wescoff Meltzer, and Ruth Lichterman Titlebaum – Hired as human computers, then assigned to the ENIAC – Developed techniques we still use, like breakpoints