Discrete Math
Final Exam
Review | Full
Questions,
Correct Answers,
and Worked
Solutions | 2026
Update | 100%
Correct.
C
Practice questions for this set
Terms in this set (116)
, Recursion when an object's definition relies on that object
e.g. 2^n = 2x2^(n-1)
Induction the proof technique used to demonstrate facts about
recursive definitions
Set (loosely speaking) is a collection of objects called
elements
e.g. if this class is a set, you are an element
We write x ∈ X when x is an element of the set X
list or rooter notation {1,2,3,4,5,6,7,8,9,10}
the set of whole numbers between 1 and
10 inclusive
list or rooter notation {1,2,3,4,...}
is the set of positive whole numbers
Set builder notation elements are described by some rule or property
set builder notation {x | x is a whole number and 1≤x≤10}
the set of whole numbers between 1 and
10 inclusive
set builder notation {n | n is a positive whole number}
the set of positive whole numbers
N natural numbers
{0,1,2,3,4,...} 0 only counts in CSCI
Z integers
{...,-2,-1,0,1,2,...}
Q rational numbers
{(p/q) I p, q ∈ Z and q ≠ 0}
where p and q are both
integers
R real numbers
rational numbers and everything in between
e.g. π,3,(1/3)
subset given two sets X and Y, we say Y is a subset of X if
every element of Y is also in X.
Y⊆X
empty set set that has no elements
{} or Ø
a subset of every set
collection set of sets
Final Exam
Review | Full
Questions,
Correct Answers,
and Worked
Solutions | 2026
Update | 100%
Correct.
C
Practice questions for this set
Terms in this set (116)
, Recursion when an object's definition relies on that object
e.g. 2^n = 2x2^(n-1)
Induction the proof technique used to demonstrate facts about
recursive definitions
Set (loosely speaking) is a collection of objects called
elements
e.g. if this class is a set, you are an element
We write x ∈ X when x is an element of the set X
list or rooter notation {1,2,3,4,5,6,7,8,9,10}
the set of whole numbers between 1 and
10 inclusive
list or rooter notation {1,2,3,4,...}
is the set of positive whole numbers
Set builder notation elements are described by some rule or property
set builder notation {x | x is a whole number and 1≤x≤10}
the set of whole numbers between 1 and
10 inclusive
set builder notation {n | n is a positive whole number}
the set of positive whole numbers
N natural numbers
{0,1,2,3,4,...} 0 only counts in CSCI
Z integers
{...,-2,-1,0,1,2,...}
Q rational numbers
{(p/q) I p, q ∈ Z and q ≠ 0}
where p and q are both
integers
R real numbers
rational numbers and everything in between
e.g. π,3,(1/3)
subset given two sets X and Y, we say Y is a subset of X if
every element of Y is also in X.
Y⊆X
empty set set that has no elements
{} or Ø
a subset of every set
collection set of sets
