Neso Academy Discrete Mathematics: study plan and how long it takes
The Neso Academy playlist is 148 videos and 17.2 hours long. Here's how long it takes at different paces, a week-by-week schedule built from the real videos, and a planner that turns it into your own daily plan.
148 videos · 17.2 hours · Neso Academy
Neso Academy's Discrete Mathematics course covers propositional and predicate logic, rules of inference, nested quantifiers, sets and cardinality, relations and their closures, partial orderings and lattices, with many solved and GATE problems.
The last three entries (functions, counting, and permutations and combinations) are short chapter previews for the rest of the course on nesoacademy.org, so plan the YouTube playlist as logic, sets, relations and lattices.
Who it's for: CS students taking discrete mathematics, and GATE aspirants revising the subject.
How long does it take?
The full playlist is 17.2 hours across 148 videos. Here's roughly how many days that is at different daily watch times and speeds, counting video time only:
| Daily time | At 1x | At 1.5x | At 2x |
|---|---|---|---|
| 30 min a day | 35 days | 23 days | 18 days |
| 1 h a day | 18 days | 12 days | 9 days |
| 2 h a day | 9 days | 6 days | 5 days |
Make your own schedule
The playlist link is already filled in. Press Plan, set how much time you have each day and your speed, and you'll get a day-by-day schedule with a finish date and a calendar file. It reads the live playlist, so new videos are included.
Week-by-week schedule
A sample plan at 1 hour a day and normal speed, using whole videos so none is split across days. That's 3 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–64 · 6h 22m
Day 1 · 48m
- 1Introduction to Discrete Mathematics10m
- 2Motivation & Introduction to Propositional Logic8m
- 3Propositional Logic, Propositional Variables & Compound Propositions6m
- 4Logical Operators − Negation, Conjunction & Disjunction6m
- 5Logical Operators − Exclusive OR7m
- 6Logical Operators − Implication (Part 1)10m
Day 2 · 50m
- 7Logical Operators − Implication (Part 2)15m
- 8Logical Operators − Implication (Part 3)8m
- 9Converse, Contrapositive and Inverse4m
- 10Logical Operators − Biconditional Operator6m
- 11Propositional Logic − Precedence of Logical Operators6m
- 12Translating Sentences into Logical Expressions10m
Day 3 · 56m
- 13Propositional Logic − Puzzle 111m
- 14Propositional Logic − Puzzle 210m
- 15Propositional Logic (Solved Problem 1)6m
- 16Tautology, Contradiction, Contingency & Satisfiability5m
- 17Propositional Logic − Logical Equivalences17m
- 18Propositional Logic (Solved Problem 2)6m
Day 4 · 57m
- 19Propositional Logic (Solved Problem 3)5m
- 20Propositional Logic (Solved Problem 4)5m
- 21Propositional Logic (Solved Problem 5)5m
- 22Propositional Logic (Solved Problem 6)6m
- 23Propositional Logic (Solved Problem 7)7m
- 24Rules of Inference - Basic Terminology6m
- 25Rules of Inference - Definition & Types of Inference Rules8m
- 26Arguments Building Using Rules of Inference (Part 1)6m
- 27Arguments Building Using Rules of Inference (Part 2)6m
- 28Checking The Validity of An Argument (Shortcut Method)4m
Day 5 · 58m
- 29Rules of Inference in Propositional Logic (Solved Problem 1)3m
- 30Rules of Inference in Propositional Logic (Solved Problem 2)4m
- 31The Limitation of Propositional Logic5m
- 32Introduction to First Order Logic5m
- 33Finding The Truth Values of Predicates (Examples)3m
- 34Quantifiers5m
- 35Universal Quantifiers4m
- 36Universal Quantifiers - Counter Examples4m
- 37Expressing Quantifications in English3m
- 38Existential Quantifiers4m
- 39Existential Quantifiers - Examples5m
- 40Quantifiers with Restricted Domain4m
- 41Logical Equivalences Involving Predicates & Quantifiers (Part 1)9m
Day 6 · 57m
- 42Logical Equivalences Involving Predicates & Quantifiers (Part 2)9m
- 43Negating the Quantified Expressions (Part 1)4m
- 44Negating the Quantified Expressions (Part 2)3m
- 45Negating the Quantified Expressions (Examples)3m
- 46Translating English Sentences to Logical Expressions11m
- 47First Order Logic (Solved Problems) - Part 15m
- 48First Order Logic (Solved Problems) - Part 25m
- 49First Order Logic (Solved Problems) - Part 35m
- 50First Order Logic (Solved Problems) - Part 45m
- 51First Order Logic (Solved Problems) - Part 57m
Day 7 · 57m
- 52Introduction to Nested Quantifiers3m
- 53Nested Quantifiers (Solved Example 1)8m
- 54Nested Quantifiers (Solved Example 2)6m
- 55Nested Quantifiers (Solved Example 3)4m
- 56Nested Quantifiers (Translating English Statements) - Example 15m
- 57Nested Quantifiers (Translating English Statements) - Example 24m
- 58Nested Quantifiers (Translating English Statements) - Example 33m
- 59Nested Quantifiers (Translating English Statements) - Example 45m
- 60Nested Quantifiers (Translating English Statements) - Example 54m
- 61Negating the Nested Quantifiers3m
- 62Negating the Nested Quantifiers (Example 2)3m
- 63Negating the Nested Quantifiers (Example 3)3m
- 64The Resolution Principle (Preliminaries)5m
Week 2Videos 65–124 · 6h 35m
Day 8 · 57m
- 65The Resolution Principle (Proof of Theorem)4m
- 66The Resolution Principle (Proving if an Argument is Valid)3m
- 67The Resolution Principle (Solved Problems)7m
- 68Fallacies6m
- 69Rules of Inference for Quantified Statements (Part 1)5m
- 70Rules of Inference for Quantified Statements (Part 2)3m
- 71Universal Modus Ponens Rule3m
- 72Universal Modus Tollens Rule2m
- 73Set Theory (Basics of Sets)5m
- 74Set Representation5m
- 75Inclusion and Equality7m
- 76Inclusion vs. Membership7m
Day 9 · 59m
- 77Inclusion vs. Membership (Solved Problem)4m
- 78Types of Sets - Universal, Null, and Singleton3m
- 79Null Set (Solved Problem)3m
- 80Non-Empty Set (Important Theorem)3m
- 81Power Set5m
- 82Power Set (Solved Problems)5m
- 83Power Set (GATE Problem 1)3m
- 84Power Set (GATE Problem 2)4m
- 85Cardinality of Sets3m
- 86Cartesian Product8m
- 87Cartesian Product (Solved Problems)7m
- 88Set Operations (Intersection & Union with Venn Diagram)6m
- 89Set Difference and Set Complement5m
Day 10 · 57m
- 90Set Operations (Solved Problems)7m
- 91Set Identities (Part 1)7m
- 92Set Identities (Part 2)8m
- 93Set Identities (Part 3)9m
- 94Set Operations (Solved Problem 1)4m
- 95Set Operations (Solved Problem 2)6m
- 96Symmetric Difference11m
- 97Set Operations (GATE Problems)5m
Day 11 · 56m
- 98Set Operations (GATE and TIFR Problem)7m
- 99Introduction to Relations8m
- 100Types of Relations (Part 1)7m
- 101Types of Relations (Part 2)4m
- 102Types of Relations (Solved Problem)9m
- 103Types of Relations (GATE Problems) - Set 16m
- 104Types of Relations (GATE Problems) - Set 28m
- 105Operations on Relations8m
Day 12 · 59m
- 106Composition of Relations6m
- 107Composition of Relation with Itself7m
- 108Representation of Relations6m
- 109Closure of Relations – Part 15m
- 110Closure of Relations – Part 26m
- 111Closure of Relations (Solved Problems) - Set 15m
- 112Warshall's Algorithm (Finding the Transitive Closure)10m
- 113Closure of Relations (Solved Problems) - Set 214m
Day 13 · 59m
- 114Closure of Relations - GATE Problem8m
- 115Equivalence Relation6m
- 116Equivalence Relation (Solved Problems)11m
- 117Equivalence Relation (GATE Problems) - Set 16m
- 118Equivalence Relation (GATE Problems) - Set 212m
- 119Equivalence Relation (GATE Problem)9m
- 120Equivalence Classes7m
Day 14 · 47m
- 121Congruence Modulo m12m
- 122Modulus of Negative Numbers13m
- 123Equivalence Classes and Partitions13m
- 124Equivalence Classes and Partitions (Solved Problems)9m
Week 3Videos 125–148 · 4h 15m
Day 15 · 58m
- 125Introduction to Partial Ordering16m
- 126Partial Orderings (Solved Problems) - Set 19m
- 127Partial Orderings (Solved Problems) - Set 216m
- 128Hasse Diagram17m
Day 16 · 46m
- 129Hasse Diagram (Solved Problems) - Set 17m
- 130Hasse Diagram (Solved Problems) - Set 210m
- 131Poset (Minimal and Maximal Elements)14m
- 132Poset (Least and Greatest Elements)15m
Day 17 · 48m
- 133Poset (Lower and Upper Bounds)16m
- 134Poset (Least Upper Bound and Greatest Lower Bound)11m
- 135Hasse Diagram (Solved Problems) - Set 310m
- 136Symbols for Partial Order11m
Day 18 · 59m
- 137Meet Semilattice12m
- 138Join Semilattice9m
- 139Lattice15m
- 140Lattice (GATE Problems) - Set 110m
- 141Complete and Bounded Lattice12m
Day 19 · 43m
- 142Lattice (Complement of an Element)10m
- 143Lattice (GATE Problems) - Set 27m
- 144Complemented Lattice12m
- 145Distributive Lattice11m
- 146Functions | Chapter-7 | Discrete Mathematics | nesoacademy.org1m
- 147Counting | Chapter-8 | Discrete Mathematics | nesoacademy.org1m
- 148Permutations & Combinations | Chapter-9 | Discrete Mathematics | nesoacademy.org1m
Tips for finishing
- Logic and quantifiers come first and underpin everything else. Don't rush them.
- Tick off the three preview videos at the end so the planner skips them, and use MIT 6.042J or another source for counting.