Copiar e Editar

OS Part 1

Descrição

Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Quiz sobre OS Part 1, criado por Good Guy Beket em 18-12-2017.
Good Guy Beket
Quiz por Good Guy Beket, atualizado more than 1 year ago Mais Menos
Criado por um usuário excluído aproximadamente 7 anos atrás
Good Guy Beket
Copiado por Good Guy Beket aproximadamente 7 anos atrás
1039
17
0

Resumo de Recurso

Questão 1

Questão
In the blocking send, blocking receive
Responda
  • 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

Questão 2

Questão
The table _____ contains the base address of each page in physical memory
Responda
  • process
  • memory
  • page
  • frame

Questão 3

Questão
A state is safe, if:
Responda
  • the system can allocate resources to each process in some order and still avoid deadlock
  • the system does not crash due to deadlock occurrence
  • the state keeps the system protected and safe
  • all of the above

Questão 4

Questão
In fixed sized partition, the degree of multiprogramming is bounded by ____
Responda
  • the memory size
  • all of the above
  • the number of partitions
  • the CPU utilization

Questão 5

Questão
_____ is generally faster than _____
Responda
  • worst fit, best fit
  • best fit, first fit
  • first fit, best fit
  • none of the above

Questão 6

Questão
The two atomic operations permissible on semaphores are: (several answer)
Responda
  • wait
  • signal
  • hold
  • stop

Questão 7

Questão
Program:
Responda
  • is the device where information stored
  • is a sequence of the instructions
  • is a device that performs a sequence of operations specified by instructions in memory
  • is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user

Questão 8

Questão
"Mutual exclusion" condition for deadlock is defined as:
Responda
  • Only one process may use a resource at a time
  • No resource can be forcibly removed from process holding it
  • Process holds a resource while awaiting for other resource
  • Each process holds resource needed by next process in chain

Questão 9

Questão
"Hold and wait" condition for a deadlock is defined as:
Responda
  • Only one process may use a resource at a time
  • No resource can be forcibly removed from process holding it
  • Process holds a resource while awaiting for other resource
  • Each process holds resource needed by next process in chain

Questão 10

Questão
A monitor is a type of:
Responda
  • none of the above
  • high level synchronization construct
  • low level synchronization construct
  • semaphore

Questão 11

Questão
What is NOT the example of consumable resources?
Responda
  • Information in I\O buffers
  • Signals
  • Main memory
  • Messages

Questão 12

Questão
Which one is a synchronization tool?
Responda
  • socket
  • thread
  • pipe
  • semaphore

Questão 13

Questão
A Process Control Block (PCB) does not contain which of the following?
Responda
  • stack
  • data
  • process state
  • bootstrap program

Questão 14

Questão
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.
Responda
  • Multiprocessing, multiprogramming
  • Uniprogramming, Multiprocessing
  • Multiprogramming, Uniprocessing
  • Multiprogramming, Multiprocessing

Questão 15

Questão
Memory:
Responda
  • is the device where information stored
  • is a sequence of the instructions
  • is a device that performs a sequence of operations specified by instructions in memory
  • is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user

Questão 16

Questão
This resource can be safely used by only one process at a time and is not depleted by that use:
Responda
  • refurbished resource
  • replenishing resource
  • reusable resource
  • refreshing resource

Questão 17

Questão
Which of the following condition is required for the deadlock to be possible?
Responda
  • mutual exclusion
  • all of the above
  • no resource can be forcibly removed from a process holding it
  • a process may hold allocated resources while awaiting assignment of other resources

Questão 18

Questão
The _____ is used as an index into the page table
Responda
  • page number
  • page offset
  • frame bit
  • frame offset

Questão 19

Questão
A page fault:
Responda
  • occurs when a program accesses a page of memory
  • is a reference to a page belonging to another program
  • is an access to a page not currently in memory
  • is an error is a specific page

Questão 20

Questão
A state of a process is defined by:
Responda
  • the activity is just executed by the process
  • the final activity of the process
  • the activity to next be executed by the process
  • the current activity of the process

Questão 21

Questão
Suppose that a process is in “Blocked” state waiting for some I\O service. When a service is completed, it goes to the:
Responda
  • Ready state
  • Running state
  • Terminated state
  • Suspended state

Questão 22

Questão
The link between two processes P and Q to send and receive a message is called:
Responda
  • message-passing link
  • all of the above
  • communication link
  • synchronization link

Questão 23

Questão
Message passing system allows processes to:
Responda
  • share data
  • communicate with one another without resorting to shared data
  • name the recipient or sender of the message
  • communicate with one another by resorting shared data

Questão 24

Questão
Which of the following statements is false?
Responda
  • 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

Questão 25

Questão
The systems which allows only one process execution at a time, are called:
Responda
  • unitasking systems
  • uniprocessing systems
  • uniprogramming systems
  • unicasting systems

Questão 26

Questão
Remote Procedure Calls (RPC) are used:
Responda
  • none of the above
  • for communication between two processes on separate systems
  • for communication between two processes on the same systems
  • for communication between two processes remotely different from each other on the same system

Questão 27

Questão
A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem?
Responda
  • two
  • three
  • one
  • four

Questão 28

Questão
This resource can be created and destroyed
Responda
  • resumable resource
  • restartable resource
  • consumable resource
  • finite resource

Questão 29

Questão
Fixed-length block of data in secondary memory is called:
Responda
  • none of the above
  • frames
  • segments
  • pages

Questão 30

Questão
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?
Responda
  • Multitasking
  • Semaphore
  • Mutual exclusion
  • multiprogramming

Questão 31

Questão
Every address generated by the CPU is divided into two parts:
Responda
  • frame offset
  • page number
  • frame bit
  • page offset

Questão 32

Questão
Segmentation suffers from external fragmentation?
Responda
  • True
  • False

Questão 33

Questão
For each process OS creates and manages:
Responda
  • Process control block
  • Program code
  • Program
  • Thread control block

Questão 34

Questão
What is a trap/exception?
Responda
  • user generated interrupt caused by an error
  • failure of the system
  • hardware generated interrupt caused by an error
  • software generated interrupt caused by an error

Questão 35

Questão
What is the reusable resource:
Responda
  • none of the above
  • that can be used by more than one process at a time
  • that can be used by one process at a time and is not depleted by that use
  • that can be shared between various threads

Questão 36

Questão
Interprocess communication:
Responda
  • 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
  • allows processes to communicate and synchronize their actions without using the same address space

Questão 37

Questão
Which of the following transitions is not possible?
Responda
  • blocked to running
  • running to blocked
  • blocked to ready
  • ready to running

Questão 38

Questão
Any program, no matter how small, will occupy an entire partition results in:
Responda
  • internal fragmentation
  • segmentation
  • paging
  • external fragmentation

Questão 39

Questão
This matrix defines requirements of processes i for the resources j
Responda
  • Allocation matrix
  • Resource matrix
  • Request matrix
  • Claim matrix

Questão 40

Questão
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) _____
Responda
  • Entry section
  • race section
  • shared memory segments
  • process synchronization

Questão 41

Questão
The context of a process in the PCB of a process DOES NOT contain:
Responda
  • context switch time
  • the process state
  • memory-management information
  • the value of the CPU registers

Questão 42

Questão
External fragmentation will not occur when:
Responda
  • no matter which algorithm is used, it will always occur
  • first fit is used
  • best fit is used
  • next fit is used

Questão 43

Questão
A deadlock avoidance algorithm dynamically examines the _____, to ensure that a circular wait condition can never exist
Responda
  • resources
  • operating system
  • resource allocation state
  • system storage state

Questão 44

Questão
The process control block is:
Responda
  • process type variable
  • data structure
  • block in memory
  • secondary storage section

Questão 45

Questão
This illustrates the progress of two processes competing for two resources:
Responda
  • joint process diagram
  • joint ingres diagram
  • joint regress diagram
  • joint progress diagram

Questão 46

Questão
In a multiprogramming environment:
Responda
  • the programs are developed by more than one person
  • more than one process resides in the memory
  • single user can execute many programs at the same time
  • the processor executes more than one process at a time

Questão 47

Questão
When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called:
Responda
  • priority exchange
  • priority inversion
  • priority removal
  • priority modification

Questão 48

Questão
Main memory is broken into fixed-sized blocks called _____
Responda
  • none of the above
  • pages
  • frames
  • segments

Questão 49

Questão
The first fit, best fit and worst fit are strategies to select a
Responda
  • process from a queue to put in memory
  • all of the above
  • free hole from a set of available holes
  • processor to run the next process

Questão 50

Questão
The Banker’s algorithm is referred to as
Responda
  • denial of service
  • resource allocation denial
  • loan allocation denial
  • resource allocation refusal

