Good Guy Beket
Quiz by , created more than 1 year ago

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

501
8
0
Good Guy Beket
Created by Good Guy Beket over 5 years ago
Close

OS | Quizzes #3 and #4

Question 1 of 103

1

Utilities are:

Select one of the following:

  • Processor registers

  • Application programs

  • Opcodes

  • System programs

Explanation

Question 2 of 103

1

The process index register

Select one of the following:

  • Contains the index into the process list of process currently controlling the processor.

  • Contains the staring address of the region of memory occupied by the process.

  • Define the region in memory occupied by the process

  • Points to the next isntruction in that process to be executed

Explanation

Question 3 of 103

1

The end user views a computer system in terms of:

Select one of the following:

  • A set of machine instructions

  • A set of applications

  • A set of system programs

  • Utilities

Explanation

Question 4 of 103

1

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

Select one of the following:

  • Process isolation

  • Protection and access control

  • Automatic allocation and management

  • Long-term storage

  • Support of modular programming

Explanation

Question 5 of 103

1

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

Select one of the following:

  • Efficiency

  • Convenience

  • Ability to evolve

Explanation

Question 6 of 103

1

_____ is generally faster than _____

Select one of the following:

  • first fit, best fit

  • none of the above

  • best fit, first fit

  • worst fit, best fit

Explanation

Question 7 of 103

1

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

Select one of the following:

  • First-fit algorithm

  • Buddy system

  • Next-fit algorithm

  • Best-fit algorithm

Explanation

Question 8 of 103

1

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

Select one of the following:

  • stack pointer

  • page table base register

  • program counter

  • page register

Explanation

Question 9 of 103

1

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

Select one of the following:

  • segmented memory can be paged

  • virtual memory is used only in multi-user systems

  • segmentation suffers from external fragmentation

  • paging suffers from internal fragmentation

Explanation

Question 10 of 103

1

Main memory is broken into fixed-size blocks called

Select one of the following:

  • None of the above

  • Segments

  • Frames

  • Pages

Explanation

Question 11 of 103

1

In operating system each process has its own:

Select one of the following:

  • address space and global variables

  • set of data

  • program code

  • all of mentioned

Explanation

Question 12 of 103

1

Mutual exclusion can be provided by the:

Select one of the following:

  • both

  • mutex locks

  • binary semaphores

  • none of the above

Explanation

Question 13 of 103

1

What is a medium-term scheduler?

Select one of the following:

  • It selects which process has to be executed next and allocates CPU

  • It selects which process has to be brought into the ready queue

  • It selects which process to remove from memory by swapping

  • None of the above

Explanation

Question 14 of 103

1

The state of a process is defined by:

Select one of the following:

  • The activity to next to be executed by the process

  • The activity just executed by the process

  • The current activity of the process

  • The final activity of the process

Explanation

Question 15 of 103

1

What is a ready state of a process?

Select one of the following:

  • when process is using the CPU

  • when process is scheduled to run after some execution

  • when process is unable to run unitl some task has been completed

  • none of the above

Explanation

Question 16 of 103

1

Which one of the following is the deadlock avoidance algorithm?

Select one of the following:

  • round-robin algorithm

  • elevator algorithm

  • banker's algorithm

  • dinning philosophers problem

Explanation

Question 17 of 103

1

A state is safe if:

Select one of the following:

  • the system can allocate resources to each process in some order and still avoid a deadlock

  • all of the above

  • the state keeps the system protected and safe

  • the system does not crash due to deadlock occurrence

Explanation

Question 18 of 103

1

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

Select one of the following:

  • 2

  • 1

  • 0

  • 10

Explanation

Question 19 of 103

1

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

Select one of the following:

  • critical section

  • mutual exclusion

  • non-critical section

  • program

Explanation

Question 20 of 103

1

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

Select one of the following:

  • starvation

  • aging

  • inversion

  • deadlock

Explanation

Question 21 of 103

1

A system is in the safe state if:

Select one of the following:

  • none of the above

  • there exist a safe sequence

  • both A and B

  • the system can allocate resources to each process in some order and still avoid a deadlock

Explanation

Question 22 of 103

1

What is the reusable resource?

Select one of the following:

  • that can be used by one process at a time and is not depleted by that use

  • that can be used by more than one process at a time

  • that can be shared between various threads

  • none of the above

Explanation

Question 23 of 103

1

This illustrates the progress of two processes competing for two resources

Select one of the following:

  • joint progress diagram

  • joint ingres diagram.

  • joint regress diagram.

  • joint process diagram.

Explanation

Question 24 of 103

1

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

Select one of the following:

  • Safe state

  • Ambiguous state

  • Unsafe state

  • Alternative state

Explanation

Question 25 of 103

1

The resource vector defines:

