Quiz 0 Review Flashcards

(73 cards)

1
Q

variables

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

boolean operations

A

5

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

truth tables

A

evaluating expressions

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

tautology

A

always true (law of excluded middle)

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

DeMorgan Laws

A

not (p or q) = not p and not q
not (p and q) = not p or not q

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

distributive laws

A

r or (p and q) = (r or p) and (r or q)
r and (p or q) = (r and p) or (r and q)

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

predicates

A

statements with variables
P(x) - x is even

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

quantifiers

A

for all and there exists

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

quantifiers DeMorgan Laws

A

not for all P(X) = there exists not P(x)
not there exists P(x) = for all not P(x)

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

notation for sets

A

enumeration: A = {a,b,c}
predicate: A= {x | x is even}

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

set operations (5)

A

union - combine
intersection - common
difference - in one but not the other
complement - everything not in it
cartesian product - pairs of elements

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

empty set

A

A union empty = A
A intersection empty = empty

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

infinite sets
countable vs uncountable

A

countable - listed in sequence
uncountable - real numbers between 0 and 1

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

sequence

A

ordered list, elements can repeat
notation: (a1,a2…) or {an} or (an)

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

set

A

unordered, elements do not repeat
notation: A = {a1,a2…}

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

sequence vs set

A

sequence is order with repeat
set is not ordered and do not repeat

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

relation

A

on A is a subset AxA
how elements relate to each other

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

reflexive

A

for all A, x,x is in A
every element is related to itself

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

symmetric

A

for all x and y, x,y is in A and y,x is in A

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

transmitive

A

for all x,y,z in A, x,y is in A, y,z, is in A so x,z is in A

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

anti symmetric

A

if x,y in A and y,x in R then x=y

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

partial orders

A

relation that is reflexive, anti symmetric, and transmitive

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

posets

A

partially ordered set, set with partial order

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

hasse diagrams

A

representing a partial order by removing reflexive edges and using directed edges to show ordering
1. draw all elements
2. make arrow relations
3. remove self loops
4. remove transitive edges (ab and bc…remove a to c)
5. bottom to top edges and remove all arrows

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
topological sorting
a linear ordering of elements in a directed acyclic graph (DAG) based on a partial order topological - sort is not unique, no closed cycle, linear ordering u to v, u comes before v in ordering at least one topological sort 1. find in-degree of each 2. start with the vertex that in degree=0 3. delete its out edges - new graph 4. do again
26
equivalence relations
relation that is reflexive, symmetric, transitive
27
equivalence classes
set of all elements related to a given statement under an equivalence relation
28
addition rule
union of disjoint sets A and B are disjoint then |AuB| = |A|+|B|
29
multiplication rule
for independent choices one task in m ways and another in n ways, total ways = m x n
30
subsets
number of subsets of a set of n elements is 2^n
31
permutations
order matters - arrange n elements = n!
32
functions
set A to set B (each in A to exactly one in B) - total = B^A
33
k-permutations
selecting k from n, # of ways with order = n!/(n-k)!
34
k-elements subsets(combinations)
without order = n!/k!(n-k)!
35
basic probability
of want / # of total
36
polynomials
degree 2 - quadratic formula, diamond degree 3 - candidates are factors of d, test, then factor out x-# degree 4 - let y=x^2 and solve
37
exponential
b^x
38
logarithmic
log b x what power do i raise b to ger x
39
euler number
e = 2.71828 base of natural log
40
pi
3.14159
41
circumference/diameter for a circle
C= 2pir
42
phi
golden ration = 1.61803 when a line is divided into 2 parts such that ratio of entire length to longer part = ratio of longer to shorter
43
finite arithmetic sequence
difference between consecutive terms is constant an = a1+(n-1)c sn = n(a1+a2)/2...n(n+1)/2
44
finite geometric sequence
each term after the 1st is found by multiplying prev by const r an = a1 x r^n-1 sn = a1 x (1-r^n)/1-r
45
infinite geometric sequences
geometric sequence by 3 of terms are infinite (converge if |r|<1) sn = a1/1-r if |r|<1
46
zeno's paradox
keep halving distances between you and a point, you will never reach it geo with a1=1/2 and r=1/2
47
harmonic numbers
sum of reciprocals, grow without bound
48
fibonacci numbers
F0 = F1, Fn=Fn-1 + Fn-2 each term is sum of 2 prev, grows exponentially
49
prime numbers
natural numbers > 1 has no divisors by 1 and itself
50
composite numbers
natural numbers > 1 can be divided by at least one other number besides 1 and itself
51
prime factors and factorization
expressing composite number as a product of prime numbers
52
gcd
largest number that divides both exactly factorize, common prime factors, gcd=product of prime factors - use smallest power
53
lcm
smallest # that is divisible by both factorize, find all prime factors, lcm=product of all prime factors - use highest power
54
solving quadratics
diamond complete square: ax^2 + bx = -c and add (b/2a)^2 to both sides quadratic formula
55
solving polynomial with integer roots
1. possible roots (factors of d divided by factors of a 2. test 3. facto4r x-test 4. solve
56
factoring polynomials
factoring quadratic grouping difference if square
57
solving sys of linear equations
matrices
58
vectors and matrices and oeprations
vector = add and scalar multiplication matrix = add (same size), multiplication (c=r), det
59
proof
rigorous argument justifying validity of a mathematical statement, showing that this statement logically follows from the assumptions care - provides absolute uncertainty
60
induction
base case inductive step: assume claim holds for n=k that is.. then for n=k+t - use inductive step stuff to make into k+1 want thus claim hold for n=k+1. from the base case and inductive step, claim holds for all n
61
induction sum of arithmetic sequence sum of finite geometric sequence estimate for fibonacci numbers sum of infinite geometric sequence estimating harmonic numbers
62
other proofs if R is an equivalence relation on a set x, then the equivalence classes of R form a partition of x into disjoint sets each finite poset has a topological sort (linear extension) relations involving binomial coefficients, (n choose k) = (n-1 choose k)+(n-1 choose k-1)
63
total number of subsets
2^items
64
ordered without repitition
n!/(n-x)!
65
ordered with repitition
n^x
66
not ordered without repitition
n!/n!(n-x)!
67
ways to order
n!
68
X has n elements, Y has m elements, XxY has...
n x m
69
permutations
n!
70
length k-sequences with repetitions allowed
n^k
71
k-elements subsets
(n choose k)
72
power set
73
finite a^i sum
to n (a^n+1 -1)/a-1