An OS uses a PCB to represent a process.

T

True

F

False

Question $2$

The PCB is created by the process when execution starts.

T

True

F

False

Question $3$

The PCB becomes part of the program being executed by a process.

T

True

F

False

Question $4$

Two processes can be executing the same program.

T

True

F

False

Question $5$

The transition $($ready $->$ running$)$ of a process p is caused by $\_\_\_\_\_.$

the OS

the process p itself

some other process

Question $6$

The transition $($running $->$ blocked$)$ of a process p is caused by $\_\_\_\_\_.$

some other process

the OS

the process p itself

Question $7$

The transition $($running $->$ ready$)$ of a process p is caused by $\_\_\_\_\_.$

some other process

the process p itself

the OS

Question $8$

When a process p is moved from the current state $($running$,$ ready, or blocked$)$ to the suspended state, then upon reactivation, $\_\_\_\_\_\_\_\_.$

p is moved to either the ready or the blocked state

p can always safely be moved to the ready state

p must be moved back to the same state where the suspension occurred

Question $9$

The PCB contains an up$-$to$-$date copy of the CPU state of a process p $\_\_\_\_\_.$

s p$.$

when p$\text{'}$s state is ready or blocked

when p$\text{'}$s state is running

at all times

Question $10$

The list$-$free implementation is $\_\_\_\_\_\_\_\_$ the linked$-$list implementation.

less time$-$efficient than

equally time$-$efficient as

more time$-$efficient than

Question $11$

Adding a new child process with the list$-$free implementation uses $\_\_\_\_\_$ the linked$-$list implementation.

less memory than

more memory than

the same amount of memory as

Question $12$

A process at level i in the process creation hierarchy can have $\_\_\_\_\_\_$ link$($s$)$ to processes at the next higher level i$-1.$

more than $2$

$2$

$1$

Question $13$

A newly created process $($still in the state new$)$ at level i can have $\_\_\_\_\_\_$ links to processes at level i$+1.$

$1$

more than $1$

$0$

Question $14$

The initial CPU state of a newly created process is NULL or undefined.

T

True

F

False

Question $15$

The initial value of the process$\_$state field could be set to blocked if memory or some other critical resource is unavailable.

T

True

F

False

Question $16$

To close files should be the responsibility of the programmer, rather than being performed automatically as part of the destroy function

T

True

F

False

Question $17$

A waiting list can be implemented as a linked list where each element points to a PCB$.$

T

True

F

False

Question $18$

With a single$-$unit resource, the state is just a Boolean in RCB$.$

T

True

F

False

Question $19$

A process can be blocked on more than one resource.

T

True

F

False

Question $20$

A request can be initiated by any process, regardless of the process's current state.

T

True

F

False

Question $21$

The release function always reactivates $\_\_\_\_\_\_\_\_.$

zero or one process

exactly one waiting process

zero or more processes

Question $22$

Assume the release function is modified to handle resources with multiple identical units. Each call to release could reactivate $\_\_\_\_\_\_\_\_.$

zero or one process

zero or more processes

Question $23$

If RL is implemented as a single list without priority levels and every new process is entered at the tail of RL then the Create functions do not need to call the scheduler:

T

True

F

False

Question $24$

What is the minimum number of bits needed to represent the process$\_$state field, if $6$ states are supported: running, ready, blocked, new, suspended, and terminated?

$3$

$2$

$1$

Question $25$

The set of all PCBs could be implemented as a $\_\_\_\_\_\_\_\_$

$.$

$1-$dimensional array of structures, where the array dimension is the number of available PCB slots.

linked list of $1-$dimensional integer arrays, where each list element is a PCB$.$

$2-$dimensional integer array, where the first dimension is the number of available PCB slots