CSE240 -- Exam 2 Vocab Flashcards

(82 cards)

1
Q

proof by contradiction

A

Assume theorem is false, then show that some logical inconsistency arises as a result of the assumption.

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

proof by cases

A

Of a universal statement–breaks domain for the variable x into different classes and gives a different proof of each class.

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

bidirectional proof

A

Proving a statement of the form “P if and only if Q” where both directions of the implication must be proven.

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

set

A

Collection of objects. Objects may be of various types.

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

element

A

Each object in a set.

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

roster notation

A

Definition of a set where a list of elements enclosed in curly braces w/ the inidividual elements separated by commas.

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

empty set

A

Set with no elements. Denoted by ∅. Also referred to as “null set” and can be denoted by {}.

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

finite/infinite

A

Set that is either empty or whose elements ccan be numbered 1 through n for some positive integer n / set that is not ___.

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

cardinality

A

Denoted by |A| where A is a finite set, the number of distinct elements in A.

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

containment

A

Relationship between sets where one set is a subset of another.

  • A ⊆ B means A is contained in B, including the possibility that A and B are equal.
  • A ⊂ B means A is properly contained in B, meaning A is a subset of B but not equal to B.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

set builder notation

A

Set is deifned by specifying that the set includes all elements in a larger set that also satisfy certain conditions.

Looks like: A = {x ∈ S: P(x)}

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

N, Z, Z+, Q, R

A

Set of natural numbers (set of all integers that are greater than or equal to 0), set of all integers, set of all positive integers, set of rational numbers (set of real numbers that can be expressed a/b), set of real numbers.

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

universal set

A

Denoted by variable U, is a set that contins all elements mentioned in a particular context.

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

Venn diagram

A

Pictorially represents sets–a rectangle denotes the universal set U, and oval shapes denote sets within U.

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

subset

A

If every element in A is also an element of B, then A is a ____ of B, denoted as A ⊆ B.

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

proper subset

A

If A ⊆ B and there is an element of B that is not an element of A (that is, A != B), then A is a ____ of B, denoted as A ⊂ B.

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

power set

A

Denoted P(A), is the set of all subsets of A.

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

union

A

Denoted A ∪ B, the set of all elements that are elements of A or B.

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

intersection

A

Set of elements that are common to both sets, denoted by the symbol ∩.

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

generalized (possibly infinite) union/intersection

A

Union of an arbitrary (possibly infinite) collection of sets.

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

set difference

A

Denoted A - B, set of elements that are in A but not in B.

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

complement

A

Set of all elements in U that are not elements of A.

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

ordered pair

A

Items written in (x, y).

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

ordered tuple

A

Ordered list of three items, denoted (x, y, z).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
entry
Individual element, for example the first _ANSWER_ in the ordered pair (x, y) is x.
26
string
A sequence of characters.
27
alphabet
Set of characters used in a set of strings.
28
length
Number of characters in the string.
29
binary string
A string with alphabet {0, 1}.
30
bit
A character in a binary string.
31
empty string
Unique string with a length of 0 and is usually denoted by the symbol lambda.
32
concatenation
____ of ***s*** and ***t*** (denoted ***st***) is the string obtained by putting ***s*** and ***t*** together.
33
Cartesian product
Denoted A x B, is the set of all ordered pairs in which the first entry is in A and the second entry is in B. A x B = {(a, b): a ∈ A and b ∈ B}
34
disjoint
Two sets A and B are ____ if the intersection of the two sets is empty (A ∩ B = 0).
35
partition
_ANSWER_ of a non-empty set A is a collection of non-empty subsets of A such that each element of A is in exactly one of the subsets.
36
function
Maps elements from one set ***X*** to elements of another set ***Y***.
37
domain
38
target (co-domain)
39
range
40
arrow diagram
41
floor/ceiling
42
one-to-one/injection
43
onto/surjection
44
one-to-one correspondence/bijection
45
inverse
46
composition
47
identity function
48
logarithm function
49
sequence
50
term
51
index
52
finite sequence
53
initial and final term
54
explicit formula
55
increasing
56
decreasing
57
non-decreasing
58
non-increasing
59
geometric sequence
60
common ratio
61
arithmetic sequence
62
common difference
63
recursive sequence
64
recurrence relation
65
initial terms
66
Fibonacci sequence
67
summation
68
index
69
lower and upper limit
70
base case
71
inductive step
72
inductive hypothesis
73
induction (regular and strong)
74
factorial
75
recursive definition
76
recursion
77
recursive set
78
basis step
79
recursive step
80
root
81
binary tree (perfect or full)
82
structural induction