Lec2. Boolean algebra Flashcards

1
Q

A function from S to S is also called a ____ on S

A

unary operation

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

A function from S^2 to S is called a _____ on S

A

binary operation

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

True/False: unary operation and binary operation assuming that DOD = domain

A

true

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

notion for unary operation?

A

~

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

True/False: ~u= u^ ~ = ~(u)

A

false - the first 2 is true but the last one is false

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

Notation for binary operation?

A

any symbol

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

True/False: u * v = *((u,v))

A

False

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

State the idempotent property

A

for any u in S we have u★u=u

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

State the commutative property

A

for any (u,v0 in S^2 we have u★v=v★u

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

State the associate property

A

for any (u,v,w) in S^3 we have u★(v★w) =(u★v)★w

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

Example of commutative and associative

A

+, x, min, and max

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

Example of idempotent

A

average of 2 equal numbers, min, max

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

State the distribute property: ★ is distribute over *

A

for any (u,v,w) in S^3 we have u★ (vw) = (u★v) * (u ★ w) and (vw) ★ u = (vu) ★ (wu)

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

Example of distributive

A

x is distribute over +, min is distribute over max and vice versa

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

State the neutral element

A

n is a neutral / zero element for ★ if n ★ u = u ★ n = u for any u in S

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

State the absorbing element

A

a is a absorbing / unit element for ★ if u ★ a = u ★ a = a for any u in S

18
Q

True/False: If m∈S and n∈S are neutral elements for ★ then m=n.

A

true

19
Q

True/False: If a∈S and b∈S are absorbing elements for ★ then a=b.

A

true

20
Q

precedence rule?

A

bracket > unary > binary

21
Q

Defining a boolean algebra (B, + , ^ , -)

A

4 tuple
B is a set (of anything)
+ and ^ are binary operations on B
- is a unary operation on B
there are 2 distinct elements 0 and 1 such that 0 is a neutral element for + and 1 is a neutral element for ^

22
Q

fundamental law of boolean algebra

A

identity, commutative, associative, distributive, complement

23
Q

Derived from fundamental law

A

double complement, domination, idempotent, de Morgans

24
Q

What is boolean value?

A

an element of B

25
Q

What is a boolean variable?

A

variable that represents an element of B

26
Q

Domain of the boolean function is?

A

2^k = # rows in a table

27
Q

Range of a boolean function?

A

{0,1}

28
Q

define literal?

A

boolean variable or its complement

29
Q

define minterm of degree n ∈ N*?

A

product of n literals
all input must appear but ONCE time only

30
Q

define maxterm of degree n ∈ N*?

A

sum of n literals

31
Q

define CNF, and what violate CNF form?

A

product of sum literal
(d1) (d2) (d3)
- complement can only apply to single variable
- no multiplication within a clause

32
Q

define DNF, and what violate DNF form?

A

sum of product literal
c1 + c2 + c3
- complement can only apply to single variable
- no addition within a term

33
Q

What is boolean function?

A

adding all the midterms (like DNF)

34
Q

What is functionally complete?

A

{addition, complement}, {multiplication, complement}, NAND, NOR

35
Q

True/False: u and u^ - are minterm of degree 1

A

true

36
Q

True/False: u + v ^- are minterm of degree 2

A

false, maxterm

37
Q

True/False: u. v. w are minterm of degree 1

A

false, degree 3

38
Q

True/False: u + u^- are maxterm of degree 2

A

false, neither minterm nor maxterm since 2 literals for the same variable

39
Q

True/False: (u.v)^- are minterm of degree 2

A

false, not minterm nor maxterm since that is not a literal

40
Q

When 2 boolean expressions are equivalent?

A

yielding the same truth table

41
Q

duality principle

A

interchanging unit with zero element and a binary expression with another one

42
Q

duality and equivalent

A

if the 2 expressions are equivalent, then they are dual expressions also equivalent