Operating Systems for Placements 2022
5.0
(1)
8 learners
What you'll learn
This course includes
- 16 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 32 lessons • 16 hours of video
Operating Systems for Placements 2022
32 lessons
• 16 hours
Operating Systems for Placements 2022
32 lessons
• 16 hours
- Introduction to Operating Systems Placements Course 2022 07:21
- Lecture 1: What is an Operating System ? 18:38
- Lecture 2: Types of Operating Systems 40:21
- Lecture 3: Multi-Tasking vs Multi-Threading 38:57
- Lecture 4: Components of Operating System 45:16
- Lecture 5: System Calls in Operating System [Theory + Example + Hands-on Terminal] 28:13
- Lecture 6: How Operating System Boots up? 18:31
- Lecture 7: Difference between 32-bit & 64-bit Operating System 20:17
- Lecture 8: Comparison between different STORAGES used in Computer 11:14
- Lecture 9: How OS creates a PROCESS || Introduction to Process 37:35
- Lecture 10: What are different Process States in Operating System ? 18:18
- Lecture 11: Context Switching in OS | Medium Term Scheduler | Orphan/Zombie Process 40:41
- Lecture 12: What is Convoy Effect | FCFS CPU Scheduling Algorithm 24:55
- Lecture 13: Shortest Job First Algorithm | Priority Scheduling | Round Robin CPU Scheduling 44:33
- Lecture 14: Multi Level Queue Scheduling || MLFQ || Comparison btw CPU Scheduling Algorithms 28:02
- Lecture 15: What is Concurrency ? || Multi-Threading in C++ || Operating Systems Placement Series 24:20
- Lecture 16: Critical Section Problem || Race condition in OS 35:29
- Lecture 17: Conditional Variables & Semaphores to Synchronise Threads 22:53
- Lecture 18: Producer Consumer Problem and its Solution || OS Placement Series 14:47
- Lecture 19: Reader-Writer Problem and its Solution || OS Placement Series 13:51
- Lecture 20: The Dining Philosophers Problem & its Solution 16:24
- Lecture 21: What is Deadlock | Necessary Conditions | Handling Methods | Part - 1 54:06
- Lecture 22: Deadlock Avoidance | Deadlock Detection and Recovery | Part - 2 23:50
- Lecture 23: Solving LeetCode Problems on Concurrency || OS Placement Series 31:21
- Lecture 24: Memory Management in OS || Contiguous Memory Allocation 49:09
- Lecture 25: How OS manages Free Space? || Memory Management 31:10
- Lecture 26: What is Paging? || Non-Contiguous Memory Allocation 47:37
- Lecture 27: What is Segmentation || Non-Contiguous Memory Allocation 27:12
- Lecture 28: What is Virtual Memory? || Page fault in OS 44:15
- Lecture 29: Page Replacement Algorithms || How to implement LRU algorithm? 41:29
- Lecture 30: What is Thrashing? || Important Interview Question 35:09
- Bonus Session: Solving LeetCode Problems on Concurrency || Operating Systems Placement Series 33:49
Take this course with you
Download the app to continue lessons from your phone anytime.
