Operating Systems
5.0
(1)
7 learners
What you'll learn
This course includes
- 8.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 31 lessons • 8.5 hours of video
Operating Systems
31 lessons
• 8.5 hours
Operating Systems
31 lessons
• 8.5 hours
- Introduction to Operating System and its Functions | Operating System | Lecture 1 23:56
- Types of Operating Systems(Batch, Multiprogramming, Time Sharing, Multiprocessing, Real Time) 18:06
- Process State Transition Diagram and various Schedulers | Operating System 16:40
- FCFS(First Come First Serve) CPU Scheduling Algorithm with example | Operating System 17:50
- Convoy Effect in FCFS(First Come First Serve) Algorithm| Operating System 10:58
- Shortest Job First(SJF) Scheduling Algorithm with example | Operating System 12:58
- Shortest Remaining Time First(SRTF) Scheduling Algorithm with Example | Operating System 15:16
- Advantage and Disadvantage of Shortest Job First(SJF) Scheduling Algorithm | Operating System 16:44
- SJF with Prediction of Burst Time in OS | with example 14:13
- SJF with processes having CPU and IO Time | CPU Scheduling Algorithm in OS 23:11
- FCFS with IO Time - CPU Scheduling Algorithm in OS 14:54
- Round Robin(RR) CPU Scheduling Algorithm in OS with example 19:47
- Round Robin(RR) Scheduling example with advantages and drawbacks | Operating Systems 23:03
- GATE Computer Science previous year question on Round Robin(RR) scheduling | Operating Systems 06:06
- Non Preemptive Priority Scheduling Algorithm with example | Operating System 15:34
- Lec 17: Preemptive Priority Scheduling Algorithm in OS with example | Operating System 17:48
- Lec18 Starvation and Aging in Priority Scheduling | Operating Systems 09:49
- Lec19 Deadlock | Necessary conditions for Deadlock | Operating Systems 13:15
- Lec20 Resource Allocation Graph in Deadlock | with example | Operating System 25:09
- Lec21 Deadlock handling methods | Deadlock Prevention | Operating System 31:13
- Lec22 Deadlock Avoidance with Resource Allocation Graph(with example) | Operating System 16:40
- Lec23 Deadlock Avoidance: Banker's Algorithm with example | Operating System 21:12
- Lec24 Deadlock Avoidance: Bankers(Resource Request Algorithm) with example |Operating System 21:19
- Lec25 Deadlock Detection and Recovery : Wait-for Graph and Banker's algorithm | Operating System 19:07
- Lec26 Deadlock Recovery in Operating System 11:56
- Lec27 Deadlock | GATE Question Previous Year | Operating System 11:27
- CPU Scheduling Criteria in Operating system | Various Times related to Process 08:25
- Lec28 Page replacement Introduction| FIFO page replacement algorithm with example| Operating System 20:09
- Lec29 Page Replacement Algorithms | LRU and optimal | Operating Systems 16:18
- Lec30 Belady's Anomaly in FIFO page replacement algorithm with example | Operating System 11:27
- Lec31 Multilevel queues and multilevel feedback queue scheduling | Operating systems 13:52
Take this course with you
Download the app to continue lessons from your phone anytime.
