2. True or False (10, 1 per blank) 1) The CPU can access the disk directly. ( ) 2) Both SJF and priority scheduling algorithms may lead to starvation problem. 3) The operation system can use the process as a basic unit to allocate resources. ( ) 4) When the I/O task of a process finishes, the process will switch from waiting state to the running state. () 5) Using process synchronization can solve the deadlock problem. ( ) 6) The resource allocation graph can be used to judge whether the critical section problem happens or not. () 7) Round Robin scheduling algorithm is commonly used in the time-sharing system. ( ) 8) Every process has two process control blocks, one for user mode and the other for kernel mode. () 9) The batch system usually has long-term scheduling. 10) In a multithreaded process, code, data, and files are shared across it threads. 1).

1. 2. True or False (10, 1 per blank) 1) The CPU can access the disk directly. ( ) 2) Both SJF and
priority scheduling algorithms may lead to starvation problem. 3) The operation system can use
the process as a basic unit to allocate resources. ( ) 4) When the I/O task of a process finishes,
the process will switch from waiting state to the running state. () 5) Using process synchronization
can solve the deadlock problem. ( ) 6) The resource allocation graph can be used to judge
whether the critical section problem happens or not. () 7) Round Robin scheduling algorithm is
commonly used in the time-sharing system. ( ) 8) Every process has two process control blocks,
one for user mode and the other for kernel mode. () 9) The batch system usually has long-term
scheduling. 10) In a multithreaded process, code, data, and files are shared across it threads. 1)