.jpg)
Q1/sol//
1. (C) Decreased operating system overhead
2 (C) Dispatcher
3. (B) Interrupt
4. (A) many-to-one !!!
5. (B) Wait queue
6. (A) 1948
7. (D) Throughput
8. (B) Each queue has its own scheduling algorithm.
9. (C) has the identical structure as the process control block
10. (D) is dispatched by the scheduler
11. (D) it minimizes the average response time !!!!
12.(D) all of the mentioned
13. (B) starvation
14. (A) 2 instances !!!
15. (B) application programming interface
Q2/sol//
A/
.jpg)
B/
Q3 /sol//
A/
B/
Q .4)
.
A.)
A process starts in the "New" state, and the first transition it does is to the "Ready" state.
B). Threads within a process have their own program counter, stack, register set, and local storage.
C). Mutual exclusion is a synchronization mechanism that ensures only one thread or process can access a shared resource at a time. It is used to prevent race conditions and other concurrent access-related issues.
.
D). The four conditions required for deadlock are mutual exclusion, hold and wait, no preemption, and circular wait
.
E). The five popular criteria used in CPU scheduling algorithms are: CPU utilization, throughput, turnaround time, waiting time, and response time.
Q5/sol//
A/
B/
1- False !!!!
2- False
3- True !!!!
4- True