Neso Academy Operating System: study plan and how long it takes
The Neso Academy playlist is 77 videos and 16.9 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.
77 videos · 16.9 hours · Neso Academy
Neso Academy's Operating System course follows the classic textbook structure: OS structure and booting, processes and inter-process communication, threads, CPU scheduling with worked examples, and process synchronization with semaphores and classic problems like dining philosophers.
The free YouTube playlist stops after synchronization: the last six entries (deadlocks, memory, virtual memory, file systems and storage) are one-minute chapter previews for the rest of the course on nesoacademy.org.
Who it's for: University and GATE students who want a structured OS course that maps to the standard textbook.
How long does it take?
The full playlist is 16.9 hours across 77 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 | 34 days | 23 days | 17 days |
| 1 h a day | 17 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–28 · 5h 57m
Day 1 · 58m
- 1Introduction to Operating Systems17m
- 2Basics of OS (Computer System Operation)18m
- 3Basics of OS (Storage Structure)10m
- 4Basics of OS (I/O Structure)13m
Day 2 · 53m
- 5Computer System Architecture14m
- 6Operating System Structure12m
- 7Operating System Services13m
- 8User Operating System Interface14m
Day 3 · 49m
- 9System Calls13m
- 10Types of System Calls11m
- 11System Programs12m
- 12Operating System Design & Implementation13m
Day 4 · 59m
- 13Structures of Operating System19m
- 14Virtual Machines11m
- 15Operating System Generation and System Boot12m
- 16Process Management (Processes and Threads)8m
- 17Process State9m
Day 5 · 50m
- 18Process Control Block7m
- 19Process Scheduling11m
- 20Context Switch11m
- 21Operation on Processes – Process Creation12m
- 22Operation on Processes – Process Termination9m
Day 6 · 38m
- 23Interprocess Communication13m
- 24Shared Memory Systems15m
- 25Message Passing Systems (Part 1)11m
Day 7 · 49m
- 26Message Passing Systems (Part 2)23m
- 27Message Passing Systems (Part 3)14m
- 28Sockets in Operating System12m
Week 2Videos 29–51 · 5h 58m
Day 8 · 47m
- 29Remote Procedure Calls (RPC)15m
- 30Issues in RPC & How They're Resolved19m
- 31Introduction to Threads14m
Day 9 · 59m
- 32Multithreading Models & Hyperthreading18m
- 33fork() and exec() System Calls21m
- 34Threading Issues [fork() & exec() System Calls]10m
- 35Threading Issues (Thread Cancellation)11m
Day 10 · 51m
- 36Introduction to CPU Scheduling10m
- 37CPU and I/O Burst Cycles8m
- 38Preemptive and Non-Preemptive Scheduling19m
- 39Scheduling Criteria14m
Day 11 · 46m
- 40Scheduling Algorithms - First Come First Served (FCFS)17m
- 41First Come First Served Scheduling (Solved Problem 1)19m
- 42First Come First Served Scheduling (Solved Problem 2)10m
Day 12 · 52m
- 43Scheduling Algorithms - Shortest Job First (SJF)29m
- 44Shortest Job First Scheduling (Solved Problem 1)12m
- 45Shortest Job First Scheduling (Solved Problem 2)12m
Day 13 · 47m
- 46Scheduling Algorithms - Priority Scheduling17m
- 47Priority Scheduling (Solved Problem 1)16m
- 48Priority Scheduling (Solved Problem 2)14m
Day 14 · 55m
- 49Scheduling Algorithms - Round Robin Scheduling15m
- 50Round Robin Scheduling (Turnaround Time & Waiting Time)19m
- 51Round Robin Scheduling - Solved Problem (Part 1)20m
Week 3Videos 52–77 · 4h 59m
Day 15 · 58m
- 52Round Robin Scheduling - Solved Problem (Part 2)7m
- 53Multilevel Queue Scheduling Algorithm15m
- 54Multilevel Feedback-Queue Scheduling Algorithm14m
- 55Scheduling Algorithms – Solved Problems22m
Day 16 · 57m
- 56Process Synchronization21m
- 57The Critical-Section Problem14m
- 58Peterson’s Solution22m
Day 17 · 53m
- 59Test and Set Lock19m
- 60Semaphores23m
- 61Disadvantages of Semaphores11m
Day 18 · 52m
- 62The Bounded Buffer Problem16m
- 63The Readers Writers Problem16m
- 64The Dining Philosophers Problem20m
Day 19 · 52m
- 65Monitors14m
- 66Dining Philosophers Solution using Monitors15m
- 67Process Synchronization - Problem 110m
- 68Process Synchronization - Problem 213m
Day 20 · 28m
- 69Process Synchronization - Problem 38m
- 70Process Synchronization - Problem 49m
- 71Process Synchronization - Problem 54m
- 72Deadlocks | Chapter-7 | Operating System | nesoacademy.org1m
- 73Main Memory | Chapter-8 | Operating System | nesoacademy.org1m
- 74Virtual Memory | Chapter-9 | Operating System | nesoacademy.org1m
- 75File Systems | Chapter-10 | Operating System | nesoacademy.org1m
- 76File System Implementation | Chapter-11 | Operating System | nesoacademy.org1m
- 77Mass Storage Structure | Chapter-12 | Operating System | nesoacademy.org1m
Tips for finishing
- Use it for processes, scheduling and synchronization, then cover deadlocks and memory with Gate Smashers' or Jenny's Lectures' OS playlists.
- Tick off the six preview videos in the playlist length calculator so the planner doesn't schedule them.