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

Preemptive, priority-based scheduling guarantees ____________

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

When does file system fragmentation occur?

What is an interrupt vector?

What is the ready state of a process?

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?

Which operations are performed by an interrupt handler?

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

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: