WorksheetsOS QUIZ
Total questions: 15
Worksheet time: 8mins
Waiting time for P5 is
0 ms
8 ms
30 ms
23 ms
P3 will start to be process at time =
0
9
16
30
The highest priority process is process
P1
P2
P3
P4
The scheduling strategy where each process in the queue is given a certain amount of time, in turn, to execute and then returned to the queue, unless blocked is referred to as _____________.
Prioritization
Round-Robin
LIFO
All of the above
Which is deadlock avoidance algorithm
fcfs algorithm
bankers algorithm
preemptive algorithm
round robin algorithm
Which is not a necessary condition in Deadlock
mutual exclusion
hold and wait
circular wait
progress
If p1 requesting for r1,r1 allocated to p2,p2 reqesting for r2,r2 is allocated to p1 such condition is called as______ in Deadlock Prevention
mutual exclusion
hold and wait
circular wait
bounding condition
What is the name of the technique in which the operating system of a computer executes several programs concurrently by switching back and forth between them?
Partitioning
Multi-tasking
Windowing
Paging
The strategy of allowing processes that are logically runnable to be temporarily suspended is called
preemptive scheduling
non preemptive scheduling
shortest job first
first come first served
Semaphores are used to solve
Deadlock
Mutual exclusion
Inter-process Communication
Messaging
Which is not a process state?
waiting
terminated
blocked
redirected
FCFS is operates similar to a
stack
sorting algorithm
circle
queue
