Module 2 Mastery Exercise-3

.pdf

School

Colorado State University, Global Campus *

*We aren’t endorsed by this school

Course

300

Subject

Computer Science

Date

Dec 6, 2023

Type

pdf

Pages

7

Uploaded by AdmiralGiraffe1510

Report
11/29/23, 2:37 PM Module 2: Mastery Exercise: 23FD-CSC300-2 https://csuglobal.instructure.com/courses/83572/quizzes/747286 1/7 Module 2: Mastery Exercise Due No due date Points 10 Questions 10 Time Limit None Allowed Attempts Unlimited Instructions Attempt History Attempt Time Score KEPT Attempt 3 3 minutes 9 out of 10 LATEST Attempt 3 3 minutes 9 out of 10 Attempt 2 6 minutes 8 out of 10 Attempt 1 63 minutes 8 out of 10 Correct answers are hidden. Score for this attempt: 9 out of 10 Submitted Nov 29 at 1:28pm This attempt took 3 minutes. Complete the Mastery Exercises to assess your knowledge of the content covered in this module. You may repeat this quiz as many times as you need. The highest score will count toward your overall grade. Take the Quiz Again 1 / 1 pts Question 1 If no ready thread is found, the dispatcher will execute a special thread called the _______. real-time
11/29/23, 2:37 PM Module 2: Mastery Exercise: 23FD-CSC300-2 https://csuglobal.instructure.com/courses/83572/quizzes/747286 2/7 idle thread error code UMS That is correct. The ideal thread is a special thread that runs on the CPU when no other thread is ready to run. 1 / 1 pts Question 2 The _________ class represents tasks that require a longer time to complete, but that do not demand immediate results. default signal handler utility drive allocation scheduling Correct. In the Grand Central Dispatch Apple OS scheduler, the scheduling class representing tasks that require a longer time to complete, but that do not demand immediate results, is called the utility class. 1 / 1 pts Question 3
11/29/23, 2:37 PM Module 2: Mastery Exercise: 23FD-CSC300-2 https://csuglobal.instructure.com/courses/83572/quizzes/747286 3/7 ___________ scheduling assigns priorities dynamically according to deadline. deadline evaluation earliest-deadline-first (EDF) scheduling-real-classes (SRC) Correct. Earliest-deadline-first (EDF) is a real-time scheduling algorithm in which the scheduler dynamically assigns priorities according to completion deadlines. 1 / 1 pts Question 4 The selection process is carried out by the ______. CPU scheduler RAM scheduling drive allocation scheduling Correct. Kernel routine that selects a thread from the threads that are ready to execute and allocates a core to that thread is called the CPU scheduler.
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help