Jenny's Lectures DBMS: study plan and how long it takes
The Jenny's Lectures CS IT playlist is 24 videos and 8.7 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.
24 videos · 8.7 hours · Jenny's Lectures CS IT
Jenny's Lectures DBMS playlist concentrates on keys, functional dependencies, Armstrong's axioms, finding candidate keys, normalization from 1NF to BCNF, and lossless and dependency-preserving decomposition.
It's a deep dive into the theory part of DBMS that students most often struggle with.
Who it's for: University and GATE students who need to master normalization and functional dependencies.
How long does it take?
The full playlist is 8.7 hours across 24 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 | 18 days | 12 days | 9 days |
| 1 h a day | 9 days | 6 days | 5 days |
| 2 h a day | 5 days | 3 days | 3 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 2 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–13 · 5h 15m
Day 1 · 46m
- 1Lec 1: Introduction to DBMS | Database Management System22m
- 2Lec 2: File processing system in dbms | Disadvantages of file system | File System vs DBMS23m
Day 2 · 36m
- 3Lec 3: Super Key | Candidate Key | Primary Key | Types of keys in DBMS36m
Day 3 · 51m
- 4Lec 4: Functional dependency in DBMS | What is functional dependency | Database Management System26m
- 5Lec 5: Armstrong's axioms in DBMS | Inference rules of Functional Dependency25m
Day 4 · 47m
- 6Lec6:What is Attribute Closure |Closure set of Attribute in DBMS | How to find Closure of Attributes28m
- 7Lec 7: How to Find Number of Candidate Keys in a Relation - part 1 | DBMS Tutorials19m
Day 5 · 44m
- 8Lec 8: Finding number of candidate keys in relation - part 2 | DBMS21m
- 9Lec 9: Normalization in DBMS | Need of Normalization | DBMS Tutorials24m
Day 6 · 44m
- 10Lec 10: First Normal Form in DBMS | 1NF with example | Normalization in DBMS22m
- 11Lec 11: Second Normal Form in DBMS | 2NF in DBMS | Normalization in DBMS22m
Day 7 · 48m
- 12Lec 12: Third Normal Form in DBMS | 3NF with example | Normalization in DBMS24m
- 13Lec 13: BCNF in DBMS | Boyce Codd Normal Form | Normalization in DBMS24m
Week 2Videos 14–24 · 3h 26m
Day 8 · 36m
- 14Lec 14: How to find out Normal form of a Relation| how to identify Highest Normal Form | part123m
- 15Lec15: Find Highest Normal Form of a Relation| Practice Problem - part2 | Normalization in DBMS13m
Day 9 · 45m
- 16Lec 16: Dependency preserving decomposition in DBMS | with example | DBMS Tutorials for beginners26m
- 17Lec 17: Dependency Preserving Decomposition in DBMS | Practice Problem19m
Day 10 · 1h
- 18Lec 18: Lossless Join Decomposition | Non Additive Join Decomposition Property | DBMS Tutorials22m
- 19Lec 19: Practice Problem on Lossless Join Decomposition | DBMS Tutorials21m
- 20Lec 21: What is Canonical Cover in DBMS | Minimal cover Irreducible with example16m
Day 11 · 50m
- 21Lec 20: Problem on Lossless Join Decomposition in DBMS | Check whether Decomposition is Lossless10m
- 22Lec 22: How to Decompose a Relation into 2NF (Second Normal Form) | DBMS24m
- 23Lec23: How to Decompose a Relation into 3NF(Third Normal Form) with example | Convert 2NF to 3NF17m
Day 12 · 16m
- 24Lec 24: How to Normalize a Relation Table in DBMS | with example16m
Tips for finishing
- Solve the candidate key and highest normal form problems on paper before watching the answers.
- Use a broader DBMS course for SQL, transactions and indexing.