Select one of the following:

  • total amount of each resource in the system

  • total amount of each resource NOT allocated to any process

  • total amount of resources required for all processes

  • total amount of each resource allocated to all processes

Explanation

Question 26 of 103

1

"No preemption" condition for deadlock is defined as

Select one of the following:

  • No resource can be forcibly removed from process holding it.

  • Process holds a resources while awaiting for other resource

  • Only one process may use a resource at a time

  • Each process holds resource needed by next process in chain

Explanation

Question 27 of 103

1

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

Select one of the following:

  • Claim matrix

  • Allocation matrix

  • Resource matrix

  • Request matrix

Explanation

Question 28 of 103

1

Which of the following cannot be interrupted?

Select one of the following:

  • Process

  • Thread

  • Atomic operation

  • Module

Explanation

Question 29 of 103

1

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

Select one of the following:

  • three

  • two

  • one

  • four

Explanation

Question 30 of 103

1

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

Select one of the following:

  • must exist

  • may exist

  • must not exist

  • none of the above

Explanation

Question 31 of 103

1

A monitor is type of:

Select one of the following:

  • high-level synchronization construct

  • deadlock

  • low-level synchronization construct

  • none of the above

Explanation

Question 32 of 103

1

An un-interruptible unit is known as:

Select one of the following:

  • atomic.

  • single

  • static

  • none of the above

Explanation

Question 33 of 103

1

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

Select one of the following:

  • critical section

  • semaphores

  • directory

  • mutual exclusion

Explanation

Question 34 of 103

1

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

Select one of the following:

  • Safe state

  • Unsafe state

  • Alternative state

  • Ambiguous state

Explanation

Question 35 of 103

1

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

Select one of the following:

  • Initialization

  • Detection

  • Prevention

  • Avoidance

Explanation

Question 36 of 103

1

Deadlock inevitable region can be referred to as a:

Select one of the following:

  • fatal region

  • false region

  • final region

  • fun region

Explanation

Question 37 of 103

1

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

Select one of the following:

  • it is deadlock

  • it is deadend

  • it is a softlock

  • It is a mortallock

Explanation

Question 38 of 103

1

What is NOT an example of reusable resource?

Select one of the following:

  • I/O channels

  • Semaphores

  • Processors

  • Interrupt

Explanation

Question 39 of 103

1

In the non-blocking send, blocking receive:

Select one of the following:

  • the sending process sends the message and resumes operation

  • the sending process keeps sending until it receives a message

  • sender continues on, receiver is blocked until the requested message arrives

  • none of the above

Explanation

Question 40 of 103

1

The degree of multi-programming is:

Select one of the following:

  • the number of process in memory

  • the number of processes executed per unit time

  • the number of process in the ready queue

  • the number of process in the I/O queue

Explanation

Question 41 of 103

1

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

Select one of the following:

  • Process control block

  • Kernel stack control block

  • User address space control block

  • User stack control block

Explanation

Question 42 of 103

1

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

Select one of the following:

  • memory-management information

  • context switch time

  • the process state

  • the value of CPU registers

Explanation

Question 43 of 103

1

Job control language was used to:

Select one of the following:

  • provide instructions to the monitor to improve job setup time.

  • control the sequence of events as the resident monitor

  • translate the user's program into object code

  • execute instructions

Explanation

Question 44 of 103

1

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

Select one of the following:

  • sandwich fashion

  • classified fashion

  • layered fashion

  • leveled fashion

Explanation

Question 45 of 103

1

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

Select one of the following:

  • integer variable

  • special program for a system

  • complex structure

  • hardware for a system

Explanation

Question 46 of 103

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

Select one of the following:

  • data consistency

  • aging

  • race condition

  • starvation

Explanation

Question 47 of 103

1

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

Select one of the following:

  • Efficiency

  • Convenience

  • Ability to evolve

Explanation

Question 48 of 103

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»:

Select one of the following:

  • long-term storage

  • automatic allocation and management

  • support of modular programming

  • process isolation

Explanation

Question 49 of 103

1

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

Select one of the following:

  • free hole from a set of available holes.

  • processor to run the next process

  • process from a queue to put in memory

  • all of the above

Explanation

Question 50 of 103

1

For every process there is a:

Select one of the following:

  • page table.

  • copy of page table

  • frame table

  • pointer to page table

Explanation

Question 51 of 103

1

The memory allocation scheme subject to "internal" fragmentation is

Select one of the following:

  • fixed partitioning.

  • virtual memory segmentation

  • pure demand paging

  • segmentation

Explanation

Question 52 of 103

1

In memory systems, boundary registers

Select one of the following:

  • are used for temporary program variable storage

  • are only necessary with fixed partitions

  • are only necessary with unequal-length partitions

  • track the beginning and ending of programs

Explanation

Question 53 of 103

1

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

Select one of the following:

  • paging

  • internal fragmentation

  • segmentation

  • external fragmentation

Explanation

Question 54 of 103

1

The Process Control Block is:

Select one of the following:

  • a secondary storage section

  • process type variable

  • data structure

  • a block in memory

Explanation

Question 55 of 103

1

Which one of the following is synchronization tool?

Select one of the following:

  • socket

  • thread

  • pipe

  • semaphore

Explanation

Question 56 of 103

1

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

Select one of the following:

  • communication link

  • message-passing link

  • synchronization tool

  • all of the above

Explanation

Question 57 of 103

1

This system handles multiple interactive jobs:

Select one of the following:

  • Serial procesing

  • Simple batch system

  • Time-sharing system

  • Multiprogrammed batch system

Explanation

Question 58 of 103

1

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

Select one of the following:

  • Improper synchronization

  • Nondeterminate program operation

  • Deadlocks

  • Failed mutual exclusion

Explanation

Question 59 of 103

1

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

Select one of the following:

  • improper synchronization

  • nondeterminate program operation

  • failed mutual exclusion

  • deadlocks

Explanation

Question 60 of 103

1

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

Select one of the following:

  • Interrupt

  • Job Control Language

  • Ad hoc Method

  • Monitor

Explanation

Question 61 of 103

1

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

Select one of the following:

  • frames

  • segments

  • pages

  • none of the above

Explanation

Question 62 of 103

1

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

Select one of the following:

  • Compaction

  • External fragmentation

  • Memory distribution

  • Internal fragmentation

Explanation

Question 63 of 103

1

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

Select one of the following:

  • TLB miss

  • page fault

  • buffer miss

  • TLB hit

Explanation

Question 64 of 103

1

With paging there is no ______ fragmentation.

Select one of the following:

  • either type of

  • internal

  • external

  • none of the above

Explanation

Question 65 of 103

1

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

Select one of the following:

  • TLB hit

  • TLB miss

  • buffer miss

  • page fault

Explanation

Question 66 of 103

1

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

Select one of the following:

  • Request matrix

  • Resource matrix

  • Claim matrix

  • Allocation matrix

Explanation

Question 67 of 103

1

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

Select one of the following:

  • process holds a resource while awaiting for other resource.

  • no resource can be forcibly removed from process holding it

  • only one process may use a resource at a time

  • each process holds resource needed by next process in chain

Explanation

Question 68 of 103

1

«Circular wait» condition for deadlock is defined as:

Select one of the following:

  • each process holds a resource needed by next process in chain.

  • no resource can be forcibly removed from process holding it

  • only one process may use a resource at a time

  • process holds a resource while awaiting for other resource

Explanation

Question 69 of 103

1

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

Select one of the following:

  • hold and wait

  • deadlock avoidance

  • race around condition

  • buffer overflow

  • none of the above

Explanation

Question 70 of 103

1

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

Select one of the following:

  • refreshing resource

  • replenishing resource

  • refurbished resource

  • reusable resource

Explanation

Question 71 of 103

1

The available vector defines:

Select one of the following:

  • total amount of resources required for all processes

  • total amount of each resource allocated to all processes

  • total amount of each resource NOT allocated to any process

  • total amount of each resource in the system

Explanation

Question 72 of 103

1

"No preemption" condition for deadlock is defined as:

Select one of the following:

  • No resource can be forcibly removed from process holding it.

  • Only one process may use a resource at a time

  • Process holds a resource while awaiting for other resource

  • Each process holds resource needed by next process in chain

Explanation

Question 73 of 103

1

For sharable resources, mutual exclusion

Select one of the following:

  • is not required

  • is required

  • may be or may not be required

  • none of the mentioned

Explanation

Question 74 of 103

1

In the blocking send, blocking receive:

Select one of the following:

  • both sender and receiver are blocked until message is delivered

  • none of the above

  • the sending process sends the message and resumes operation

  • the sending process sends the message while receiver is blocked

Explanation

Question 75 of 103

1

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

Select one of the following:

  • sender continues on, receiver is blocked until the requested message arrives.

  • neither of processes are required to wait

  • the sending process keeps sending until the message is received

  • the sending process sends the message and resumes operation

Explanation

Question 76 of 103

1

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

Select one of the following:

  • failed mutual exclusion

  • improper synchronization

  • deadlocks

  • nondeterminate program operation

Explanation

Question 77 of 103

1

Which of the following state transitions is not possible?

Select one of the following:

  • Blocked to running

  • Blocked to ready

  • Running to blocked

  • Ready to running

Explanation

Question 78 of 103

1

What is a short-term scheduler?

Select one of the following:

  • It selects which process has to be executed next and allocates CPU

  • It selects which process has to be brought into the ready queue

  • It selects which process to remove from memory by swapping

  • None of these

