For 3 page frames, the following is the reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1. How many page faults does the Optimal page replacement algorithm produce (including page faults when the frames were free)?

For 3 page frames, the following is the reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1. How many page faults does the FIFO page replacement algorithm produce (including page faults when the frames were free)?

What is not a main structural element of a computer system?

Which of the following element of a computer system stores data and programs?

Which of the following provides for communication among elements of a computer system?

Which of the following element of a computer system moves data between the computer and its external environment?

The processor contains a single data register, called

This register specifies a particular input/output device

This register is used for the exchange of data between an I/O module and the processor

This register contains the data to be written into memory or which receives the data read from memory

This register specifies the location in memory for the next read or write

Which register contains the address of the next instruction to be fetched?

Which register contains the instruction most recently fetched?

Index register, segment register, and stack register are examples of

Which of the following registers are used by the processor to exchange data with memory?

Which of the following registers are used by the processor to exchange data with Input/output module?

Which of the following element of a computer system controls the operation of the computer and performs its data processing functions?

For 4 page frames, the following is the reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6. How many page faults does the LRU page replacement algorithm produce (including page faults when the frames were free)?

For 4 page frames, the following is the reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6. How many page faults does the FIFO page replacement algorithm produce (including page faults when the frames were free)?

For 4 page frames, the following is the reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6. How many page faults does the Optimal page replacement algorithm produce (including page faults when the frames were free)?

The fetched instruction is loaded into

At the beginning of each instruction cycle, the processor fetches an instruction from the memory. The address of the instruction is held in

The processor is executing 'Load AC from memory' instruction. Choose the correct micro-instructions:

Process is

A task in a blocked state

The system which allows only one process execution at a time, are called

The system which allows only one process execution at a time, are called

Which of the following is not the state of a process?

Suppose that a process is in 'Blocked' state waiting for some I/O service. When the service is completed it goes to the:

Which of the following state transitions is not possible?

If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called

Process is

Interprocess communication:

A program

In operating system, each process has its own:

For each process OS creates and manages:

Listing the sequence of instructions that are executed is called?

A process can be terminated due to:

What is the ready state of a process?

What is interprocess communication?

A set of processes is deadlock if:

The address of the next instruction to be executed by the current process is provided by the:

A single thread of control allows the process to perform:

The objective of multi-programming is to:

What is a long-term scheduler?

What is a short-term scheduler?

The primary distinction between the short-term and long-term scheduler is:

In a multi-programming environment

Which of the following state transitions is not possible?

Which of the following is a synchronization tool?

Mutual exclusion can be provided by the:

When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called:

With … only one process can execute at a time; meanwhile all other process are waiting for the processor. With … more than one process can be running simultaneously each on a different processor

Interprocess communication:

Message passing system allows process to:

The link between two processes P and Q to send and receive messages is called:

In indirect communication between processes P and Q:

In the non-blocking send:

In the blocking send, blocking receive:

In the non-blocking send, blocking receive:

In the non-blocking send, non-blocking receive:

Remote Procedure Calls (RPC) are used:

What is a trap/exception

Semaphores:

Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and

Part of a program where the shared memory is accessed and which should be executed invisibly, is called:

Banker's algorithm for resource allocation deals with:

A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called:

The segment of code in which the process may change common variables, update tables, write into files is known as:

Mutual exclusion means that:

A minimum of … variables is/are required to be shared between processes to solve the critical section problem?

An un-interruptible unit is known as:

Semaphore is a/an … to solve the critical section problem:

The code that changes the value of the semaphore is:

The two kinds of semaphores are:

A binary semaphore is a semaphore with integer values:

A monitor is a type of:

What is the reusable resource:

A system is in the safe state if:

Which of the following is the deadlock avoidance algorithm?