Master operating systems concepts essential for technical interviews at product-based companies through this comprehensive 16-hour course. Gain in-depth knowledge starting with OS fundamentals including types of operating systems, multi-tasking versus multi-threading, and system components. Explore system calls with hands-on terminal practice, understand the boot process, and learn differences between 32-bit and 64-bit systems. Dive deep into process management covering process creation, states, context switching, and scheduling algorithms including FCFS, Shortest Job First, Priority Scheduling, Round Robin, and Multi-Level Queue Scheduling. Study concurrency and synchronization through multi-threading in C++, critical section problems, race conditions, semaphores, and conditional variables. Solve classic synchronization problems including Producer-Consumer, Reader-Writer, and Dining Philosophers scenarios. Understand deadlock concepts, necessary conditions, avoidance strategies, detection, and recovery methods. Master memory management techniques including contiguous and non-contiguous allocation, paging, segmentation, virtual memory, page faults, and page replacement algorithms with LRU implementation. Learn about thrashing and practice solving LeetCode concurrency problems to reinforce theoretical concepts with practical application.

Syllabus

Introduction to Operating Systems Placements Course 2022
Lecture 1: What is an Operating System ?
Lecture 2: Types of Operating Systems
Lecture 3: Multi-Tasking vs Multi-Threading
Lecture 4: Components of Operating System
Lecture 5: System Calls in Operating System [Theory + Example + Hands-on Terminal]
Lecture 6: How Operating System Boots up?
Lecture 7: Difference between 32-bit & 64-bit Operating System
Lecture 8: Comparison between different STORAGES used in Computer
Lecture 9: How OS creates a PROCESS || Introduction to Process
Lecture 10: What are different Process States in Operating System ?
Lecture 11: Context Switching in OS | Medium Term Scheduler | Orphan/Zombie Process
Lecture 12: What is Convoy Effect | FCFS CPU Scheduling Algorithm
Lecture 13: Shortest Job First Algorithm | Priority Scheduling | Round Robin CPU Scheduling
Lecture 14: Multi Level Queue Scheduling || MLFQ || Comparison btw CPU Scheduling Algorithms
Lecture 15: What is Concurrency ? || Multi-Threading in C++ || Operating Systems Placement Series
Lecture 16: Critical Section Problem || Race condition in OS
Lecture 17: Conditional Variables & Semaphores to Synchronise Threads
Lecture 18: Producer Consumer Problem and its Solution || OS Placement Series
Lecture 19: Reader-Writer Problem and its Solution || OS Placement Series
Lecture 20: The Dining Philosophers Problem & its Solution
Lecture 21: What is Deadlock | Necessary Conditions | Handling Methods | Part - 1
Lecture 22: Deadlock Avoidance | Deadlock Detection and Recovery | Part - 2
Lecture 23: Solving LeetCode Problems on Concurrency || OS Placement Series
Lecture 24: Memory Management in OS || Contiguous Memory Allocation
Lecture 25: How OS manages Free Space? || Memory Management
Lecture 26: What is Paging? || Non-Contiguous Memory Allocation
Lecture 27: What is Segmentation || Non-Contiguous Memory Allocation
Lecture 28: What is Virtual Memory? || Page fault in OS
Lecture 29: Page Replacement Algorithms || How to implement LRU algorithm?
Lecture 30: What is Thrashing? || Important Interview Question
Bonus Session: Solving LeetCode Problems on Concurrency || Operating Systems Placement Series