Please Login To Continue
The pre-emptive shortest job first scheduling algorithm (in Hindi)
Lesson 24 of 43 • 39 upvotes • 5:42mins
Nisha Mittal
(Hindi) Operating System Previous Year Questions with Solutions: NTA-UGC NET
43 lessons • 4h 4m
1
Overview of Course (in Hindi )
3:05mins
2
Scheduling Algorithm Used is Preemptive Shortest Remaining Time First (in Hindi)
7:05mins
3
The Gantt Chart for Preemptive SJF Scheduling Time Algorithm (in Hindi)
5:48mins
4
The Gantt Chart for Preemptive SJF Scheduling Time Algorithm (in Hindi)
5:48mins
4
With Reference to Current Allocation System is Safe or Unsafe (in Hindi)
6:11mins
5
System is in Safe State (in Hindi)
6:15mins
6
Banker's algorithm for deadlock (in Hindi )
6:16mins
7
Preemptive SJF (in Hindi )
6:02mins
8
CPU scheduling policy is FCFS, calculate the average waiting time,average TAT( in Hindi)
5:20mins
9
CPU scheduling policy is SRTF (in Hindi)
6:01mins
10
CPU scheduling policy is FCFS,calculate the averagevwaiting time (in Hindi)
5:09mins
11
CPU scheduling policy is SJF preemptive,calculate the average waiting time and ATT (in Hindi )
5:19mins
12
The total head movement FCFS algorithm (in Hindi)
5:44mins
13
Mutual Exclusion previous year Question( in Hindi )
6:24mins
14
The resulting value of the semaphore (in Hindi)
6:22mins
15
Binary semaphores and deadlock (in Hindi )
5:02mins
16
How many times will process P0 print '0' (in Hindi)
6:32mins
17
Find waiting time of p2 (in Hindi)
5:25mins
18
Deadlock situation with semaphore (in Hindi )
5:33mins
19
Processes access the semaphore in given order , find the value of final semaphore (in Hindi )
5:08mins
20
LRU page replacement algorithm (in Hindi)
5:21mins
21
Current allocation and maximum requirement given system is in safe state or not (in Hindi)
4:28mins
22
The average waiting time of all the processes using preemptive priority scheduling( in Hindi)
5:54mins
23
Resource allocation previous year Question( in Hindi )
6:45mins
24
The pre-emptive shortest job first scheduling algorithm (in Hindi)
5:42mins
25
Belady’s anomaly (in Hindi)
5:33mins
26
Page replacement theoretical questions( in Hindi)
5:50mins
27
Belady’s anomaly (in Hindi)
5:33mins
27
Shortest remaining time first find value of Z (in Hindi)
6:59mins
28
The difference in the number of page faults between LIFO and optimal (in Hindi )
7:24mins
29
How many page fault will occur( in Hindi )
6:03mins
30
Cpu utilization formula( in Hindi )
4:44mins
31
Numerical of CPU utilization (in Hindi)
4:26mins
32
In a uniprocessor CPU UTILIZATION ( in Hindi)
4:41mins
33
A single processor CPU UTILIZATION( In Hindi)
3:55mins
34
Fork() (in Hindi )
6:19mins
35
FIFO page replacement algorithm( in Hindi )
6:34mins
36
LRU page replacement algorithm( in Hindi )
7:08mins
37
Build a memory system by using another memory( in Hindi )
6:07mins
38
Semaphore (in Hindi )
5:09mins
39
Semaphore calculation( in Hindi )
4:23mins
40
Round Robin scheduling with time slice 1( in Hindi)
5:20mins
41
Solve this Round robin scheduling question (in Hindi )
5:09mins
Crack NTA-UGC-NET & SET Exams with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
