Operating System (Complete Playlist)
5.0
(2)
14 learners
What you'll learn
This course includes
- 20.3 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 92 lessons • 20.3 hours of video
Operating System (Complete Playlist)
92 lessons
• 20.3 hours
Operating System (Complete Playlist)
92 lessons
• 20.3 hours
- Lec-0:Operating System Syllabus Discussion for all College/University & Competitive exams (GATE,NET)13:01
- L-1.1: Introduction to Operating System and its Functions with English Subtitles18:59
- L-1.2: Batch Operating System | Types of Operating System07:12
- L-1.3: Multiprogramming and Multitasking Operating System in Hindi with real life examples06:34
- L-1.4: Types of OS(Real Time OS, Distributed, Clustered & Embedded OS)08:15
- L-1.5: Process States in Operating System| Schedulers(Long term,Short term,Medium term)20:54
- L-1.6: Imp Linux Commands(Operating System) | Must Watch for College/University & Competitive exams10:58
- L-1.7: System Calls in Operating system and its types in Hindi10:07
- L-1.8: Fork System call with Example | Fork() system call questions10:02
- L-1.9: Questions on Fork System Call With Explanation | Operating System06:39
- L-1.10: User mode and Kernel mode in operating system in hindi06:46
- L-1.11: Process Vs Threads in Operating System11:17
- L-1.12: User Level Vs Kernel Level Thread in Operating System | All Imp Points08:29
- L-2.1: Process Scheduling Algorithms (Preemption Vs Non-Preemption) | CPU Scheduling in OS10:31
- L-2.2: What is Arrival, Burst, Completion, Turnaround, Waiting and Response time in CPU Scheduling08:59
- L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example10:34
- L-2.4: Shortest Job First(SJF) Scheduling Algorithm with Example | Operating System09:14
- L-2.5: Shortest Remaining Time First (SJF With Preemption) Scheduling Algorithm with Example | OS13:37
- L-2.6: Question on Shortest Job First(SJF) with Preemption Scheduling Algorithm07:52
- L-2.7: Round Robin(RR) CPU Scheduling Algorithm with Example16:23
- L-2.8: Pre-emptive Priority Scheduling Algorithm with Example | Operating System10:30
- L-2.9: Example of Mix Burst Time(CPU & I/O both) in CPU Scheduling | Tough Question14:19
- L-2.10: Multi Level Queue Scheduling | Operating System03:41
- L-2.11: Multilevel Feedback Queue Scheduling | Operating System05:22
- L-3.1: Process Synchronization | Process Types | Race Condition | Operating System-117:02
- L-3.2: Producer Consumer Problem | Process Synchronization Problem in Operating System26:36
- L-3.3: Printer-Spooler Problem | Process Synchronization Problem in Operating System13:15
- L-3.4: Critical Section Problem | Mutual Exclusion, Progress and Bounded Waiting | Operating System25:36
- L-3.5: LOCK Variable in OS | Process Synchronization07:24
- L-3.6: Test and Set Instruction in OS | Process Synchronization09:09
- L-3.7: Turn Variable | Strict Alteration Method | Process Synchronization08:21
- L-3.8: Semaphores | Wait, Signal Operation | Counting Semaphore | Example| Operating system24:42
- L-3.9: What is Binary Semaphore | Easiest Explanation | Operating system12:23
- L-3.10: Practice Question on Binary Semaphore in Operating System16:00
- L-3.11: Solution of Producer Consumer Problem using Semaphore | Operating System17:30
- L-3.12: Solution of Readers-writers Problem using Binary semaphore21:11
- L-3.13: Dining philosophers Problem and Solution using Semaphore in Operating System35:13
- L-4.1: DEADLOCK concept | Example | Necessary condition | Operating System12:21
- L-4.2: Resource Allocation Graph in Deadlock | Single Instance with example | Operating System26:18
- L-4.3: Multi-Instance Resource Allocation Graph with Example | Operating System21:42
- L-4.4: Deadlock Handling Methods and Deadlock Prevention | Operating System24:49
- L-4.5: Deadlock Avoidance Banker's Algorithm with Example |With English Subtitles24:04
- L-4.6: GATE 2018 Question on Banker's Algorithm | Deadlock avoidance | Operating System16:02
- L-4.7: Question Explaination on Deadlock | Operating System15:46
- L-4.8: GATE 2018 Question Explaination on deadlock | Operating system22:15
- L-5.1: Memory Management and Degree of Multiprogramming | Operating System23:41
- L-5.2: Memory management Techniques | Contiguous and non-Contiguous | Operating System11:46
- L-5.3: Internal Fragmentation | Fixed size Partitioning | Memory management | Operating System18:53
- L-5.4: Variable size Partitioning | Memory management | Operating System15:11
- L-5.5: First Fit, Next Fit, Best Fit, Worst fit Memory Allocation | Memory Management | OS16:22
- L-5.6: GATE Question Solved on First Fit,Best Fit and Worst fit Memory Allocation | Operating System14:02
- L-5.7: GATE 2007 Question Solved on First Fit, Best Fit and Worst fit with timeline | OS15:41
- L-5.8: Need of Paging | Memory Management | Operating System14:20
- L-5.9: What is Paging | Memory management | Operating System25:54
- L-5.10: Question Explanation on Logical address and Physical address space | Operating System15:25
- L-5.11: Question Explanation on Paging | Memory Management | Operating System13:52
- L-5.12: Page Table Entries | Format of Page Table | Operating System10:39
- L-5.13: 2-Level Paging in Operating System | Multilevel Paging15:45
- L-5.14: Inverted paging | Memory Management | Operating System10:35
- L-5.15: Paging Questions in Operating System(OS) | Imp Question for all competitive exams07:53
- L-5.16: What is Thrashing | Operating System08:34
- L-5.17: Segmentation Vs Paging | Segmentation Working | Operating system16:30
- L-5.18: Overlay | Memory Management | Operating system11:12
- L-5.19: Virtual Memory | Page fault | Significance of virtual memory | Operating System20:18
- L-5.20: Translation Lookaside Buffer(TLB) in Operating System in Hindi12:23
- L-5.21: Numerical on Translation Lookaside Buffer (TLB) | Operating System04:31
- L-5.22: Page Replacement Introduction | FIFO Page Replacement algorithm | Operating System16:07
- L-5.23: Belady's Anomaly in FIFO page Replacement with example | Operating System12:26
- L-5.24: Optimal Page Replacement algorithm | Operating System13:07
- L-5.25: Least Recently Used Page Replacement Algorithm | Operating System07:57
- L-5.26: Most recently used page replacement algorithm | Operating System06:42
- L-6.1: Hard Disk Architecture in Operating System in Hindi11:35
- L-6.2: Disk Access Time with Example | Seek Time, Rotational Time and Transfer Time15:13
- L-6.3: Disk Scheduling Algorithm | Operating System06:08
- L-6.4: FCFS in Disk scheduling with Example | Operating System08:44
- L-6.5: SSTF in Disk scheduling with Example | Operating System08:30
- L-6.6: SCAN Algorithm in Disk scheduling with Example | Operating System07:54
- L-6.7: LOOK Algorithm in Disk scheduling with Example | Operating System04:28
- L-6.8: C-SCAN Algorithm in Disk scheduling with Example | Operating System05:22
- L-6.9: C-LOOK Algorithm in Disk scheduling with Example | Operating System04:59
- L-6.10: Important Questions on Operating System | Must Watch | NTA NET June 202109:41
- L-7.1: File System in Operating System | Windows, Linux, Unix, Android etc.09:55
- L-7.2: File Attributes & Operations in Operating System11:14
- L-7.3: Allocation Methods in operating system in hindi | Contiguous vs NonContiguous05:59
- L-7.4: Contiguous Allocation in Operating system | Advantages & Disadvantages12:37
- L-7.5: Linked List allocation in file allocation with example | Operating system10:55
- L-7.6: Indexed File Allocation in Operating System10:43
- L-7.7: Unix Inode Structure with Numerical Example | OS10:26
- Lec-8: Protection & Security in Operating system | Full OS playlist20:54
- TLBs Toughest Question asked in GATE exam | Operating System09:53
- Top 15 OS Interview Questions | Operating System Interview | Placement Strategy15:37
- Linker & Loader with example09:54
