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

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

Consider six memory partitions of size 200 KB, 400 KB, 600 KB, 500 KB, 300 KB, and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210 KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?

A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside buffer (TLB) which can hold a total of 128 page table entries and is 4-way set associative. The minimum size of the TLB tag is:

Which one of the following is not shared by threads?

Consider the following policies for preventing deadlock in a system with mutually exclusive resources.

I. Processes should acquire all their resources at the beginning of execution.  If any resource is not available, all resources acquired so far are released.

II. The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbers.

III. The resources are numbered uniquely, and processes are allowed to request  for resources only in decreasing resource numbers.

IV. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resources.

Which of the above policies can be used for preventing deadlock?

A state is safe, if :

A system is in a safe state only if there exists a :

All unsafe states are :

A system has 12 magnetic tape drives and 3 processes: P0, P1, and P2. Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives.

Process   

P0           

P1                            

P2                            

Maximum needs (process-wise : P0 through P2 top to bottom)   

10            

4  

9

Currently allocated (process-wise)

5

2

2

Which of the following sequence is a safe sequence?

A process is selected from the ______ queue by the ________ scheduler, to be executed.

The processes that are residing in main memory and are ready and waiting to execute are kept on a list called

Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths

submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?

Which module gives control of the CPU to the process selected by the short-term scheduler?

Which of the following is FALSE about Shortest Job First Scheduling?

S1: It causes minimum average waiting time

S2: It can cause starvation

Which of the following process scheduling algorithm may lead to starvation

When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called

A starvation free job scheduling policy guarantees that no job indefinitely waits for a service. Which of the following job scheduling policies is starvation free?

Semaphores are used to solve the problem of

I. Race Condition

II. Process Synchronization

III. Mutual Exclusion

IV. None of the above

A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?