Lesson 1 of 28 • 21 upvotes • 8:28mins
This lecture covers the basic concepts of CPU scheduling including the important terms related to CPU scheduling algorithms.
28 lessons • 4h 17m
CPU Scheduling
8:28mins
First Come First Scheduling
8:46mins
Shortest Job First Algorithm
9:19mins
Priority Scheduling
9:28mins
Round Robin CPU Scheduling
10:54mins
Deadlocks
10:06mins
Methods for Handling Deadlocks
9:26mins
Deadlock avoidance- safe state
9:39mins
Resource Allocation Graph
8:01mins
Banker's Algorithm- part 1
9:52mins
Banker's algorithm -part 2
9:05mins
Deadlock detection and recovery algorithm
10:24mins
Memory management Part-1 (address binding)
8:30mins
Memory management part-2 (Logical vs Physical address)
8:24mins
Memory allocation techniques
8:48mins
Fixed size & Variable size partitioning
8:09mins
Variable sized - First Fit, Best Fit & Worst Fit
10:40mins
Fixed size - First fit,Best fit & worst fit
11:10mins
Paging
11:12mins
Numerical on Paging
9:30mins
Paging numericals
9:27mins
Segmentation
8:33mins
July 2018 ques on SJF
8:02mins
Dec 2016 ques on deadlock
8:13mins
August 2016 ques on CPU scheduling
8:31mins
FIFO - page replacement algorithm
8:05mins
Least Recently Used algorithm(LRU)
8:14mins
Optimal Page Replacement algorithm
8:01mins