Love Babbar's Operating Systems for Placements: study plan and how long it takes
The CodeHelp - by Babbar playlist is 32 videos and 16.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.
32 videos · 16.2 hours · CodeHelp - by Babbar
CodeHelp's OS for Placements course covers the operating system topics interviewers ask about: multitasking vs multithreading, how an OS boots and creates processes, scheduling and the convoy effect, concurrency and the producer-consumer problem, deadlocks, memory management, segmentation and thrashing.
It ends with a bonus session solving LeetCode concurrency problems.
Who it's for: Students preparing for placement interviews who need OS fundamentals explained practically rather than for exams.
How long does it take?
The full playlist is 16.2 hours across 32 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 | 33 days | 22 days | 17 days |
| 1 h a day | 17 days | 11 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 4 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–11 · 4h 45m
Day 1 · 26m
- 1Introduction to Operating Systems Placements Course 20227m
- 2Lecture 1: What is an Operating System ?19m
Day 2 · 40m
- 3Lecture 2: Types of Operating Systems40m
Day 3 · 39m
- 4Lecture 3: Multi-Tasking vs Multi-Threading39m
Day 4 · 45m
- 5Lecture 4: Components of Operating System45m
Day 5 · 47m
- 6Lecture 5: System Calls in Operating System [Theory + Example + Hands-on Terminal]28m
- 7Lecture 6: How Operating System Boots up?19m
Day 6 · 32m
- 8Lecture 7: Difference between 32-bit & 64-bit Operating System20m
- 9Lecture 8: Comparison between different STORAGES used in Computer11m
Day 7 · 56m
- 10Lecture 9: How OS creates a PROCESS || Introduction to Process38m
- 11Lecture 10: What are different Process States in Operating System ?18m
Week 2Videos 12–22 · 5h 20m
Day 8 · 41m
- 12Lecture 11: Context Switching in OS | Medium Term Scheduler | Orphan/Zombie Process41m
Day 9 · 25m
- 13Lecture 12: What is Convoy Effect | FCFS CPU Scheduling Algorithm25m
Day 10 · 45m
- 14Lecture 13: Shortest Job First Algorithm | Priority Scheduling | Round Robin CPU Scheduling45m
Day 11 · 52m
- 15Lecture 14: Multi Level Queue Scheduling || MLFQ || Comparison btw CPU Scheduling Algorithms28m
- 16Lecture 15: What is Concurrency ? || Multi-Threading in C++ || Operating Systems Placement Series24m
Day 12 · 58m
- 17Lecture 16: Critical Section Problem || Race condition in OS35m
- 18Lecture 17: Conditional Variables & Semaphores to Synchronise Threads23m
Day 13 · 45m
- 19Lecture 18: Producer Consumer Problem and its Solution || OS Placement Series15m
- 20Lecture 19: Reader-Writer Problem and its Solution || OS Placement Series14m
- 21Lecture 20: The Dining Philosophers Problem & its Solution16m
Day 14 · 54m
- 22Lecture 21: What is Deadlock | Necessary Conditions | Handling Methods | Part - 154m
Week 3Videos 23–30 · 4h 56m
Day 15 · 55m
- 23Lecture 22: Deadlock Avoidance | Deadlock Detection and Recovery | Part - 224m
- 24Lecture 23: Solving LeetCode Problems on Concurrency || OS Placement Series31m
Day 16 · 49m
- 25Lecture 24: Memory Management in OS || Contiguous Memory Allocation49m
Day 17 · 31m
- 26Lecture 25: How OS manages Free Space? || Memory Management31m
Day 18 · 48m
- 27Lecture 26: What is Paging? || Non-Contiguous Memory Allocation48m
Day 19 · 27m
- 28Lecture 27: What is Segmentation || Non-Contiguous Memory Allocation27m
Day 20 · 44m
- 29Lecture 28: What is Virtual Memory? || Page fault in OS44m
Day 21 · 41m
- 30Lecture 29: Page Replacement Algorithms || How to implement LRU algorithm?41m
Week 4Videos 31–32 · 1h 9m
Day 22 · 35m
- 31Lecture 30: What is Thrashing? || Important Interview Question35m
Day 23 · 34m
- 32Bonus Session: Solving LeetCode Problems on Concurrency || Operating Systems Placement Series34m
Tips for finishing
- Write a one-line answer to each lecture title as an interview question; that list becomes your revision sheet.
- Do the LeetCode concurrency problems from the bonus session yourself afterwards.