Lesson 10 of 43 • 59 upvotes • 5:09mins
43 lessons • 4h 4m
Overview of Course (in Hindi )
3:05mins
Scheduling Algorithm Used is Preemptive Shortest Remaining Time First (in Hindi)
7:05mins
The Gantt Chart for Preemptive SJF Scheduling Time Algorithm (in Hindi)
5:48mins
The Gantt Chart for Preemptive SJF Scheduling Time Algorithm (in Hindi)
5:48mins
With Reference to Current Allocation System is Safe or Unsafe (in Hindi)
6:11mins
System is in Safe State (in Hindi)
6:15mins
Banker's algorithm for deadlock (in Hindi )
6:16mins
Preemptive SJF (in Hindi )
6:02mins
CPU scheduling policy is FCFS, calculate the average waiting time,average TAT( in Hindi)
5:20mins
CPU scheduling policy is SRTF (in Hindi)
6:01mins
CPU scheduling policy is FCFS,calculate the averagevwaiting time (in Hindi)
5:09mins
CPU scheduling policy is SJF preemptive,calculate the average waiting time and ATT (in Hindi )
5:19mins
The total head movement FCFS algorithm (in Hindi)
5:44mins
Mutual Exclusion previous year Question( in Hindi )
6:24mins
The resulting value of the semaphore (in Hindi)
6:22mins
Binary semaphores and deadlock (in Hindi )
5:02mins
How many times will process P0 print '0' (in Hindi)
6:32mins
Find waiting time of p2 (in Hindi)
5:25mins
Deadlock situation with semaphore (in Hindi )
5:33mins
Processes access the semaphore in given order , find the value of final semaphore (in Hindi )
5:08mins
LRU page replacement algorithm (in Hindi)
5:21mins
Current allocation and maximum requirement given system is in safe state or not (in Hindi)
4:28mins
The average waiting time of all the processes using preemptive priority scheduling( in Hindi)
5:54mins
Resource allocation previous year Question( in Hindi )
6:45mins
The pre-emptive shortest job first scheduling algorithm (in Hindi)
5:42mins
Belady’s anomaly (in Hindi)
5:33mins
Page replacement theoretical questions( in Hindi)
5:50mins
Belady’s anomaly (in Hindi)
5:33mins
Shortest remaining time first find value of Z (in Hindi)
6:59mins
The difference in the number of page faults between LIFO and optimal (in Hindi )
7:24mins
How many page fault will occur( in Hindi )
6:03mins
Cpu utilization formula( in Hindi )
4:44mins
Numerical of CPU utilization (in Hindi)
4:26mins
In a uniprocessor CPU UTILIZATION ( in Hindi)
4:41mins
A single processor CPU UTILIZATION( In Hindi)
3:55mins
Fork() (in Hindi )
6:19mins
FIFO page replacement algorithm( in Hindi )
6:34mins
LRU page replacement algorithm( in Hindi )
7:08mins
Build a memory system by using another memory( in Hindi )
6:07mins
Semaphore (in Hindi )
5:09mins
Semaphore calculation( in Hindi )
4:23mins
Round Robin scheduling with time slice 1( in Hindi)
5:20mins
Solve this Round robin scheduling question (in Hindi )
5:09mins