Forwarded from ⭕(Important )⭕IS-20/21AM SU⭕ (Eyad Alolofi)
نماذج نظم تشغيل
Forwarded from H M
When multiple programming needs to decrease, can be added.........
Anonymous Quiz
19%
Long-term scheduler
28%
Scheduling queues
43%
Medium-term scheduler
11%
Short-term scheduler
Forwarded from H M
When CPU switches to another process, the system must save the state of the old process and load the saved state for the new process via a context switch
Anonymous Quiz
17%
False
83%
True
Forwarded from H M
When CPU switches to another process, the system must save the state of the old process and load the saved state for the new process via a .........
Anonymous Quiz
68%
context switch
15%
Medium-term scheduler
15%
Process creation
3%
Not one of the mentioned
Forwarded from H M
Context-switch time is overhead; the system does no useful work while switching
Anonymous Quiz
66%
True
34%
False
Forwarded from H M
process identified and managed via a .......
Anonymous Quiz
22%
Process creation
12%
Process Terminatin
63%
process identifier (pid)
2%
Not one of the mentioned
Forwarded from H M
........... implies a system can perform more than one task simultaneously
Anonymous Quiz
53%
Parallelism
24%
Concurrency
13%
Data splitting
11%
Data dependency
Forwarded from H M
which of the following Multithreading model ,The entire process will block if a thread makes a blocking system call.
Anonymous Quiz
19%
One to One model
54%
Many to One model
11%
One to Many model
16%
Many to Many model
👍2
Forwarded from H M
We want to keep the CPU as busy as possible,This criteria refers to as
Anonymous Quiz
81%
CPU utilization
8%
Response time
8%
Throughput
3%
Waiting time
Forwarded from H M
In Shortest-Job-First Scheduling If the next CPU bursts of two processes are the same, ____ scheduling is used to break the tie.
Anonymous Quiz
53%
First-Come, First-Served
26%
Shortest-Job-First
18%
Priority
3%
Round-Robin
Forwarded from H M
Which of the following algorithms satisfies the fairness among the scheduled processes
Anonymous Quiz
30%
Shortest-Job-First Scheduling
57%
Round-Robin Scheduling
5%
Priority Scheduling
8%
First-Come, First-Served Scheduling
Forwarded from H M
A deadlock situation can arise if which of the following conditions hold simultaneously in a system:
Anonymous Quiz
27%
Mutual exclusion
5%
No preemption
24%
Hold and wait
43%
All of the above
Forwarded from H M
If circular request/assign exists between process and resource
Anonymous Quiz
15%
There must be a deadlock
18%
There must be a deadlock if the resource has a single instance
52%
There must be a deadlock if the resource has a single instance and is assigned.
15%
All the mentioned answers
Forwarded from H M
........... time it takes for the dispatcher to stop one process and start another running
Anonymous Quiz
26%
Waiting time
15%
CPU utilization
6%
Nonpreemptive
53%
Dispatch latency
Forwarded from H M
........... keep the CPU as busy as possible
Anonymous Quiz
15%
Throughput
79%
CPU utilization
3%
Response time
3%
Waiting time
Forwarded from H M
..............Number of processes that complete their execution per time unit
Anonymous Quiz
22%
Response time
24%
Turnaround time
14%
CPU utilization
41%
Throughput
👍1
Forwarded from H M
...............amount of time to execute a particular process
Anonymous Quiz
67%
Turnaround time
14%
Throughput
17%
Waiting time
3%
CPU utilization