Jenny's Lectures Operating Systems: study plan and how long it takes
The Jenny's Lectures CS IT playlist is 31 videos and 8.6 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.
31 videos · 8.6 hours · Jenny's Lectures CS IT
Jenny's Lectures OS playlist focuses on the parts of operating systems that exams test most: CPU scheduling algorithms (FCFS, SJF, SRTF, round robin, priority, multilevel queues) with worked examples, deadlocks and the banker's algorithm, and page replacement.
It's under nine hours, so it works well as a focused revision course.
Who it's for: University students preparing for an OS exam who want scheduling and deadlock numericals explained step by step.
How long does it take?
The full playlist is 8.6 hours across 31 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–21 · 6h 3m
Day 1 · 59m
- 1Introduction to Operating System and its Functions | Operating System | Lecture 124m
- 2Types of Operating Systems(Batch, Multiprogramming, Time Sharing, Multiprocessing, Real Time)18m
- 3Process State Transition Diagram and various Schedulers | Operating System17m
Day 2 · 57m
- 4FCFS(First Come First Serve) CPU Scheduling Algorithm with example | Operating System18m
- 5Convoy Effect in FCFS(First Come First Serve) Algorithm| Operating System11m
- 6Shortest Job First(SJF) Scheduling Algorithm with example | Operating System13m
- 7Shortest Remaining Time First(SRTF) Scheduling Algorithm with Example | Operating System15m
Day 3 · 54m
- 8Advantage and Disadvantage of Shortest Job First(SJF) Scheduling Algorithm | Operating System17m
- 9SJF with Prediction of Burst Time in OS | with example14m
- 10SJF with processes having CPU and IO Time | CPU Scheduling Algorithm in OS23m
Day 4 · 58m
- 11FCFS with IO Time - CPU Scheduling Algorithm in OS15m
- 12Round Robin(RR) CPU Scheduling Algorithm in OS with example20m
- 13Round Robin(RR) Scheduling example with advantages and drawbacks | Operating Systems23m
Day 5 · 49m
- 14GATE Computer Science previous year question on Round Robin(RR) scheduling | Operating Systems6m
- 15Non Preemptive Priority Scheduling Algorithm with example | Operating System16m
- 16Lec 17: Preemptive Priority Scheduling Algorithm in OS with example | Operating System18m
- 17Lec18 Starvation and Aging in Priority Scheduling | Operating Systems10m
Day 6 · 38m
- 18Lec19 Deadlock | Necessary conditions for Deadlock | Operating Systems13m
- 19Lec20 Resource Allocation Graph in Deadlock | with example | Operating System25m
Day 7 · 48m
- 20Lec21 Deadlock handling methods | Deadlock Prevention | Operating System31m
- 21Lec22 Deadlock Avoidance with Resource Allocation Graph(with example) | Operating System17m
Week 2Videos 22–31 · 2h 35m
Day 8 · 43m
- 22Lec23 Deadlock Avoidance: Banker's Algorithm with example | Operating System21m
- 23Lec24 Deadlock Avoidance: Bankers(Resource Request Algorithm) with example |Operating System21m
Day 9 · 51m
- 24Lec25 Deadlock Detection and Recovery : Wait-for Graph and Banker's algorithm | Operating System19m
- 25Lec26 Deadlock Recovery in Operating System12m
- 26Lec27 Deadlock | GATE Question Previous Year | Operating System11m
- 27CPU Scheduling Criteria in Operating system | Various Times related to Process8m
Day 10 · 48m
- 28Lec28 Page replacement Introduction| FIFO page replacement algorithm with example| Operating System20m
- 29Lec29 Page Replacement Algorithms | LRU and optimal | Operating Systems16m
- 30Lec30 Belady's Anomaly in FIFO page replacement algorithm with example | Operating System11m
Day 11 · 14m
- 31Lec31 Multilevel queues and multilevel feedback queue scheduling | Operating systems14m
Tips for finishing
- Make your own Gantt chart for each scheduling example before Jenny reveals it.
- Pair it with a full OS course for memory management and file systems, which this playlist covers lightly.