Create Engineering-Level Discrete Maths Course
Budget: $750 – $1,500 CAD
**Title:**
Discrete Mathematics Course Creation (50 Engineering-Level Videos + Problem Sets)
---
**Project Overview:**
I am looking for a qualified educator (or team) to develop a **complete Discrete Mathematics course for engineering students**.
This is a **high-quality, structured course project**. The goal is to produce **clear, in-depth video lessons with strong problem-solving focus**, not surface-level explanations.
---
## Scope of Work
You will create:
* **50 total videos**
* Each video: **15–20 minutes**
* Total runtime: ~12–16 hours
Each video must include:
* Clear conceptual explanations
* Step-by-step worked examples
* Engineering-focused applications (where relevant)
* Logical teaching flow (concept → examples → application → recap)
Additionally, you must:
* **Create original problems for each lesson**
* Provide **fully worked solutions**
* Ensure problems match **engineering-level difficulty**
---
## Full Course Curriculum (MANDATORY)
The course must follow this exact structure and include **ALL topics listed below**
---
### **UNIT 1: Foundations & Logic**
1. What Is Discrete Mathematics & Why Engineers Need It
2. Propositions & Logical Statements
3. Logical Connectives (AND, OR, NOT, XOR)
4. Truth Tables
5. Logical Equivalence & Laws of Logic
6. Implication & Biconditional
7. Quantifiers (∀, ∃) and Logical Statements
---
### **UNIT 2: Methods of Proof (Engineering-Level)**
8. Direct Proof (Conceptual + Examples)
9. Proof by Contradiction
10. Proof by Contrapositive
11. Proof by Cases
12. Mathematical Induction
---
### **UNIT 3: Sets, Relations & Functions**
13. Sets & Set Operations
14. Set Identities & Venn Diagrams
15. Cartesian Products
16. Relations & Properties (Reflexive, Symmetric, Transitive)
17. Equivalence Relations
18. Functions & Function Types (Injective, Surjective, Bijective)
19. Function Composition & Inverses
---
### **UNIT 4: Number Theory (VERY IMPORTANT for EE/CE)**
20. Integers & Divisibility
21. Prime Numbers & Fundamental Theorem of Arithmetic
22. Modular Arithmetic
23. Congruences & Modular Equations
24. Applications of Modular Arithmetic (Engineering & Computing)
---
### **UNIT 5: Counting & Combinatorics**
25. Basic Counting Principles
26. Permutations
27. Combinations
28. Binomial Theorem
29. Applications of Counting (Engineering Context)
---
### **UNIT 6: Recursion & Recurrence Relations**
30. Recursive Definitions
31. Recursive Algorithms
32. Recurrence Relations
33. Solving Recurrence Relations (Basic Methods)
---
### **UNIT 7: Graph Theory (CORE for EE/CS)**
34. Graphs & Graph Terminology
35. Types of Graphs (Directed, Undirected, Weighted)
36. Paths, Cycles & Connectivity
37. Trees & Properties of Trees
38. Spanning Trees & Applications
39. Graph Traversal (BFS & DFS – Conceptual)
---
### **UNIT 8: Boolean Algebra & Digital Logic**
40. Boolean Variables & Expressions
41. Boolean Algebra Laws
42. Logic Gates (AND, OR, NOT, NAND, NOR, XOR)
43. Boolean Expression Simplification
44. Karnaugh Maps (Intro Level)
---
### **UNIT 9: Algorithms & Complexity (Intro Level)**
45. Algorithms & Pseudocode
46. Algorithm Correctness (Conceptual)
47. Time Complexity & Big-O Notation
48. Comparing Algorithm Efficiency
---
### **UNIT 10: Engineering Applications & Review**
49. Discrete Math in Electrical & Computer Engineering
50. Problem-Solving Strategies & Exam Preparation
---
## Requirements
* Strong background in Mathematics, Engineering, or Computer Science
* Experience teaching or creating educational content
* Ability to explain concepts clearly and intuitively
* Fluent English (very important)
* High-quality video/audio production
---
## Deliverables
* 50 fully recorded video lessons (15–20 min each)
* Problem sets for each lesson
* Complete step-by-step solutions
* Organized course structure by unit
---
## Budget
Open to proposals (fixed price preferred).
Quality is the priority — not low-cost bids.
---
## To Apply
Please include:
1. Relevant experience (teaching, courses, etc.)
2. Sample video (if available)
3. Your teaching approach for complex topics
4. Estimated timeline
---
## Important Notes
* All content must be **original (no plagiarism)**
* Must be **engineering-focused and problem-solving oriented**
* This is a **serious, high-quality course project**
---
Looking for someone who can deliver a **top-tier course comparable to university-level teaching**.
Discrete Mathematics Course Creation (50 Engineering-Level Videos + Problem Sets)
---
**Project Overview:**
I am looking for a qualified educator (or team) to develop a **complete Discrete Mathematics course for engineering students**.
This is a **high-quality, structured course project**. The goal is to produce **clear, in-depth video lessons with strong problem-solving focus**, not surface-level explanations.
---
## Scope of Work
You will create:
* **50 total videos**
* Each video: **15–20 minutes**
* Total runtime: ~12–16 hours
Each video must include:
* Clear conceptual explanations
* Step-by-step worked examples
* Engineering-focused applications (where relevant)
* Logical teaching flow (concept → examples → application → recap)
Additionally, you must:
* **Create original problems for each lesson**
* Provide **fully worked solutions**
* Ensure problems match **engineering-level difficulty**
---
## Full Course Curriculum (MANDATORY)
The course must follow this exact structure and include **ALL topics listed below**
---
### **UNIT 1: Foundations & Logic**
1. What Is Discrete Mathematics & Why Engineers Need It
2. Propositions & Logical Statements
3. Logical Connectives (AND, OR, NOT, XOR)
4. Truth Tables
5. Logical Equivalence & Laws of Logic
6. Implication & Biconditional
7. Quantifiers (∀, ∃) and Logical Statements
---
### **UNIT 2: Methods of Proof (Engineering-Level)**
8. Direct Proof (Conceptual + Examples)
9. Proof by Contradiction
10. Proof by Contrapositive
11. Proof by Cases
12. Mathematical Induction
---
### **UNIT 3: Sets, Relations & Functions**
13. Sets & Set Operations
14. Set Identities & Venn Diagrams
15. Cartesian Products
16. Relations & Properties (Reflexive, Symmetric, Transitive)
17. Equivalence Relations
18. Functions & Function Types (Injective, Surjective, Bijective)
19. Function Composition & Inverses
---
### **UNIT 4: Number Theory (VERY IMPORTANT for EE/CE)**
20. Integers & Divisibility
21. Prime Numbers & Fundamental Theorem of Arithmetic
22. Modular Arithmetic
23. Congruences & Modular Equations
24. Applications of Modular Arithmetic (Engineering & Computing)
---
### **UNIT 5: Counting & Combinatorics**
25. Basic Counting Principles
26. Permutations
27. Combinations
28. Binomial Theorem
29. Applications of Counting (Engineering Context)
---
### **UNIT 6: Recursion & Recurrence Relations**
30. Recursive Definitions
31. Recursive Algorithms
32. Recurrence Relations
33. Solving Recurrence Relations (Basic Methods)
---
### **UNIT 7: Graph Theory (CORE for EE/CS)**
34. Graphs & Graph Terminology
35. Types of Graphs (Directed, Undirected, Weighted)
36. Paths, Cycles & Connectivity
37. Trees & Properties of Trees
38. Spanning Trees & Applications
39. Graph Traversal (BFS & DFS – Conceptual)
---
### **UNIT 8: Boolean Algebra & Digital Logic**
40. Boolean Variables & Expressions
41. Boolean Algebra Laws
42. Logic Gates (AND, OR, NOT, NAND, NOR, XOR)
43. Boolean Expression Simplification
44. Karnaugh Maps (Intro Level)
---
### **UNIT 9: Algorithms & Complexity (Intro Level)**
45. Algorithms & Pseudocode
46. Algorithm Correctness (Conceptual)
47. Time Complexity & Big-O Notation
48. Comparing Algorithm Efficiency
---
### **UNIT 10: Engineering Applications & Review**
49. Discrete Math in Electrical & Computer Engineering
50. Problem-Solving Strategies & Exam Preparation
---
## Requirements
* Strong background in Mathematics, Engineering, or Computer Science
* Experience teaching or creating educational content
* Ability to explain concepts clearly and intuitively
* Fluent English (very important)
* High-quality video/audio production
---
## Deliverables
* 50 fully recorded video lessons (15–20 min each)
* Problem sets for each lesson
* Complete step-by-step solutions
* Organized course structure by unit
---
## Budget
Open to proposals (fixed price preferred).
Quality is the priority — not low-cost bids.
---
## To Apply
Please include:
1. Relevant experience (teaching, courses, etc.)
2. Sample video (if available)
3. Your teaching approach for complex topics
4. Estimated timeline
---
## Important Notes
* All content must be **original (no plagiarism)**
* Must be **engineering-focused and problem-solving oriented**
* This is a **serious, high-quality course project**
---
Looking for someone who can deliver a **top-tier course comparable to university-level teaching**.