OS Part 1

1

In the blocking send, blocking receive

1

The table _____ contains the base address of each page in physical memory

1

A state is safe, if:

1

In fixed sized partition, the degree of multiprogramming is bounded by ____

1

_ is generally faster than _

1

The two atomic operations permissible on semaphores are: (several answer)

1

Program:

1

"Mutual exclusion" condition for deadlock is defined as:

1

"Hold and wait" condition for a deadlock is defined as:

1

A monitor is a type of:

1

What is NOT the example of consumable resources?

1

Which one is a synchronization tool?

1

A Process Control Block (PCB) does not contain which of the following?

1

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.

1

Memory:

1

This resource can be safely used by only one process at a time and is not depleted by that use:

1

Which of the following condition is required for the deadlock to be possible?

1

The _____ is used as an index into the page table

1

A page fault:

1

A state of a process is defined by:

1

Suppose that a process is in “Blocked” state waiting for some I\O service. When a service is completed, it goes to the:

1

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

1

Message passing system allows processes to:

1

Which of the following statements is false?

1

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

1

Remote Procedure Calls (RPC) are used:

1

A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem?

1

This resource can be created and destroyed

1

Fixed-length block of data in secondary memory is called:

1

A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executing, is known as?

1

Every address generated by the CPU is divided into two parts:

1

Segmentation suffers from external fragmentation?

1

For each process OS creates and manages:

1

What is a trap/exception?

1

What is the reusable resource:

1

Interprocess communication:

1

Which of the following transitions is not possible?

1

Any program, no matter how small, will occupy an entire partition results in:

1

This matrix defines requirements of processes i for the resources j

1

Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called a(n) _____

1

The context of a process in the PCB of a process DOES NOT contain:

1

External fragmentation will not occur when:

1

A deadlock avoidance algorithm dynamically examines the _____, to ensure that a circular wait condition can never exist

1

The process control block is:

1

This illustrates the progress of two processes competing for two resources:

1

In a multiprogramming environment:

1

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

1

Main memory is broken into fixed-sized blocks called _____

1

The first fit, best fit and worst fit are strategies to select a

1

The Banker’s algorithm is referred to as

1

The code that changes the value of the semaphore is:

1

The two kinds of semaphores are: (Several answers)

1

"Circular wait" condition for deadlock is defined as:

1

Banker’s algorithm for resource allocation deals with:

1

What is compaction?

1

Process is:

1

A single thread of control allows the process to perform:

1

When the memory allocated to a process is slightly larger than a process, then:

1

A problem encountered in multitasking when a process is perpetually denied necessary resources is called:

1

The memory allocation scheme subject to "internal fragmentation" is:

1

Which one is deadlock avoidance algorithm?

1

What is a method of memory allocation by which the program is subdivided into equal portions, or pages and core is subdivided into equal portions or blocks?

1

Variable-length block of data that resides in secondary memory is called:

1

The memory allocation scheme subject to "external fragmentation" is:

1

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

1

A binary semaphore is semaphore with integer values: (Several answers)

1

Program always deals with:

1

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

1

Swapping:

1

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

1

If a page table entry is present in the TLB, then it is known as a:

1

With paging there is no _____ fragmentation

1

The address of a page table in memory is pointed by:

1

What is a medium-term scheduler?

1

"No preemption" condition for a deadlock is defined as:

1

Processor:

1

Fixed-length block of main memory is called _____

1

The initial value of the semaphore that allows only one of the many processes to enter their critical section, is?

1

Mutual exclusion means that:

1

For every process there is a _____.

1

In operating system, each process has its own

1

Listing the sequence of instructions that are executed is called:

1

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

1

Deadlock inevitable region can be referred as:

1

How to solve a problem of equal-size partitions?

1

Paging?

1

In internal fragmentation, memory is internal to a partition and:

1

A set of processes is deadlock if:

1

A memory used to provide a high speed is called?

1

In indirect communication between processes P and Q:

1

Semaphore is a/an _____ to solve the critical section problem?

1

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

1

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

1

Which of the following is not true about the memory management?

1

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

1

In the non-blocking send, blocking receive:

1

The objective of multi-programming is to:

1

A system is in the safe state if:

1

When memory is divided into a several fixed sized partitions, each partition may contain _____

1

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

1

A process can be terminated due to:

1

What is a short-term scheduler?

1

In contiguous memory allocation:

1

External fragmentation exists when:

1

CPU fetches the instruction from memory according to the value of?

1

A sequence of instructions, in a computer language, to get the desired result, is known as:

1

Semaphores:

1

This matrix defines the current allocation to process i of the resource j

1

The operating system maintains a _____ table that keeps track of how many frames have been allocated, how many are there, and how many are available

1

For non-sharable resources like a printer, mutual exclusion:

1

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

1

Interprocess communication:

1

The available vector defines:

1

A task in a blocked state

1

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

1

What is NOT an example of reusable resource

1

An un-interruptible unit is known as:

1

How to solve a problem of "external" fragmentation?

1

Runtime mapping from virtual to physical address is done by?

1

A solution to the problem of external fragmentation is:

1

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

1

In segmentation, each address is specified by:

1

Virtual memory takes advantage of:

1

Which of the replacement algorithms selects for the next reference is the longest?

Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Quiz on OS Part 1, created by Good Guy Beket on 12/18/2017.

OS Part 1

In the blocking send, blocking receive

The table _____ contains the base address of each page in physical memory

A state is safe, if:

In fixed sized partition, the degree of multiprogramming is bounded by ____

_____ is generally faster than _____

The two atomic operations permissible on semaphores are: (several answer)

Program:

"Mutual exclusion" condition for deadlock is defined as:

"Hold and wait" condition for a deadlock is defined as:

A monitor is a type of:

What is NOT the example of consumable resources?

Which one is a synchronization tool?

A Process Control Block (PCB) does not contain which of the following?

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.

Memory:

This resource can be safely used by only one process at a time and is not depleted by that use:

Which of the following condition is required for the deadlock to be possible?

The _____ is used as an index into the page table

A page fault:

_ is generally faster than _

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.