Discrete Mathematics -- 4
Budget: $15 – $25 USD
I need help with Discrete MATHEMATICS
1. Number Theory
• Numbers and Number Systems
• The Integers and Division
• Primes and Greatest Common Divisors
• Integers and Algorithms
• Applications of Number Theory
2. Set Theory
• Introduction to Sets
• Set Operations
• Properties of Sets
• Relations and Their Properties
• Functions
3. Matrix Algebra
• Matrix Arithmetic
• Matrix Transpose
4. Boolean Algebra
• Boolean Functions
• Representing Boolean Functions
5. The Foundations: Logic and Proofs
• Propositional Logic
• Logical Induction
• Predicate Logic
• Logic Gates
• Introduction to Proofs
6. Graphs
• Graphs and Graph Models
• Graph Terminology and Special Types of Graphs
• Representing Graphs and Graph Isomorphism
• Connectivity and shortest path problems
7. Trees
• Introduction to Trees
• Applications of Trees
• Spanning Trees
• Minimum Spanning Trees
8. Counting
• The Basics of Counting and applications
• Permutations and Combinatorics
• Binomial Coefficients and Pascal Triangle
1. Number Theory
• Numbers and Number Systems
• The Integers and Division
• Primes and Greatest Common Divisors
• Integers and Algorithms
• Applications of Number Theory
2. Set Theory
• Introduction to Sets
• Set Operations
• Properties of Sets
• Relations and Their Properties
• Functions
3. Matrix Algebra
• Matrix Arithmetic
• Matrix Transpose
4. Boolean Algebra
• Boolean Functions
• Representing Boolean Functions
5. The Foundations: Logic and Proofs
• Propositional Logic
• Logical Induction
• Predicate Logic
• Logic Gates
• Introduction to Proofs
6. Graphs
• Graphs and Graph Models
• Graph Terminology and Special Types of Graphs
• Representing Graphs and Graph Isomorphism
• Connectivity and shortest path problems
7. Trees
• Introduction to Trees
• Applications of Trees
• Spanning Trees
• Minimum Spanning Trees
8. Counting
• The Basics of Counting and applications
• Permutations and Combinatorics
• Binomial Coefficients and Pascal Triangle