Jobs By Abekus

Operating-systems Questions Set 10:

Quiz Mode

Which of the following is NOT shared by the threads of the same process?

Stack

Address Space

File Descriptor Table

Message Queue

Solution:

Preemptive, priority-based scheduling guarantees ____________

protection of memory

None of the mentioned

soft real-time functionality

hard real-time functionality

Solution:

In the priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of the running process.

All processes

Running process

Last process

None

Solution:

When does file system fragmentation occur?

When used space is not contiguous

When unused space or single files are not contiguous

When multiple files are non-contiguous

When unused space is non-contiguous

Solution:

What is an interrupt vector?

It is a unique identity given to an interrupt

It is an address that is indexed to an interrupt handler

It is a unique device number that is indexed by an address

None of the mentioned

Solution:

What is the ready state of a process?

none of the mentioned

when the process is unable to run until some task has been completed

when the process is scheduled to run after some execution

when the process is using the CPU

Solution:

The time taken to switch between user and kernel modes of execution is t1, while the time taken to switch between two processes is t2. Which of the following is TRUE?

t1 > t2

t1 = t2

t1 < t2

nothing can be said about the relation between t1 and t2

Solution:

Which operations are performed by an interrupt handler?

Saving the current state of the system

Loading the interrupt handling code and executing it

Once done handling, bringing back the system to the original state it was before the interrupt occurred

All of the mentioned

Solution:

Consider a typical disk that rotates at 15000 rotations per minute (RPM) and has a transfer rate of 50 × 10⁶ bytes/sec. If the average seek time of the disk is twice the average rotational delay and the controller’s transfer time is 10 times the disk transfer time, the average time (in milliseconds) to read or write a 512 byte sector of the disk is

6.1

6.2

6.3

Solution:

A multithreaded program P executes with x number of threads and uses y number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock l, then it cannot re-acquire lock l without releasing it. If a thread is unable to acquire a lock, it blocks until the lock becomes available. The minimum value of x and the minimum value of y together for which execution of P can result in a deadlock are:

x = 1, y = 2

x = 2, y = 1

x = 2, y = 2

x = 1, y = 1

Operating-systems Questions Set 10:

Which of the following is NOT shared by the threads of the same process?

Solution:

Preemptive, priority-based scheduling guarantees ____________

Solution:

In the priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of the running process.

Solution:

When does file system fragmentation occur?

Solution:

What is an interrupt vector?

Solution:

What is the ready state of a process?

Solution:

The time taken to switch between user and kernel modes of execution is t1, while the time taken to switch between two processes is t2. Which of the following is TRUE?

Solution:

Which operations are performed by an interrupt handler?

Solution:

Solution:

Solution:

Related Question Sets:

Related Topics: