Jobs By Abekus

Operating-systems Questions Set 13:

Quiz Mode

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

I only

I and III only

II and III only

I, II and III

Solution:

A process executes the following code:

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

The total number of child processes created is

2^n - 1

2^n

2^(n+1) - 1

Solution:

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

None of the above

Shortest job scheduling

Priority scheduling

First-come, first-serve scheduling

Solution:

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

learning power

persistence of vision

memory mapped unit

None of the mentioned

Solution:

Which of the following are different states in a process?

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

ii, iii, iv, vi & vii

i, iii, iv, v & vii

ii, iii, v, vi & vii

i, ii, iii, iv & v

Solution:

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

Either S1 or S2

Either S2 or S3

Only S2 and S3

All of S1, S2 and S3

Solution:

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

Solution:

In the context of operating systems, which of the following statements is/are correct with respect to paging?
Paging helps solve the issue of external fragmentation
Page size has no impact on internal fragmentation
Paging incurs memory overheads
Multi-level paging is necessary to support pages of different sizes

1, 3

2, 4

1, 2

3, 4

Solution:

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

In deadlock prevention, the request for resources is always granted if the resulting state is safe

In deadlock avoidance, the request for resources is always granted if the result state is safe

Deadlock avoidance is less restrictive than deadlock prevention

Deadlock avoidance requires knowledge of resource requirements a priority

Solution:

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

First Come First Serve

Non-preemptive Shortest Job First

Shortest Remaining Time

Round Robin with Quantum value two

Operating-systems Questions Set 13:

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

Solution:

A process executes the following code:

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

The total number of child processes created is

Solution:

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

Solution:

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

Solution:

Which of the following are different states in a process?

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

Solution:

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

Solution:

Solution:

Solution:

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

Solution:

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

Solution:

Related Question Sets:

Related Topics:

Operating-systems Questions Set 13:

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

Solution:

A process executes the following code: for (i = 0; i < n; i++) { fork(); } The total number of child processes created is

Solution:

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

Solution:

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

Solution:

Which of the following are different states in a process? i. START ii. NEW iii. RUNNING iv. READY v. BLOCKED vi. TERMINATED vii. WAITING

Solution:

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

Solution:

Solution:

Solution:

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

Solution:

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

Solution:

Related Question Sets:

Related Topics:

A process executes the following code:

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

The total number of child processes created is

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

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