Questão 51

Questão
The code that changes the value of the semaphore is:
Responda
  • non-critical section code
  • remainder section code
  • none of the above
  • critical section code

Questão 52

Questão
The two kinds of semaphores are: (Several answers)
Responda
  • mutex
  • counting
  • binary
  • decimal

Questão 53

Questão
"Circular wait" condition for deadlock is defined as:
Responda
  • Only one process may use a resource at a time
  • No resource can be forcibly removed from process holding it
  • Process holds a resource while awaiting for other resource
  • Each process holds resource needed by next process in chain

Questão 54

Questão
Banker’s algorithm for resource allocation deals with:
Responda
  • deadlock prevention
  • mutual exclusion
  • deadlock recovery
  • deadlock avoidance

Questão 55

Questão
What is compaction?
Responda
  • a paging technique
  • a technique for overcoming fatal error
  • a technique for overcoming internal fragmentation
  • a technique for overcoming external fragmentation

Questão 56

Questão
Process is:
Responda
  • a job in secondary memory
  • a unit of activity characterized by execution of a sequence of instructions, a current state, and an associated set
  • contents of main memory
  • program in high level language kept on disk

Questão 57

Questão
A single thread of control allows the process to perform:
Responda
  • both
  • only one task at a time
  • multiple tasks at a time
  • none

Questão 58

Questão
When the memory allocated to a process is slightly larger than a process, then:
Responda
  • both will occur
  • external fragmentation occurs
  • internal fragmentation occurs
  • none of the above

Questão 59

Questão
A problem encountered in multitasking when a process is perpetually denied necessary resources is called:
Responda
  • starvation
  • deadlock
  • aging
  • inversion

Questão 60

Questão
The memory allocation scheme subject to "internal fragmentation" is:
Responda
  • segmentation
  • virtual memory segmentation
  • fixed partitioning
  • pure demand paging

Questão 61

Questão
Which one is deadlock avoidance algorithm?
Responda
  • dining philosophers problem
  • elevator algorithm
  • banker’s algorithm
  • round-robin algorithm

Questão 62

Questão
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?
Responda
  • virtual memory
  • segmentation
  • paging
  • partition

Questão 63

Questão
Variable-length block of data that resides in secondary memory is called:
Responda
  • none of the above
  • frames
  • segments
  • pages

Questão 64

Questão
The memory allocation scheme subject to "external fragmentation" is:
Responda
  • segmentation
  • swapping
  • multiple contiguous fixed partitioning
  • pure demand paging

Questão 65

Questão
Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and
Responda
  • race condition
  • deadlock avoidance
  • hold and wait
  • starvation

Questão 66

Questão
A binary semaphore is semaphore with integer values: (Several answers)
Responda
  • 1
  • 0
  • -1
  • 0.5

Questão 67

Questão
Program always deals with:
Responda
  • logical address
  • physical address
  • relative address
  • absolute address

Questão 68

Questão
The systems which allows only one process execution at a time, are called
Responda
  • uniprogramming systems
  • unitasking systems
  • uniprocessing sysems
  • unicasting systems

Questão 69

Questão
Swapping:
Responda
  • allows many programs to use memory simultaneously
  • allows each program in turn to use the memory
  • does not work with overlaying
  • none of the above

Questão 70

Questão
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:
Responda
  • dynamic condition
  • race condition
  • critical condition
  • essential condition

Questão 71

Questão
If a page table entry is present in the TLB, then it is known as a:
Responda
  • buffer miss
  • TLB miss
  • page fault
  • TLB hit

Questão 72

Questão
With paging there is no _____ fragmentation
Responda
  • either type of
  • none of the above
  • external
  • internal

Questão 73

Questão
The address of a page table in memory is pointed by:
Responda
  • page table base register
  • stack pointer
  • page register
  • program counter

Questão 74

Questão
What is a medium-term scheduler?
Responda
  • it selects which process has to be executed next and allocates CPU
  • none of the above
  • it selects which process has to be brought into the ready queue
  • it selects which process has to remove from memory by swapping

Questão 75

Questão
"No preemption" condition for a deadlock is defined as:
Responda
  • Only one process may use a resource at a time
  • No resource can be forcibly removed from process holding it
  • Process holds a resource while awaiting for other resource
  • Each process holds resource needed by next process in chain

Questão 76

Questão
Processor:
Responda
  • is the device where information stored
  • is a sequence of the instructions
  • is a device that performs a sequence of operations specified by instructions in memory
  • is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user

