Operating System
5.0
(0)
15 learners
What you'll learn
This course includes
- 10.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 89 lessons • 10.5 hours of video
Operating System
89 lessons
• 10.5 hours
Operating System
89 lessons
• 10.5 hours
- Operating System Overview 01:02
- Process management 06:29
- Process State Transitions 06:48
- Process Creation GATE Problem 03:10
- Process Schedule GATE Problem 04:05
- Concurrent Process 06:27
- Concurrent Process GATE Problem 03:17
- Operating System Thread 07:23
- CPU Scheduling 12:55
- FCFS CPU Scheduling Algorithm 04:55
- SJF CPU Scheduling Algorithm 10:11
- Priority CPU Scheduling Algorithm 05:12
- Round Robin CPU Scheduling Algorithm 08:11
- Multilevel Queue and Multilevel Feedback Queue Scheduling 04:14
- Introduction To Process Synchronization 13:28
- Critical Section Problem 06:59
- Mutual Exclusion Using Critical Region 03:12
- Introduction to Semaphore 08:41
- Record Based Semaphore & Binary Semaphore 10:19
- Deadlock & Starvation in Semaphore 04:42
- Bounded Buffer Problem 07:17
- Dining Philosopher Problem 09:04
- Readers & Writers Problem 07:32
- Readers & Writers Problem Algorithm 10:48
- Deadlocks Introduction 07:16
- Resource Allocation Graph 06:53
- Necessary Conditions & Deadlock Prevention 16:30
- Deadlock Avoidance, Banker's Algorithm with Example 19:37
- Banker's Algorithm GATE Problem 08:01
- Resource Request Algorithm 04:43
- Deadlocks Detection 05:56
- Deadlocks Recovery 05:55
- Memory Management 07:28
- Dynamic Loading, Linking & Overlay 08:26
- Logical Vs Physical Address Space 07:24
- Single & Multiple Partition Allocation Schemes 06:45
- Single Partition Memory Allocation Example 06:53
- Multiple Partition Memory Allocation Example 03:45
- Memory Allocation Strategy Example 08:49
- Compaction And Coalescing Example 07:58
- Memory Management Using Paging 08:51
- Paging Memory Management Example 03:56
- Multilevel Paging and Inverted Page Table 06:23
- Memory Management GATE Example 1 07:28
- Memory Management GATE Example 2 04:50
- Memory Management Using Segmentation 10:43
- Memory Management GATE Example 3 07:37
- Exercise on Segmentation 04:07
- Virtual Memory 08:34
- Page Fault in Virtual Memory 11:14
- FIFO Page Replacement Algorithm GATE Example 06:57
- Optimal Page Replacement Algorithm GATE Example 06:06
- LRU Page Replacement Algorithm 12:59
- Page Fault GATE Problem 04:20
- Page Replacement GATE Problem 1 09:08
- Page Replacement GATE Problem 2 07:58
- Page Replacement GATE Problem 3 05:54
- Thrashing in Operating System 04:35
- Memory Allocation Algorithm 08:17
- File System I-Node 08:04
- I-Node GATE Problem 1 07:32
- I-Node GATE Problem 2 04:40
- File System GATE Problem 04:30
- Input Output Management 13:06
- Input Output Kernel Subsystem 06:31
- Direct Memory Access (DMA) 07:16
- DMA GATE Problem 1 04:18
- DMA GATE Problem 2 09:05
- Interrupts 10:40
- Interrupt GATE Problem 1 04:22
- Interrupt GATE Problem 2 06:43
- I/O Handling Exercise Problem 02:45
- Disk Management 14:59
- FCFS Disk Scheduling Algorithm 05:07
- SSTF Disk Scheduling Algorithm 04:09
- SCAN Disk Scheduling Algorithm 04:24
- C-SCAN Disk Scheduling Algorithm 05:37
- Disk Scheduling GATE Exercise 07:38
- Disk GATE Problem 1 06:43
- Disk GATE Problem 2 09:53
- Disk GATE Problem 3 08:34
- Disk GATE Problem 4 05:38
- Protection in Operating System 04:31
- Cache Memory GATE Exercise 1 05:10
- Cache Memory GATE Exercise 2 07:42
- Data Path with GATE Problem 05:22
- Operating System Security 05:55
- Security Problems and Security Threads 04:07
- Encryption & Possible Program Threads 04:06