Explanation

Question 79 of 103

1

What is a long-term scheduler?

Select one of the following:

  • It selects which process has to be brought into the ready queue

  • It selects which process has to be executed next and allocates CPU

  • It selects which process to remove from memory by swapping

  • None of these

Explanation

Question 80 of 103

1

What is inter-process communication?

Select one of the following:

  • Communication between two threads of same process.

  • Communication between two process

  • Communication within the process

  • None of the mentioned

Explanation

Question 81 of 103

1

There were no OS with

Select one of the following:

  • Serial processing

  • Simple batch systems

  • Time sharing systems

  • Multiprogrammed batch systems

Explanation

Question 82 of 103

1

Inter-process communication

Select one of the following:

  • allows processes to communicate and synchronize their actions without using the same address space

  • none of the above

  • allows the processes to only synchronize their actions without communication

  • allows processes to communicate and synchronize their actions when using the same address space

Explanation

Question 83 of 103

1

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

Select one of the following:

  • algorithm

  • process

  • instruction

  • program

Explanation

Question 84 of 103

1

In contiguous memory allocation

Select one of the following:

  • each process is contained in a single contiguous section of memory

  • none of the above

  • the memory space is contiguous

  • all processes is contained in a single contiguous section of memory

Explanation

Question 85 of 103

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:

Select one of the following:

  • Time scheduling

  • Time slicing

  • Time sliding

  • Time allocating

Explanation

Question 86 of 103

1

In internal fragmentation, memory is internal to a partition and

Select one of the following:

  • is not being used

  • none of the above

  • is always used

  • is being used

Explanation

Question 87 of 103

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

Select one of the following:

  • memory

  • page

  • frame

  • segment

Explanation

Question 88 of 103

1

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

Select one of the following:

  • Best fit

  • Worst fit

  • First fit

  • None of the above

Explanation

Question 89 of 103

1

24. Which of the following statements is false?

Select one of the following:

  • I\O transfers are more efficient with large pages

  • a large page size causes instructions and data that will not be referenced brought into primary storage

  • a small page size causes large page tables

  • internal fragmentation is increased with small pages

Explanation

Question 90 of 103

1

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

Select one of the following:

  • Round-robin technique

  • Prioritizing

  • Carousel technique

  • Merry-go-round technique

Explanation

Question 91 of 103

1

The limit register:

Select one of the following:

  • Defines the size of the region of (in bytes or words)

  • Contains the index into the process list of the process currently controlling the processor

  • Points to the next instruction in that process to be executed

  • Contains the staring address of the region of memory occupied by the process

Explanation

Question 92 of 103

1

Dispatcher is:

Select one of the following:

  • Small program which switches the processor from one process to another

  • Trace scheduler

  • Interrupt handler

  • User account manager

Explanation

Question 93 of 103

1

Process spawning is:

Select one of the following:

  • Creation of parent process

  • Creation of child process

  • Termination of parent process

  • Termination of child process

Explanation

Question 94 of 103

1

The code that changes the value of the semaphore is:

Select one of the following:

  • remainder section code

  • non – critical section code

  • critical section code

  • none of the mentioned

Explanation

Question 95 of 103

1

This resource can be created and destroyed

Select one of the following:

  • consumable resource

  • finite resource

  • restartable resource

  • resumable resource

Explanation

Question 96 of 103

1

What is NOT an example of consumable resource?

Select one of the following:

  • Information in I/O buffers.

  • Signals

  • Main memory

  • Messages

Explanation

Question 97 of 103

1

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

Select one or more of the following:

  • 1

  • —1

  • 0

  • 0.5

Explanation

Question 98 of 103

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

Select one of the following:

  • Deadlocks

  • Failed mutual exclusion

  • Nondeterminate program operation

  • Improper synchronization

Explanation

Question 99 of 103

1

Mutual exclusion means that

Select one of the following:

  • if a process is executing in its critical section, then no other process must be executing in their critical sections

  • if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes exclusion

  • if a process is executing in its critical section, then other processes must be executing in their critical section

  • none of the above

Explanation

Question 100 of 103

1

The two kinds of semaphores are:

Select one or more of the following:

  • mutex

  • counting

  • binary

  • decimal

Explanation

Question 101 of 103

1

The objective of multi-programming is to:

Select one of the following:

  • have multiple programs waiting in a queue ready to run

  • to maximize CPU utilization

  • to minimize CPU utilization

Explanation

Question 102 of 103

1

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

Select one of the following:

  • Mutual exclusion

  • Multiprogramming

  • Semaphore

  • Multitasking

Explanation

Question 103 of 103

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?

Select one of the following:

  • Paging

  • Virtual memory

  • Partition

  • Segmentation

Explanation

Previous
Check answer
Next