Questão 77

Questão
Fixed-length block of main memory is called _____
Responda
  • frames
  • segments
  • none of the above
  • pages

Questão 78

Questão
The initial value of the semaphore that allows only one of the many processes to enter their critical section, is?
Responda
  • 1
  • 0
  • 2
  • 10

Questão 79

Questão
Mutual exclusion means that:
Responda
  • if a process is executing in its critical section, then other processes must be executing in their critical section
  • 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 no other process must be executing in their critical sections
  • none of the above

Questão 80

Questão
For every process there is a _____.
Responda
  • pointer to page table
  • copy of page table
  • frame table
  • page table

Questão 81

Questão
In operating system, each process has its own
Responda
  • all of the mentioned
  • address space and global variables
  • set of data
  • program code

Questão 82

Questão
Listing the sequence of instructions that are executed is called:
Responda
  • trace
  • program counter
  • instruction
  • control block

Questão 83

Questão
The segment of code in which the process may change common variables, update tables, write into files known as:
Responda
  • critical section
  • program
  • non-critical section
  • mutual exclusion

Questão 84

Questão
Deadlock inevitable region can be referred as:
Responda
  • fun region
  • fatal region
  • final region
  • false region

Questão 85

Questão
How to solve a problem of equal-size partitions?
Responda
  • unequal-size partitions
  • segmentation
  • compaction
  • virtual memory segmentation

Questão 86

Questão
Paging?
Responda
  • allows multiple programs to reside in separate areas of core at the time
  • is a method of memory allocation by which the program is subdivided into equal portions, or pages and core is subdivided equal portions or blocks
  • is a method of allocating processor time
  • consists of those addresses that may be generated by a processor during execution of a computation

Questão 87

Questão
In internal fragmentation, memory is internal to a partition and:
Responda
  • is not being used
  • none of the above
  • is always used
  • is being used

Questão 88

Questão
A set of processes is deadlock if:
Responda
  • each process is blocked and will remain so forever
  • none of the above
  • all processes are trying to kill each other
  • each process is terminated

Questão 89

Questão
A memory used to provide a high speed is called?
Responda
  • cache
  • main memory
  • disk buffer
  • stack pointer

Questão 90

Questão
In indirect communication between processes P and Q:
Responda
  • there is a mailbox to help communication between P and Q
  • none of the above
  • there is another machine between the two processes to help communication
  • there is another process R to handle and pass on the messages between P and Q

Questão 91

Questão
Semaphore is a/an _____ to solve the critical section problem?
Responda
  • special program for a system
  • complex structure
  • integer variable
  • hardware for a system

Questão 92

Questão
Which of the following is not the state of a process?
Responda
  • new
  • running
  • old
  • ready

Questão 93

Questão
The address of the next instruction to be executed by the current process is provided by the:
Responda
  • pipe
  • program counter
  • CPU registers
  • process stack

Questão 94

Questão
Which of the following is not true about the memory management?
Responda
  • segmentation suffers from external fragmentation
  • paging suffers from internal fragmentation
  • virtual memory is used only in multi-user systems
  • segmented memory can be paged

Questão 95

Questão
The primary distinction between the short-term scheduler and long-term scheduler is:
Responda
  • the length of their queues
  • none of the above
  • the type of processes the schedule
  • the frequency of their execution

Questão 96

Questão
In the non-blocking send, blocking receive:
Responda
  • the sending process sends the message and resumes operation
  • sender continues on, receiver is blocked until the requested message arrives
  • the sending process keeps sending until it receives a message
  • none of the above

Questão 97

Questão
The objective of multi-programming is to:
Responda
  • have multiple programs waiting in a queue ready to run
  • to maximize CPU utilization
  • to minimize CPU utilization
  • all of the above

Questão 98

Questão
A system is in the safe state if:
Responda
  • a. the system can allocate resources to each process in some order and stil avoid a deadlock
  • b. there exist a safe sequence
  • both a and b
  • none of the above

Questão 99

Questão
When memory is divided into a several fixed sized partitions, each partition may contain _____
Responda
  • exactly one process
  • none of the above
  • at least one process
  • multiple processes at once

Questão 100

Questão
In the non-blocking send, non-blocking receive:
Responda
  • the sending process keeps sending until it receives a message
  • 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

Questão 101

Questão
A process can be terminated due to:
Responda
  • fatal error
  • normal exit
  • all of the mentioned
  • killed by another process

