Gate Smashers Operating System: study plan and how long it takes
The Gate Smashers playlist is 92 videos and 20.3 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.
92 videos · 20.3 hours · Gate Smashers
Gate Smashers' Operating System playlist covers processes and system calls like fork, CPU scheduling with solved numericals, process synchronization and semaphores, deadlocks, memory management, paging and virtual memory, disk scheduling and file systems, ending with common OS interview questions.
Lectures are short and in Hindi, with plenty of GATE-style questions worked through on the board.
Who it's for: GATE and university students, and anyone revising OS fundamentals for placements.
How long does it take?
The full playlist is 20.3 hours across 92 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 | 41 days | 28 days | 21 days |
| 1 h a day | 21 days | 14 days | 11 days |
| 2 h a day | 11 days | 7 days | 6 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–31 · 5h 58m
Day 1 · 54m
- 1Lec-0:Operating System Syllabus Discussion for all College/University & Competitive exams (GATE,NET)13m
- 2L-1.1: Introduction to Operating System and its Functions with English Subtitles19m
- 3L-1.2: Batch Operating System | Types of Operating System7m
- 4L-1.3: Multiprogramming and Multitasking Operating System in Hindi with real life examples7m
- 5L-1.4: Types of OS(Real Time OS, Distributed, Clustered & Embedded OS)8m
Day 2 · 59m
- 6L-1.5: Process States in Operating System| Schedulers(Long term,Short term,Medium term)21m
- 7L-1.6: Imp Linux Commands(Operating System) | Must Watch for College/University & Competitive exams11m
- 8L-1.7: System Calls in Operating system and its types in Hindi10m
- 9L-1.8: Fork System call with Example | Fork() system call questions10m
- 10L-1.9: Questions on Fork System Call With Explanation | Operating System7m
Day 3 · 57m
- 11L-1.10: User mode and Kernel mode in operating system in hindi7m
- 12L-1.11: Process Vs Threads in Operating System11m
- 13L-1.12: User Level Vs Kernel Level Thread in Operating System | All Imp Points8m
- 14L-2.1: Process Scheduling Algorithms (Preemption Vs Non-Preemption) | CPU Scheduling in OS11m
- 15L-2.2: What is Arrival, Burst, Completion, Turnaround, Waiting and Response time in CPU Scheduling9m
- 16L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example11m
Day 4 · 58m
- 17L-2.4: Shortest Job First(SJF) Scheduling Algorithm with Example | Operating System9m
- 18L-2.5: Shortest Remaining Time First (SJF With Preemption) Scheduling Algorithm with Example | OS14m
- 19L-2.6: Question on Shortest Job First(SJF) with Preemption Scheduling Algorithm8m
- 20L-2.7: Round Robin(RR) CPU Scheduling Algorithm with Example16m
- 21L-2.8: Pre-emptive Priority Scheduling Algorithm with Example | Operating System11m
Day 5 · 40m
- 22L-2.9: Example of Mix Burst Time(CPU & I/O both) in CPU Scheduling | Tough Question14m
- 23L-2.10: Multi Level Queue Scheduling | Operating System4m
- 24L-2.11: Multilevel Feedback Queue Scheduling | Operating System5m
- 25L-3.1: Process Synchronization | Process Types | Race Condition | Operating System-117m
Day 6 · 40m
- 26L-3.2: Producer Consumer Problem | Process Synchronization Problem in Operating System27m
- 27L-3.3: Printer-Spooler Problem | Process Synchronization Problem in Operating System13m
Day 7 · 51m
- 28L-3.4: Critical Section Problem | Mutual Exclusion, Progress and Bounded Waiting | Operating System26m
- 29L-3.5: LOCK Variable in OS | Process Synchronization7m
- 30L-3.6: Test and Set Instruction in OS | Process Synchronization9m
- 31L-3.7: Turn Variable | Strict Alteration Method | Process Synchronization8m
Week 2Videos 32–48 · 5h 45m
Day 8 · 53m
- 32L-3.8: Semaphores | Wait, Signal Operation | Counting Semaphore | Example| Operating system25m
- 33L-3.9: What is Binary Semaphore | Easiest Explanation | Operating system12m
- 34L-3.10: Practice Question on Binary Semaphore in Operating System16m
Day 9 · 39m
- 35L-3.11: Solution of Producer Consumer Problem using Semaphore | Operating System18m
- 36L-3.12: Solution of Readers-writers Problem using Binary semaphore21m
Day 10 · 48m
- 37L-3.13: Dining philosophers Problem and Solution using Semaphore in Operating System35m
- 38L-4.1: DEADLOCK concept | Example | Necessary condition | Operating System12m
Day 11 · 48m
- 39L-4.2: Resource Allocation Graph in Deadlock | Single Instance with example | Operating System26m
- 40L-4.3: Multi-Instance Resource Allocation Graph with Example | Operating System22m
Day 12 · 49m
- 41L-4.4: Deadlock Handling Methods and Deadlock Prevention | Operating System25m
- 42L-4.5: Deadlock Avoidance Banker's Algorithm with Example |With English Subtitles24m
Day 13 · 54m
- 43L-4.6: GATE 2018 Question on Banker's Algorithm | Deadlock avoidance | Operating System16m
- 44L-4.7: Question Explaination on Deadlock | Operating System16m
- 45L-4.8: GATE 2018 Question Explaination on deadlock | Operating system22m
Day 14 · 54m
- 46L-5.1: Memory Management and Degree of Multiprogramming | Operating System24m
- 47L-5.2: Memory management Techniques | Contiguous and non-Contiguous | Operating System12m
- 48L-5.3: Internal Fragmentation | Fixed size Partitioning | Memory management | Operating System19m
Week 3Videos 49–79 · 6h 13m
Day 15 · 46m
- 49L-5.4: Variable size Partitioning | Memory management | Operating System15m
- 50L-5.5: First Fit, Next Fit, Best Fit, Worst fit Memory Allocation | Memory Management | OS16m
- 51L-5.6: GATE Question Solved on First Fit,Best Fit and Worst fit Memory Allocation | Operating System14m
Day 16 · 56m
- 52L-5.7: GATE 2007 Question Solved on First Fit, Best Fit and Worst fit with timeline | OS16m
- 53L-5.8: Need of Paging | Memory Management | Operating System14m
- 54L-5.9: What is Paging | Memory management | Operating System26m
Day 17 · 56m
- 55L-5.10: Question Explanation on Logical address and Physical address space | Operating System15m
- 56L-5.11: Question Explanation on Paging | Memory Management | Operating System14m
- 57L-5.12: Page Table Entries | Format of Page Table | Operating System11m
- 58L-5.13: 2-Level Paging in Operating System | Multilevel Paging16m
Day 18 · 55m
- 59L-5.14: Inverted paging | Memory Management | Operating System11m
- 60L-5.15: Paging Questions in Operating System(OS) | Imp Question for all competitive exams8m
- 61L-5.16: What is Thrashing | Operating System9m
- 62L-5.17: Segmentation Vs Paging | Segmentation Working | Operating system17m
- 63L-5.18: Overlay | Memory Management | Operating system11m
Day 19 · 53m
- 64L-5.19: Virtual Memory | Page fault | Significance of virtual memory | Operating System20m
- 65L-5.20: Translation Lookaside Buffer(TLB) in Operating System in Hindi12m
- 66L-5.21: Numerical on Translation Lookaside Buffer (TLB) | Operating System5m
- 67L-5.22: Page Replacement Introduction | FIFO Page Replacement algorithm | Operating System16m
Day 20 · 52m
- 68L-5.23: Belady's Anomaly in FIFO page Replacement with example | Operating System12m
- 69L-5.24: Optimal Page Replacement algorithm | Operating System13m
- 70L-5.25: Least Recently Used Page Replacement Algorithm | Operating System8m
- 71L-5.26: Most recently used page replacement algorithm | Operating System7m
- 72L-6.1: Hard Disk Architecture in Operating System in Hindi12m
Day 21 · 56m
- 73L-6.2: Disk Access Time with Example | Seek Time, Rotational Time and Transfer Time15m
- 74L-6.3: Disk Scheduling Algorithm | Operating System6m
- 75L-6.4: FCFS in Disk scheduling with Example | Operating System9m
- 76L-6.5: SSTF in Disk scheduling with Example | Operating System9m
- 77L-6.6: SCAN Algorithm in Disk scheduling with Example | Operating System8m
- 78L-6.7: LOOK Algorithm in Disk scheduling with Example | Operating System4m
- 79L-6.8: C-SCAN Algorithm in Disk scheduling with Example | Operating System5m
Week 4Videos 80–92 · 2h 23m
Day 22 · 54m
- 80L-6.9: C-LOOK Algorithm in Disk scheduling with Example | Operating System5m
- 81L-6.10: Important Questions on Operating System | Must Watch | NTA NET June 202110m
- 82L-7.1: File System in Operating System | Windows, Linux, Unix, Android etc.10m
- 83L-7.2: File Attributes & Operations in Operating System11m
- 84L-7.3: Allocation Methods in operating system in hindi | Contiguous vs NonContiguous6m
- 85L-7.4: Contiguous Allocation in Operating system | Advantages & Disadvantages13m
Day 23 · 53m
- 86L-7.5: Linked List allocation in file allocation with example | Operating system11m
- 87L-7.6: Indexed File Allocation in Operating System11m
- 88L-7.7: Unix Inode Structure with Numerical Example | OS10m
- 89Lec-8: Protection & Security in Operating system | Full OS playlist21m
Day 24 · 35m
- 90TLBs Toughest Question asked in GATE exam | Operating System10m
- 91Top 15 OS Interview Questions | Operating System Interview | Placement Strategy16m
- 92Linker & Loader with example10m
Tips for finishing
- Solve the scheduling and page-replacement numericals yourself before watching the solution; that's what exams test.
- Watch the 'Top 15 OS Interview Questions' video before placement interviews even if you skip the rest.