OS | Quizzes #3 and #4

1

Utilities are:

1

The process index register

1

The end user views a computer system in terms of:

1

Choose the storage management responsibility for «The OS can achieve efficiency by assigning memory to jobs only as needed:

1

"The OS as a User/Computer Interface" corresponds to the following objective:

1

_ is generally faster than _

1

Memory partitioning algorithm that uses binary tree as a data structure is called:

1

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

1

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

1

Main memory is broken into fixed-size blocks called

1

In operating system each process has its own:

1

Mutual exclusion can be provided by the:

1

What is a medium-term scheduler?

1

The state of a process is defined by:

1

What is a ready state of a process?

1

Which one of the following is the deadlock avoidance algorithm?

1

A state is safe if:

1

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

1

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

1

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

1

A system is in the safe state if:

1

What is the reusable resource?

1

This illustrates the progress of two processes competing for two resources

1

Current allocation of resources to processes where there is at least one sequence that does not result in deadlock is called

1

The resource vector defines:

1

"No preemption" condition for deadlock is defined as

1

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

1

Which of the following cannot be interrupted?

1

A minimum of ____ variables is/are required to be shared between processes to solve critical section problem.

1

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

1

A monitor is type of:

1

An un-interruptible unit is known as:

1

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

1

Current allocation of resources to processes where there is no sequence that does not result in deadlock is called:

1

Which of the following is not one of the principles of dealing with deadlock?

1

Deadlock inevitable region can be referred to as a:

1

When each process in the set is blocked awaiting for resource seized by another blocked process:

1

What is NOT an example of reusable resource?

1

In the non-blocking send, blocking receive:

1

The degree of multi-programming is:

1

What controls the process in a single-threaded process model?

1

The context of a process in the PCB of a process DOESN'T contain:

1

Job control language was used to:

1

The hardware and software used in providing applications to a user can be viewed in a:

1

Semaphore is a/an _____ to solve critical section problem.

1

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

1

«The OS as a resource manager» corresponds to the following objective:

1

Choose the storage management responsibility for «Programmers should be able to define program modules and to create, destroy and after the size of modules dynamically»:

1

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

1

For every process there is a:

1

The memory allocation scheme subject to "internal" fragmentation is

1

In memory systems, boundary registers

1

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

1

The Process Control Block is:

1

Which one of the following is synchronization tool?

1

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

1

This system handles multiple interactive jobs:

1

"Two or more programs hung up waiting for each other". This error is caused by

1

"Lost signals, duplicate signals received". This error is caused by:

1

The principal tool available to system programmers in developing the early multiprogramming and multiuser interactive systems

1

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

1

When the free memory is split into many unconnected pieces we call it:

1

If a page number is not found in the TLB, then it is known as a:

1

With paging there is no ______ fragmentation.

1

If a page table entry is not in a main memory, then it is known as a:

1

This matrix defines the amount of resources of type j requested by process i:

1

«Hold and wait» condition for deadlock is defined as:

1

«Circular wait» condition for deadlock is defined as:

1

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

1

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

1

The available vector defines:

1

"No preemption" condition for deadlock is defined as:

1

For sharable resources, mutual exclusion

1

In the blocking send, blocking receive:

1

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

1

"More than one attempts to make use of a shared resource at the same time". This error is caused by:

1

Which of the following state transitions is not possible?

1

What is a short-term scheduler?

1

What is a long-term scheduler?

1

What is inter-process communication?

1

There were no OS with

1

Inter-process communication

1

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

1

In contiguous memory allocation

1

A system clock generates an interrupts at a rate of approximately every 0.2 seconds. At each clock interrupt regained control and could assign processor to another user. Technique is known as:

1

In internal fragmentation, memory is internal to a partition and

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

The algorithm is slow and may even tend to fill up memory with useless holes

1

24. Which of the following statements is false?

1

Short-term scheduler, or dispatcher, picks a process. Each process in the queue is given some time in turn. The strategy is called

1

The limit register:

1

Dispatcher is:

1

Process spawning is:

1

The code that changes the value of the semaphore is:

1

This resource can be created and destroyed

1

What is NOT an example of consumable resource?

1

A binary semaphore is a semaphore with integer values (multiple choices):

1

If more than one user or program attempts to make use of a shared resource at the same time, it may cause the error of

1

Mutual exclusion means that

1

The two kinds of semaphores are:

1

The objective of multi-programming is to:

1

A relationship between processes such that each has some part (critical section) which must not be executed while the critical section or another

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? It is a method of allocating processor time?

Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Quiz am OS | Quizzes #3 and #4, erstellt von Good Guy Beket am 28/03/2019.

OS | Quizzes #3 and #4

OS | Quizzes #3 and #4

Utilities are:

The process index register

The end user views a computer system in terms of:

Choose the storage management responsibility for «The OS can achieve efficiency by assigning memory to jobs only as needed:

"The OS as a User/Computer Interface" corresponds to the following objective:

_____ is generally faster than _____

Memory partitioning algorithm that uses binary tree as a data structure is called:

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

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

Main memory is broken into fixed-size blocks called

In operating system each process has its own:

Mutual exclusion can be provided by the:

What is a medium-term scheduler?

The state of a process is defined by:

What is a ready state of a process?

Which one of the following is the deadlock avoidance algorithm?

A state is safe if:

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

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

_ is generally faster than _