Questão 102

Questão
What is a short-term scheduler?
Responda
  • it selects which process has to be executed next and allocates CPU
  • none of the above
  • it selects which process has to be brought into the ready queue
  • it selects which process has to remove from memory by swapping

Questão 103

Questão
In contiguous memory allocation:
Responda
  • 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

Questão 104

Questão
External fragmentation exists when:
Responda
  • none of the above
  • the total memory is insufficient to satisfy a request
  • enough total memory exists to satisfy a request but it is not contiguous
  • a request cannot be satisfied even when the total memory is free

Questão 105

Questão
CPU fetches the instruction from memory according to the value of?
Responda
  • status register
  • program counter
  • instruction register
  • program status word

Questão 106

Questão
A sequence of instructions, in a computer language, to get the desired result, is known as:
Responda
  • algorithm
  • instruction
  • process
  • program

Questão 107

Questão
Semaphores:
Responda
  • are used for memory management
  • synchronize critical resources to prevent deadlock
  • are used to do I/O
  • synchronize critical resources to prevent contention

Questão 108

Questão
This matrix defines the current allocation to process i of the resource j
Responda
  • Allocation matrix
  • Resource matrix
  • Request matrix
  • Claim matrix

Questão 109

Questão
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
Responda
  • memory
  • page
  • frame
  • segment

Questão 110

Questão
For non-sharable resources like a printer, mutual exclusion:
Responda
  • must exist
  • none of the above
  • must not exist
  • may exist

Questão 111

Questão
If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called
Responda
  • critical exclusion
  • asynchronous exclusion
  • mutual exclusion
  • synchronous exclusion

Questão 112

Questão
Interprocess communication:
Responda
  • allows process to synchronize activity
  • is never necessary
  • is usually done via disk drives
  • is required for all processes

Questão 113

Questão
The available vector defines:
Responda
  • total amount of resources required for all processes
  • total amount of each resource in the system
  • total amount of each resource allocated to all processes
  • total amount of each resource NOT allocated to any process

Questão 114

Questão
A task in a blocked state
Responda
  • is running
  • is executable
  • must still be placed in the run queues
  • is waiting for same temporarily unavailable resources

Questão 115

Questão
The systems which allows only one process execution at a time, are called:
Responda
  • unitasking systems
  • uniprocessing systems
  • uniprogramming systems
  • none of the above

Questão 116

Questão
What is NOT an example of reusable resource
Responda
  • semaphores
  • processors
  • interrupt
  • i/o channels

Questão 117

Questão
An un-interruptible unit is known as:
Responda
  • single
  • none of the above
  • static
  • atomic

Questão 118

Questão
How to solve a problem of "external" fragmentation?
Responda
  • unequal-size partitions
  • segmentation
  • compaction
  • virtual memory segmentation

Questão 119

Questão
Runtime mapping from virtual to physical address is done by?
Responda
  • CPU
  • none of the above
  • memory management unit
  • PCI

Questão 120

Questão
A solution to the problem of external fragmentation is:
Responda
  • compaction
  • larger memory size
  • unequal size parts
  • smaller memory space

Questão 121

Questão
in the non-blocking send, non-blocking receive:
Responda
  • Neither of processes are required to wait
  • The sending process keeps sending until it receives a message
  • The sending process keeps sending until the message is received
  • The sending process sends the message and resumes operation

Questão 122

Questão
In segmentation, each address is specified by:
Responda
  • A segment number and an offset
  • A page number and an offset
  • A frame number and an offset
  • A segment number and a key

Questão 123

Questão
Virtual memory takes advantage of:
Responda
  • Large secondary memory
  • Modular programming
  • Fast CPU
  • Scheduling

Questão 124

Questão
Which of the replacement algorithms selects for the next reference is the longest?
Responda
  • Optimal
  • LRU
  • Clock

Quer criar seus próprios Quizzes gratuitos com a GoConqr? Saiba mais.

Semelhante

Components of An Operating System - Jason Madappattu
Jason EM
Operating Systems (OS)
rwc.carlton
Operating System
Kai Stovell Unkn
Operating Systems
David Lee
OS
Koda M
Tyrannosaure rex
daom
Software and Utilities
Adam Meese
Opre
varadi richard
Operating systems
Joshua Wilkins U
LinuxOS-History
kostavro
LinuxOS-General
kostavro
Explore a Biblioteca