C191 Module 2 Study Guide Questions And Correct Answers

Mutex Locks {Ans: also known as a spinlock first acquire() a lock then release() the lock ● Boolean variable indicating if lock is available or not. Solution requires busy watiing}What does a stack contain? {Ans: Temporary data such as function parameters, return addresses, and local variables.}What are advantages of thread pools? {Ans: Usually slightly faster to service a request with an existing thread than create a new thread Allows the number of threads in the application(s) to be bound to the size of the pool}Long-term scheduler (or job scheduler) {Ans: Selects which processes should be brought into memory for execution from mass storage device.}What are the two general approaches to canceling threads? {Ans: Asynchronous Cancellation and Deferred Cancellation}What are the nonpreemtive algorithms {Ans: FCFS (FIFO), SJF and priority}