Back to quiz

6. What does the First come, First Served algorithm do?

  • Gives each task a time slice, and if it is not completed by the end of it it is aded back onto the end of the queue
  • Organizes the queue according to sizesize and then executes accordingly
  • Executes tasks in the order of being added
  • Takes the first task and executes only that task

7. What is an example of a hardware interrupt?

  • Completion of data transfer between devices
  • The shutdown of the computer triggered by pressing the off switch
  • Arithemtic overflow
  • A keyboard blocking the monitor of the computer

8. What is a stack used for?

  • To contain memory locations of programs that have alrey been completed
  • To keep track of where the CPU was before an interrupt
  • To act as a barrier against harmful instructions
  • To hold pieces of useless data

9. What does the shortest job first algorithm do?

  • Organizes the queue according to size and then executes accordingly
  • Executes tasks in the order of being added
  • Executes whichever task has the shortest time left for executing, also allowing added processes to take over the currently running process
  • Places the shortest job at the front of the queue, then organizes the rest randomly

10. What are interrupts?

  • Signals from components of a computer that gets the attention of the CPU.
  • People who stop you from working on your computer.
  • Signals that prevent your CPU from working properly.
  • Signals that are sent from the CPU to other components.

11. What is scheduling?

  • A process that gives the illusion of a multitasking computer by arranging the way tasks are processed.
  • A process that controls when a user may load certain programs
  • A process that takes tasks from the computer and places them in the CPU for execution in order of loading
  • Trying to make sure you can do all your homework the night before

12. What does the Round Robin algorithm do?

  • Executes tasks in the order of being added
  • Gives each task a time slice, and if it is not completed by the end of it it is added back onto the end of the queue
  • Takes a robin and rounds it
  • Organizes the queue according to sizesize and then executes accordingly