Which of the following statements about CPU scheduling algorithms are true?

A process executes the following code:

for (i = 0; i < n; i++)
{
    fork();
}

The total number of child processes created is

Which CPU scheduling algorithm allocates the CPU to the process that requests the CPU first?

The characteristic of the eye to retain the image for a short time after it has been presented is known as _____.

Which of the following are different states in a process?

i. START ii. NEW iii. RUNNING iv. READY v. BLOCKED vi. TERMINATED vii. WAITING

For computers based on three-address instruction formats, each address field can be used to specify which of the following:

S1: A memory operand S2: A processor register S3: An implied accumulator register

Consider a computer system with ten physical page frames. The system is provided with an access sequence a1, a2, ..., a20, a1, a2, ..., a20), where each ai number. The difference in the number of page faults between the last-in-first-out page replacement policy and the optimal page replacement policy is

In the context of operating systems, which of the following statements is/are correct with respect to paging?

1. Paging helps solve the issue of external fragmentation
2. Page size has no impact on internal fragmentation
3. Paging incurs memory overheads
4. Multi-level paging is necessary to support pages of different sizes

Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?

For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?

Process Arrival Time Processing Time A 0 3 B 1 6 C 4 4 D 6 2