Operating System

1

Which of the following page replacement algorithm use the technique of replace that page which is not used in the near future?

1

A common programming construct for implementing mutual exclusion which uses condition variables is called

1

DMA stands for

1

Which of the following is in correct order of size, smallest first?

1

Which of the following is NOT a necessary condition for deadlock to occur?

1

The time required to move the disk head to the desired track is known as

1

A distributed system is a collection of processors that do not share_______.

1

The process of converting logical address into physical address is known as

1

In a segmentation scheme the logical memory will be divided into

1

Which of the technique is used to recover the process from starvation situation?

1

In Unix, dev/null

1

Redirection in pipes can be achieved by using

1

The PID of the kernel process is

1

Which of the following statements best explains a process?

1

An incremental backup

1

In real-time operating systems, which of the following is the most suitable scheduling scheme?

1

If there are 32 segments, each of size 1 K byte, then the logical address should have

1

Which of the following refers to the associative memory?

1

Mutual exclusion problem occurs between

1

Kernel is

1

Which of the following page replacement algorithms suffers from Belady`s anomaly?

1

Locality of reference implies that the page reference being made by a process

1

The time of admission of job to ready queue to completion is_______

1

which of the following is the command for the searching a pattern in a file

1

When fork() is given

Computer Science Quiz on Operating System, created by Sami Khan on 29/05/2020.

Operating System

Which of the following page replacement algorithm use the technique of replace that page which is not used in the near future?

A common programming construct for implementing mutual exclusion which uses condition variables is called

DMA stands for

Which of the following is in correct order of size, smallest first?

Which of the following is NOT a necessary condition for deadlock to occur?

The time required to move the disk head to the desired track is known as

A distributed system is a collection of processors that do not share_______.

The process of converting logical address into physical address is known as

In a segmentation scheme the logical memory will be divided into

Which of the technique is used to recover the process from starvation situation?

In Unix, dev/null

Redirection in pipes can be achieved by using

The PID of the kernel process is

Which of the following statements best explains a process?

An incremental backup

In real-time operating systems, which of the following is the most suitable scheduling scheme?

If there are 32 segments, each of size 1 K byte, then the logical address should have

Which of the following refers to the associative memory?

Mutual exclusion problem occurs between

Kernel is