Problem 1 (2 points x 20). Multiple choice and single answer questions. All anaw

Question

Problem 1 (2 points x 20). Multiple choice and single answer questions. All anawew written in the below table. Marking a choice beside a question will not earn any ren must be 14 17 18 19 20 1. is th e number of processes that are completed per time unit. A) CPU utilization B) Response time C) Turnaround time D) Throughput 2. The occupies the CPU A) dispatch latency B) waiting time C) convoy effect D) system-contention scope pecurs in first-come-first-served scheduling when a process with a long CPU burs 3. In Round Robin scheduling, the time quantum should bewith respect to the context-switch time. A) small B) the same C) large D) unequal 4. The rate of a periodic task in a hard real-time system iswhere p is a period and is the processing time. A) 1/p B) p/t C) 1 D) pt A) When a process becomes runnable, it must announce its deadline requirements to the system. B) Deadlines are assigned as following: the earlier the deadline, the lower the priority: the later the 5. Which of the following is true of earliest-deadline-first (EDF) scheduling algorithm? deadline, the higher the priority C) Priorities are fixed; that is, they cannot be adjusted when a new process starts running. D) It assigns priorities statically according to deadline. 6. A deadlocked state occurs whenever A) a process is waiting for I/O to a device that does not exist

Explanation / Answer

1)
D
Throughput

2)
C
convoy effect

3)
C
Large

4)
A
1/p

5)
A
When a process becomes runnable, it must announce its deadline requirements to the system.

6)
very process in a set is waiting for an event that can only be caused by another process in the set

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.