Question # 1 [3 Marks] (Indicate whether the following statements are true or false. Justify your selection by providing a brief explanation. Each question contains 0.5 marks)

1. Uniprogramming typically provides better utilization of system resources than multiprogramming. (T/F).
2. A fetched instruction is normally loaded into the Instruction Register (IR). (T/F)
3. If a kernel is single-threaded, system calls from any thread can block the entire task .(T/F)
4. Solid state drives are less reliable than conventional Magnetic hard drives. (T/F)

5. The less-privileged processor execution mode is often referred to as kernel mode. (T/F)

6. The Dining Philosophers Problem illustrates basic problems in deadlock and starvation. (T/F)

Question # 2 [12 Marks] (For the following short questions, provide a 3-4 line answer. The answer should be based on your analysis and critical thinking. Each question contains 1.5 marks)

1. Describe the importance of data structure used by operating system to process management.
2. Discuss the situation in which there is no space for new process in memory and what kind of action should take by operating system to overcome this situation?
3. If there is no process synchronization among processes, what kind of problem could occur? Explain in detail
4. Why must the operating system be more careful when accessing input to a system call (or producing the result) when the data is in memory instead of registers?.
5. In which condition multithreading does not provide better performance than a single-threaded solution.
6. Assuming the operating system detects the system is deadlocked, what can the operating system do to recover from deadlock?
7. Why we have multiple partitioning techniques in operating system?
8. Is there any possibility of deadlock in the execution of single process? Justify your answers.

Question # 3 [5 Marks]

Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use non-preemptive scheduling, and base all decisions on the information you have at the time the decision must be made.

Process	Arrival Time	Burst Time
P1	0.0	9
P2	0.4	6
P3	0.6	4
P4	1.0	2

1. What is the average turnaround time for these processes with the FCFS scheduling algorithm?
2. What is the average turnaround time for these processes with the SJF scheduling algorithm?
3. The SJF algorithm is supposed to improve performance, but notice that we chose to run process P1 at time 0 because we did not know that three shorter processes would arrive soon. Compute what the average turnaround time will be if the CPU is left idle for the first 1 unit and then SJF scheduling is used. Remember that processes P1, P2, P3 are waiting during this idle time, so their waiting time may increase.