scheduling algorithms

Question 1

first come first serve

Answer 1

processers are executed in the order they arrive

Question 2

shortest job first

Answer 2

picks the process that takes the shortest amount of time

Question 3

round robin

Answer 3

each process is giving a slice , fixed amount of time then moves on

Question 4

shortest time remaining

Answer 4

similar to shortest job first but , pre emptive so more important jobs can take over

Question 5

multi level feeback que

Answer 5

use of multiple cores for scheduling

Question 6

what is an interrupt

Answer 6

signal sent by the cpu to show another process is in need of processing time