Lesson 10 of 35 • 1 upvotes • 14:08mins
In this lecture we will see about the two shortest job algorithms which is both preemptive and non preemptive in nature. We will study about shortest job first and shortest remaining time first algorithm. Let's learn it!
35 lessons • 7h 43m
Overview of Operating Systems
4:22mins
Basics of Operating System
14:57mins
NTA UGC NET Basics of OS- 2
12:37mins
NTA UGC NET Basics of OS-3
13:31mins
NTA UGC NET Process management -1
14:40mins
Process Scheduler and Process Control Block
11:44mins
System calls and Threads
15:00mins
PYQ NTA UGC NET 2012-17
14:00mins
CPU SCHEDULING - FCFS
14:15mins
CPU SCHEDULING - SJF & SRTF
14:08mins
CPU SCHEDULING - Interactive algorithms
13:23mins
CPU SCHEDULING - multi level queue and multilevel feedback queue scheduling
13:02mins
PYQ NTA UGC NET (2012-17)
14:59mins
Process Synchronization 1
15:00mins
Process Synchronization -2
15:00mins
Process Synchronization -3
14:59mins
Process Synchronization -4
13:53mins
Deadlock-1
10:42mins
Deadlock - 2
13:58mins
Deadlock-3
13:32mins
Deadlock-4
13:35mins
NTA NET Memory Management-1
15:00mins
NTA NET Memory Management -2
14:24mins
NTA NET Memory Management -3
11:31mins
NTA NET Memory Management -4
11:00mins
NTA NET Memory Management -5
14:11mins
NTA NET Memory Management -6
14:36mins
NTA NET Memory Management -7
14:53mins
NTA NET Virtual Memory -1
10:58mins
NTA NET Virtual Memory -2
13:41mins
NTA NET Virtual Memory -3
12:50mins
NTA NET File System-1
11:57mins
NTA NET File System -2
11:13mins
NTA NET File System -3
13:34mins
NTA NET File System-4
12:11mins