Useful Links
Computer Science
Computer Science Fundamentals
Mathematical Foundations for Computing
1. Foundations of Logic and Proofs
2. Basic Structures: Sets, Functions, and Relations
3. Algorithms and Complexity
4. Integers and Number Theory
5. Induction and Recursion
6. Counting and Combinatorics
7. Discrete Probability
8. Graph Theory
9. Boolean Algebra and Logic Circuits
10. Formal Languages and Automata Theory
Basic Structures: Sets, Functions, and Relations
Set Theory
Defining Sets
Roster Method
Set-Builder Notation
Describing Infinite Sets
Membership and Non-membership
Special Sets
The Empty Set
Universal Set
Power Set
Singleton Sets
Natural Numbers
Integers
Rational Numbers
Real Numbers
Subsets and Proper Subsets
Definition of Subset
Proper Subset
Subset Notation
Subset Relationships
Set Operations
Union
Intersection
Difference
Complement
Symmetric Difference
Disjoint Sets
Venn Diagrams
Representing Set Operations
Visualizing Relationships
Three-Set Venn Diagrams
Set Cardinality
Counting Elements in Finite Sets
Infinite Sets
Countable Sets
Uncountable Sets
Comparing Cardinalities
Cantor's Theorem
Cartesian Products
Definition and Notation
Properties of Cartesian Products
n-ary Cartesian Products
Ordered Pairs and Tuples
Set Identities
Proving Set Identities
Common Set Laws
Using Set Identities in Proofs
Functions
Definition of a Function
Mapping from Domain to Codomain
Function Notation
Function Equality
Domain, Codomain, and Range
Identifying Domain and Codomain
Determining the Range
Image and Preimage
Types of Functions
Injective Functions
Surjective Functions
Bijective Functions
Constant Functions
Identity Function
Partial Functions
Inverse Functions
Definition and Existence
Finding Inverses
Properties of Inverse Functions
Left and Right Inverses
Composition of Functions
Definition of Function Composition
Associativity of Composition
Domain and Range of Composed Functions
Composition with Inverse Functions
Important Functions in Computer Science
Floor Function
Ceiling Function
Factorial Function
Logarithmic Functions
Exponential Functions
Polynomial Functions
Boolean Functions
Relations
Binary Relations
Definition and Examples
n-ary Relations
Relation as a Set of Ordered Pairs
Representing Relations
Using Matrices
Using Directed Graphs
Relation Tables
Set Notation
Properties of Relations
Reflexivity
Symmetry
Antisymmetry
Transitivity
Irreflexivity
Asymmetry
Combining Properties
Combining Relations
Union of Relations
Intersection of Relations
Composition of Relations
Inverse of a Relation
Powers of Relations
Equivalence Relations
Definition of Equivalence Relation
Equivalence Classes
Partitions Induced by Equivalence Relations
Quotient Sets
Partial Orderings
Definition of Partial Order
Partially Ordered Sets
Hasse Diagrams
Maximal and Minimal Elements
Greatest and Least Elements
Upper and Lower Bounds
Total Orderings
Well-Ordered Sets
Previous
1. Foundations of Logic and Proofs
Go to top
Next
3. Algorithms and Complexity