This course covers the following learning outcomes and goals: understanding the functions of an operating system, different types of operating systems, process states, system calls, process scheduling algorithms, process synchronization, deadlock concepts, memory management techniques, and page replacement algorithms.
The course teaches individual skills such as using Linux commands, understanding process vs threads, implementing process synchronization using semaphores, handling deadlocks, managing memory through paging and segmentation, and implementing page replacement algorithms.
The teaching method of the course includes lectures with English subtitles, real-life examples, and practice questions to reinforce learning.
The intended audience for this course includes college and university students, as well as individuals preparing for competitive exams such as GATE and NET.
Overview
Syllabus
Lec-0: Operating System Syllabus Discussion for all College/University & Compititve exams (GATE,NET).
L-1.1: Introduction to Operating System and its Functions with English Subtitles.
L-1.2: Batch Operating System | Types of Operating System.
L-1.3: Multiprogramming and Multitasking Operating System in Hindi with real life examples.
L-1.4: Types of OS(Real Time OS, Distributed, Clustered & Embedded OS).
L-1.5: Process States in Operating System| Schedulers(Long term,Short term,Medium term).
L-1.6: Imp Linux Commands(Operating System) | Must Watch for College/University & Competitive exams.
L-1.7: System Calls in Operating system and its types in Hindi.
L-1.8: Fork System call with Example | Fork() system call questions.
L-1.9: Questions on Fork System Call With Explanation | Operating System.
L-1.10: User mode and Kernel mode in operating system in hindi.
L-1.11: Process Vs Threads in Operating System.
L-1.12: User Level Vs Kernel Level Thread in Operating System | All Imp Points.
L-2.1: Process Scheduling Algorithms (Preemption Vs Non-Preemption) | CPU Scheduling in OS.
L-2.2: What is Arrival, Burst, Completion, Turnaround, Waiting and Response time in CPU Scheduling.
L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example.
L-2.4: Shortest Job First(SJF) Scheduling Algorithm with Example | Operating System.
L-2.5: Shortest Remaining Time First (SJF With Preemption) Scheduling Algorithm with Example | OS.
L-2.6: Question on Shortest Job First(SJF) with Preemption Scheduling Algorithm.
L-2.7: Round Robin(RR) CPU Scheduling Algorithm with Example.
L-2.8: Pre-emptive Priority Scheduling Algorithm with Example | Operating System.
L-2.9: Example of Mix Burst Time(CPU & I/O both) in CPU Scheduling | Tough Question.
L-2.10: Multi Level Queue Scheduling | Operating System.
L-2.11: Multilevel Feedback Queue Scheduling | Operating System.
L-3.1: Process Synchronization | Process Types | Race Condition | Operating System-1.
L-3.2: Producer Consumer Problem | Process Synchronization Problem in Operating System.
L-3.3: Printer-Spooler Problem | Process Synchronization Problem in Operating System.
L-3.4: Critical Section Problem | Mutual Exclusion, Progress and Bounded Waiting | Operating System.
L-3.5: LOCK Variable in OS | Process Synchronization.
L-3.6: Test and Set Instruction in OS | Process Synchronization.
L-3.7: Turn Variable | Strict Alteration Method | Process Synchronization.
L-3.8: Semaphores | Wait, Signal Operation | Counting Semaphore | Example| Operating system.
L-3.9: What is Binary Semaphore | Easiest Explanation | Operating system.
L-3.10: Practice Question on Binary Semaphore in Operating System.
L-3.11: Solution of Producer Consumer Problem using Semaphore | Operating System.
L-3.12: Solution of Readers-writers Problem using Binary semaphore.
L-3.13: Dining philosophers Problem and Solution using Semaphore in Operating System.
L-4.1: DEADLOCK concept | Example | Necessary condition | Operating System.
L-4.2: Resource Allocation Graph in Deadlock | Single Instance with example | Operating System.
L-4.3: Multi-Instance Resource Allocation Graph with Example | Operating System.
L-4.4: Deadlock Handling Methods and Deadlock Prevention | Operating System.
L-4.5: Deadlock Avoidance Banker's Algorithm with Example |With English Subtitles.
L-4.6: GATE 2018 Question on Banker's Algorithm | Deadlock avoidance | Operating Sytem.
L-4.7: Question Explaination on Deadlock | Operating System.
L-4.8: GATE 2018 Question Explaination on deadlock | Operating system.
L-5.1: Memory Management and Degree of Multiprogramming | Operating System.
L-5.2: Memory management Techniques | Contigious and non-Contigious | Operating System.
L-5.3: Internal Fragmentation | Fixed size Partitioning | Memory management | Operating System.
L-5.4: Variable size Partitioning | Memory management | Operating System.
L-5.5: First Fit, Next Fit, Best Fit, Worst fit Memory Allocation | Memory Management | OS.
L-5.6: GATE Question Solved on First Fit,Best Fit and Worst fit Memory Allocation | Operating System.
L-5.7: GATE 2007 Question Solved on First Fit,Best Fit and Worst fit with timeline |Operating System.
L-5.8: Need of Paging | Memory Management | Operating System.
L-5.9: What is Paging | Memory management | Operating System.
L-5.10: Question Explanation on Logical address and Physical address space | Operating System.
L-5.11: Question Explanation on Paging | Memory Management | Operating System.
L-5.12: Page Table Entries | Format of Page Table | Operating System.
L-5.13: 2-Level Paging in Operating System | Multilevel Paging.
L-5.14: Inverted paging | Memory Management | Operating System.
L-5.15: Paging Questions in Operating System(OS) | Imp Question for all competitive exams.
L-5.16: What is Thrashing | Operating System.
L-5.17: Segmentation Vs Paging | Segmentation Working | Operating system.
L-5.18: Overlay | Memory Management | Operating system.
L-5.19: Virtual Memory | Page fault | Significance of virtual memory | Operating System.
L-5.20: Translation Lookaside Buffer(TLB) in Operating System in Hindi.
L-5.21: Numerical on Translation Lookaside Buffer (TLB) | Operating System.
L-5.22: Page Replacement Introduction | FIFO Page Replacement algorithm | Operating System.
L-5.23: Belady's Anomaly in FIFO page Replacement with example | Operating System.
L-5.24: Optimal Page Replacement algorithm | Operating System.
L-5.25: Least Recently Used Page Replacement Algorithm | Operating System.
L-5.26: Most recently used page replacement algorithm | Operating System.
L-6.1: Hard Disk Architecture in Operating System in Hindi.
L-6.2: Disk Access Time with Example | Seek Time, Rotational Time and Transfer Time.
L-6.3: Disk Scheduling Algorithm | Operating System.
L-6.4: FCFS in Disk scheduling with Example | Operating System.
L-6.5: SSTF in Disk scheduling with Example | Operating System.
L-6.6: SCAN Algorithm in Disk scheduling with Example | Operating System.
L-6.7: LOOK Algorithm in Disk scheduling with Example | Operating System.
L-6.8: C-SCAN Algorithm in Disk scheduling with Example | Operating System.
L-6.9: C-LOOK Algorithm in Disk scheduling with Example | Operating System.
L-6.10: Imp Qus. on Operating System | Must Watch | NTA NET June 2021.
L-7.1: File System in Operating System | Windows, Linux, Unix, Android etc..
L-7.2: File Attributes & Operations in Operating System.
L-7.3: Allocation Methods in operating system in hindi | Contiguous vs NonContiguous.
L-7.4: Contiguous Allocation in Operating system | Advantages & Disadvantages.
L-7.5: Linked List allocation in file allocation with example | Operating system.
L-7.6: Indexed File Allocation in Operating System.
L-7.7: Unix Inode Structure with Numerical Example | OS.
Lec-8: Protection & Security in Operating system | Full OS playlist.
TLBs Toughest Question asked in GATE exam | Operating System.
Taught by
Gate Smashers
