Operating Systems Q6

1- Which of the following scheduling algorithms never leads to complete starvation for a process and is preemptive. Select one: a. FCFS b. SJF c. Round-robin 2- Process scheduling decisions can occur after 4 events: 1.)A process switches from a running state to a waiting state (wait() or an i/o request) 2.)A process terminates 3.)A process switches from a waiting state to ready state (i/o is complete, etc.) 4.)A process switches from running to ready due to an interrupt request In a cooperative multitasking scheme only 2 of these will occur... which 2? Select one: a. 1, 4 b. 3, 4 c. 1, 2 d. 2, 4 3- Which of the following is NOT typically used as a criteria for scheduling processes? Select one: a. Throughput b. Response time c. CPU utilization d. Memory usage e. Turnaround time 4- Windows has priority classes for processes, and relative priorities for threads... we can ascertain the priority of the thread using a 2-d lookup table. As such, say that we have a process with ABOVE_NORMAL_PRIORITY_CLASS and a thread with HIGHEST relative priority. What is the thread priority? 5- Asymmetric multiprocessing is a multi-processor strategy whereby the operating system and processes share all the processors in the system equally. Select one: True False 6- A process begins with a cpu burst and is followed by an i/o burst... these two bursts keep alternating until the process has a final cpu burst that ends with the system terminating the process. Select one: True False 7- FCFS is the first-come-first-served scheduling algorithm. It is a preemptive algorithm where the first process to arrive is scheduled first. Select one: True False 8- A multilevel feedback queue allows for processes to move up and down between scheduling queues, and different queues have differing priorities. If a process uses too much CPU time, it is then moved to a higher-priority queue. Select one: True False 9- SJF is the shortest-job-first algorithm. It is provably optimal, and gives the shortest average wait time. When it is implemented in a preemptive manner, a flood of new processes that require a small amount of CPU time could lead to starvation for processes which require a fair/large amount of CPU time. Select one: True False 10- Kernel level threads use system-contention scope and use the scope value PTHREAD_SCOPE_SYSTEM, whereas user-level threads use process-contention scope and use the scope value PTHREAD_SCOPE_PROCESS. Select one: True False