Copiar e Editar

os

Descrição

Operating Systems (OS) Quiz sobre os, criado por Csse 1502 em 17-12-2017.
Csse 1502
Quiz por Csse 1502, atualizado more than 1 year ago
Csse 1502
Criado por Csse 1502 mais de 6 anos atrás
1526
14
0

Resumo de Recurso

Questão 1

Questão
What is not a main structural element of a computer system?
Responda
  • Processor
  • Main Memory
  • I/O Modules
  • System Bus
  • Operating system

Questão 2

Questão
Which of the following registers are used by the processor to exchange data with memory?
Responda
  • MAR and MBR
  • PC and IR
  • Program status word
  • I/OAR and I/OBR

Questão 3

Questão
Which of the following registers are used by the processor to exchange data with input/output module?
Responda
  • MAR and MBR
  • PC and IR
  • Program status word
  • I/OAR and I/OBR

Questão 4

Questão
Which of the following element of a computer system controls the operation of the computer and performs its data processing functions?
Responda
  • System bus
  • Main memory
  • I/O modules
  • Processor

Questão 5

Questão
Which of the following element of a computer system stores data and programs?
Responda
  • Main memory
  • System bus
  • Processor
  • I/O modules

Questão 6

Questão
Which of the following provides for communication among elements of a computer system?
Responda
  • Main memory
  • System bus
  • Processor
  • I/O modules

Questão 7

Questão
Which of the following element of a computer system moves data between the computer and its external environment?
Responda
  • Main memory
  • Processor
  • System bus
  • I/O modules

Questão 8

Questão
The processor contains a single data register, called
Responda
  • PSW
  • PC
  • IR
  • AC

Questão 9

Questão
This register specifies a particular input/output device
Responda
  • Memory address register
  • I/OAR
  • Memory buffer register
  • I/OBR

Questão 10

Questão
This register is used for the exchange of data between an I/O module and the processor
Responda
  • Memory address register
  • I/OAR
  • Memory buffer register
  • I/OBR

Questão 11

Questão
This register contains the data to be written into memory or which receives the data read from memory
Responda
  • I/OAR
  • memory buffer register
  • memory address register
  • I/OBR

Questão 12

Questão
This register specifies the location in memory for the next read or write
Responda
  • Memory address register
  • I/OAR
  • Memory buffer register
  • I/OBR

Questão 13

Questão
Index register, segment register, and stack register are example of:
Responda
  • Address register
  • Data registers
  • Control registers
  • Status registers

Questão 14

Questão
Which register contains the address of the next instruction to be fetched?
Responda
  • instruction register
  • execution register
  • program counter
  • process counter

Questão 15

Questão
Which register contains the instruction most recently fetched?
Responda
  • instruction register
  • execution register
  • program counter
  • process counter

Questão 16

Questão
Which register contains condition codes set by the processor hardware as the result of operations?
Responda
  • Program counter
  • Accumulator
  • Program status word
  • Stack pointer

Questão 17

Questão
The fetched instruction is loaded into the
Responda
  • IR
  • Accumulator
  • Memory
  • PC

Questão 18

Questão
At the beginning of each instruction cycle, the processor fetches an instruction from the memory. The address of the instruction is held in
Responda
  • IR
  • MBR
  • MAR
  • PC

Questão 19

Questão
The processor is executing ‘Load AC from memory’ instruction. Choose the correct micro-instructions:
Responda
  • PC -> MAR M -> MBR MBR -> AC IR -> MAR M -> MBR MBR -> AC
  • PC -> MBR M -> MAR MAR -> IR IR -> MAR M -> MBR MBR -> AC
  • PC -> MAR M -> MBR MBR -> IR IR -> MAR M -> MBR MBR -> AC
  • PC -> MAR M -> MBR MBR -> IR IR -> MBR M -> MAR MAR -> AC

Questão 20

Questão
When an I/O device completes an I/O operation, the device issues an interrupt signal to the processor and then:
Responda
  • The processor stops execution of the current instruction without finishing it and responds to the interrupt
  • The processor loads the program counter with the entry location of the interrupt-handling routine
  • The processor saves information needed to resume the current program at the point if interrupt
  • The processor finishes execution of the current instruction before responding to the interrupt

Questão 21

Questão
When the time required for the I/O operation is less that the time to complete the execution of instructions between write operations in the user program, it is:
Responda
  • Fast I/O wait
  • Slow I/O wait
  • Long I/O wait
  • Short I/O wait

Questão 22

Questão
When the time required for the I/O operation will take much more time than executing a sequence of user instructions, it is
Responda
  • Slow I/O wait
  • Long I/O wait
  • Fast I/O wait
  • Short I/O wait

Questão 23

Questão
Most I/O devices are:
Responda
  • much slower than the processor
  • much faster than the processor
  • much shorter than the processor
  • much longer than the processor

Questão 24

Questão
If there no interrupts, after each write operation, the processor must
Responda
  • Load new PC value
  • Finish execution of current instruction
  • Save the PSW and PC onto control stack
  • Pause and remain idle until the I/O operation finishes

Questão 25

Questão
Complete the relationship concerning the memory systems: faster access time –
Responda
  • lower capacity
  • greater cost per bit
  • faster access speed
  • smaller cost per bit

Questão 26

Questão
Complete the relationship concerning the memory systems: greater capacity –
Responda
  • lower capacity
  • greater cost per bit
  • faster access speed
  • smaller cost per bit

Questão 27

Questão
Complete the relationship concerning the memory systems: greater capacity –
Responda
  • lower capacity
  • slower access time
  • greater cost per bit
  • faster access speed

Questão 28

Questão
The smaller, more expensive, faster memory is:
Responda
  • Disk drive
  • Cache
  • Main memory
  • Register

Questão 29

Questão
If the accessed word is found in the faster memory, that is defined as a:
Responda
  • bingo
  • win
  • hit
  • evrika

Questão 30

Questão
If the accessed word is not found in the faster memory, that is defined as a:
Responda
  • ricochet
  • miss
  • zero
  • Loss

Questão 31

Questão
The central idea in this system was the use of a piece of software known as the monitor
Responda
  • Time-sharing-system
  • Simple batch system
  • Multiprogrammed batch system
  • Serial processing

Questão 32

Questão
The concept of a batch operating system was developed to
Responda
  • Maximize processor utilization (To improve utilization)
  • Minimize response time
  • Support interactive mode
  • Minimize processor utilization

Questão 33

Questão
The concept of modes of operation (user mode, system mode) was introduced with
Responda
  • Time-sharing-system
  • Simple batch system
  • Multiprogrammed batch system
  • Serial processing

Questão 34

Questão
'Ease of evolution of an OS' corresponds to the following objective:
Responda
  • Efficiency
  • Convenience
  • Ability to evolve

Questão 35

Questão
The principal objective of the time-sharing system is to
Responda
  • Minimize response time
  • Minimize processor utilization
  • Maximize response time
  • Maximize processor utilization

Questão 36

Questão
The processor was often idle waiting for the I/O instruction to conclude. To overcome the problem the following approach was introduced: when one job needs to wait for I/O, the processor can switch to the other job. This was a
Responda
  • Multiprogramming or multitasking batch system
  • Simple batch system
  • Serial processing
  • Time-sharing-system

Questão 37

Questão
The programmer interacted directly with the computer hardware with
Responda
  • Simple batch systems
  • Serial processing
  • Time-sharing-systems
  • Multiprogrammed batch systems

Questão 38

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

Questão 39

Questão
'The OS as a resource manager' corresponds to the following objective:
Responda
  • Efficiency
  • Convenience
  • Ability to evolve

Questão 40

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

Questão 41

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

Questão 42

Questão
'The OS as a User/Computer interface' corresponds to the following objective:
Responda
  • Efficiency
  • Convenience
  • Ability to evolve

Questão 43

Questão
This type of memory is nonvolatile
Responda
  • Secondary memory
  • Main memory
  • Register
  • Cache

Questão 44

Questão
An application programs is developed by the
Responda
  • Application programmer
  • End user
  • Operating system
  • Hardware

Questão 45

Questão
When a processor attempts to read a byte or word of memory, it firstly checks the:
Responda
  • Secondary memory
  • Register
  • Cache
  • Main memory

Questão 46

Questão
The end user views a computer system in terms of
Responda
  • a set of applications
  • a set of machine instructions
  • utilities
  • a set of system programs

Questão 47

Questão
The serial processing presented two main problems:
Responda
  • setup time
  • using a monitor
  • time slicing
  • multiprogramming
  • scheduling

Questão 48

Questão
The hardware and software used in providing applications to a user can be viewed in a:
Responda
  • layered fashion
  • classified fashion
  • sandwich fashion
  • leveled fashion

Questão 49

Questão
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:
Responda
  • data consistency
  • mutual exclusion
  • race condition
  • starvation

Questão 50

Questão
This contains the most frequently used functions in the OS:
Responda
  • Kernel (или nucleus)
  • Centre
  • Base
  • Root

Questão 51

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

Questão 52

Questão
Utilities are
Responda
  • Application program
  • System programs
  • Opcodes
  • Processor registers

Questão 53

Questão
Block size is:
Responda
  • The unit of data exchanged between cache and main memory
  • Larger block size yields more hits until probability of using newly fetched data becomes less than the probability of reusing data that have to be moved out of cache
  • (How much data should be transferred from main memory to cache)

Questão 54

Questão
There were no OS with
Responda
  • Simple batch systems
  • Serial processing
  • Time-sharing-systems
  • Multiprogrammed batch systems

Questão 55

Questão
Which of the following cannot be interrupted?
Responda
  • Process
  • Thread
  • Module
  • Atomic operation

Questão 56

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

Questão 57

Questão
This determines which cache location the block will occupy: [blank_start]Mapping function[blank_end]
Responda
  • Mapping function

Questão 58

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

Questão 59

Questão
This system handles multiple interactive jobs
Responda
  • Time-sharing-system
  • Simple batch system
  • Serial processing
  • Multiprogrammed batch system

Questão 60

Questão
Process(2.0) is:
Responda
  • A program in execution
  • Program in High level language kept on disk
  • Contents of main memory
  • A job in secondary memory

Questão 61

Questão
This system was developed by General Motors for the use on an IBM 701
Responda
  • Simple Batch Systems or GM-NAA I/O
  • Serial processing
  • Multiprogrammed batch system
  • Time-sharing system

Questão 62

Questão
This chooses which block to replace when a new block is to be loaded into the cache and the cache already had all slots filled with other blocks
Responda
  • replacement algorithm
  • write policy
  • cache size
  • locality of reference

Questão 63

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

Questão 64

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

Questão 65

Questão
This type of system was developed at MIT by a group known as Project MAC for the IBM 709 in 1961
Responda
  • Serial processing
  • Multiprogrammed batch system
  • Simple batch system
  • Time-sharing-system

Questão 66

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 67

Questão
If the contents of a block in the cache are altered, then it is needed to save it back to main memory before replacing it. This is called:
Responda
  • write policy
  • mapping function
  • locality of reference
  • replacement algorithm

Questão 68

Questão
'Lost signals, duplicate signals received'. This is
Responda
  • Improper synchronization
  • Nondeterminate program operation
  • Failed mutual exclusion
  • Deadlocks

Questão 69

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

Questão 70

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

Questão 71

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

Questão 72

Questão
Which of the following is not a technique possible for I/O operations?
Responda
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Questão 73

Questão
'Two or more programs hung up waiting for each other'. This error is caused by
Responda
  • Falled mutual exclusions
  • Deadlocks
  • Nondeterminate program operation
  • Improper synchronization

Questão 74

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 75

Questão
The processor issues an I/O command to a module and waits, periodically checking the status of the I/O module until it finds that the operation is complete.
Responda
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Questão 76

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

Questão 77

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

Questão 78

Questão
'When programs share memory and their execution is interleaved by the processor, they may interfere with each other by overwriting common memory areas in unpredictable ways. The results of a particular program depend on the activities of other programs in a shared system'. This is
Responda
  • Falled mutual exclusions
  • Deadlocks
  • Nondeterminate program operation
  • Improper syncronization

Questão 79

Questão
The I/O module performs the requested action and then sets the appropriate bits in the I/O status register but takes no further action to alert the processor.
Responda
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Questão 80

Questão
When each process in the set is blocked awaiting for resource siezed by another blocked process
Responda
  • it is a deadend
  • it is a deadlock
  • it is a softlock
  • it is a mortallock

Questão 81

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

Questão 82

Questão
The described technique is:
Responda
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Questão 83

Questão
Choose the storage management responsibility for "Many application programs require means for storing information for extended periods of time, after the computer has been powered down"
Responda
  • Long-term storage
  • Protection and access control
  • Automatic allocation and management
  • Process isolation
  • Support of modular programming

Questão 84

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

Questão 85

Questão
Which of the following statements is false:
Responda
  • compaction does not involve relocation of programs
  • the technique of storage compaction involves moving all occupied areas of storage to one end or other of main storage
  • compaction is also known as garbage collection
  • the system must stop everything while it performs the compaction

Questão 86

Questão
Choose the storage management responsibility for "Programmers should be able to define program modules, and to create, destroy, and alter the size of modules dynamically"
Responda
  • Protection and access control
  • Long-term storage
  • Automatic allocation and management
  • Process isolation
  • Support of modular programming

Questão 87

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

Questão 88

Questão
The main disadvantage of this technique: it is a time-consuming process that keeps the processor busy needlessly.
Responda
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Questão 89

Questão
Memory is:
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 90

Questão
Choose the storage management responsibility for "The OS can achieve efficiency by assigning memory to jobs only as needed"
Responda
  • Protection and access control
  • Long-term storage
  • Automatic allocation and management
  • Process isolation
  • Support of modular programming

Questão 91

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
  • mutual exclusion
  • asynchronous exclusion
  • critical exclusion
  • synchronous exclusion

Questão 92

Questão
The processor issues an I/O command to a module and then go on to some other useful work.
Responda
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Questão 93

Questão
Processor is:
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 94

Questão
Choose the storage management responsibility for "The OS must allow portions of memory to be accessible in various ways by various users"
Responda
  • Protection and access control
  • Long-term storage
  • Automatic allocation and management
  • Process isolation
  • Support of modular programming

Questão 95

Questão
Interprocess communication:
Responda
  • allows processes to communicate and synchronize their actions without using the same address space
  • allows processes to communicate and synchronize their actions when using the same address space
  • allows the processes to only synchronize their actions without communication
  • none of the above

Questão 96

Questão
The I/O module performs the requested action and alerts the processor to request service when it is ready to exchange data with the processor
Responda
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Questão 97

Questão
Choose the storage management responsibility for "The OS must prevent independent processes from interfering with each other's memory, both data and instructions"
Responda
  • Protection and access control
  • Long-term storage
  • Automatic allocation and management
  • Process isolation
  • Support of modular programming

Questão 98

Questão
Program is:
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 99

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

Questão 100

Questão
In operating system security and protection, authenticity:
Responda
  • Concerned with the proper verification of the identity of users and the validity of messages or data
  • Assuring that users cannot read data for which access is unauthorized
  • Protection of data from unauthorized modification
  • Concerned with protecting the system against interruption

Questão 101

Questão
The main disadvantage of this technique: consumes a lot of processor time, because every word of data that goes from memory to I/O module or from I/O module to memory must pass through the processor
Responda
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Questão 102

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 103

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

Questão 104

Questão
In operating system security and protection, availability is:
Responda
  • Concerned with the proper verification of the identity of users and the validity of messages or data
  • Assuring that users cannot read data for which access is unauthorized
  • Protection of data from unauthorized modification
  • Concerned with protecting the system against interruption

Questão 105

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

Questão 106

Questão
The processor issues an I/O command to a separate module, by sending the type of operation (read/write), the address of the I/O device, the starting location in memory for data, number of words. Then the processor continues with other work.
Responda
  • Interrupt-driven I/O
  • Programmed I/O
  • Manual memory access
  • Direct memory access (DMA)

Questão 107

Questão
The memory allocation scheme subject to "internal" fragmentation is?
Responda
  • segmentation
  • swapping
  • multiple contiguous fixed partitionings
  • pure demand paging

Questão 108

Questão
In operating system security and protection, confidentiality is:
Responda
  • Concerned with the proper verification of the identity of users and the validity of messages or data
  • Assuring that users cannot read data for which access is unauthorized
  • Protection of data from unauthorized modification
  • Concerned with protecting the system against interruption

Questão 109

Questão
The module transfers the entire block of data to/from memory without going through the processor.
Responda
  • Interrupt-driven I/O
  • Programmed I/O
  • Manual memory access
  • Direct memory access (DMA)

Questão 110

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

Questão 111

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

Questão 112

Questão
In operating system security and protection, data integrity is:
Responda
  • Concerned with the proper verification of the identity of users and the validity of messages or data
  • Assuring that users cannot read data for which access is unauthorized
  • Protection of data from unauthorized modification
  • Concerned with protecting the system against interruption

Questão 113

Questão
The main disadvantage of this technique: there is a competition for bus usage
Responda
  • Interrupt-driven I/O
  • Programmed I/O
  • Manual memory access
  • Direct memory access (DMA)

Questão 114

Questão
A binary semaphore is a semaphore with integer values:
Responda
  • 1
  • 0,5
  • 0
  • -1

Questão 115

Questão
The resource vector define
Responda
  • total amount of each resource in the system
  • 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

Questão 116

Questão
A hardcopy sign-up sheet was used to reserve computer time with
Responda
  • Time slicing
  • Time sliding
  • Time scheduling
  • Time allocating

Questão 117

Questão
Short-term scheduler, or dispatcher, picks a process. Each process in the queue is given some time in turn. This strategy is called:
Responda
  • Round-robin technique
  • Prioritizing
  • Carousel technique
  • Merry-go-round technique

Questão 118

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 119

Questão
A system clock generates interrupts at a rate of approximately one every 0.2 seconds. At each clock interrupt, the OS regained control and could assign the processor to another user. This technique is known as
Responda
  • Time scheduling
  • Time sliding
  • Time slicing
  • Time allocating

Questão 120

Questão
The base register
Responda
  • 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

Questão 121

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

Questão 122

Questão
This matrix defines the amount of resources of type j requested by process i
Responda
  • Request matrix
  • Allocation matrix
  • Resource matrix
  • Claim matrix

Questão 123

Questão
How to solve problem of equal-size partitions? swapping (?) ----- page 318 book
Responda
  • swapping (?) ----- page 318 book unequal-size partitions
  • segmentation
  • compaction
  • virtual memory segmentation

Questão 124

Questão
The limit register
Responda
  • 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

Questão 125

Questão
Batch operating systems were used (years)
Responda
  • From the late 1940s to the mid-1950s
  • From the mid-1950 to early 1960s
  • In early 1960s

Questão 126

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

Questão 127

Questão
How to solve problem of "external" fragmentation?
Responda
  • compaction
  • larger memory space
  • smaller memory space
  • none of these

Questão 128

Questão
The principal tool available to system programmers in developing the early multiprogramming and multiuser interactive systems
Responda
  • Interrupt
  • Job control language
  • Monitor
  • Add hec method

Questão 129

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

Questão 130

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 131

Questão
Job control language was used
Responda
  • used to provide instructions to the monitor,In early 1960s
  • From late 1940s to the mid-1950s
  • From the mid-1950s to early 1960s
  • Execute instructions
  • Control the sequence of events as the resident monitor
  • Translate the user’s program into object code
  • Provide instructions to the monitor to improve job setup time

Questão 132

Questão
The process index register
Responda
  • Contains the index into a process list of the process currently controlling the processor
  • Define the region in memory occupied by the process
  • Points to the next instruction in that process to be executed
  • Contains the starting address of the region of memory occupied by the process

Questão 133

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

Questão 134

Questão
'Hold and wait' condition for deadlock is defined as
Responda
  • Process holds a resource while awaiting for other resource
  • Each process holds 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

Questão 135

Questão
Serial processing was used
Responda
  • In early 1960s
  • From late 1940s to the mid-1950s
  • From the mid-1950s to early 1960s

Questão 136

Questão
This term was first used by the designers of Multics in the 1960s
Responda
  • Monitor
  • Process
  • Multiprogramming
  • Time sharing

Questão 137

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 138

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

Questão 139

Questão
'Circular wait' condition for deadlock is defined as
Responda
  • Each process holds resource needed by next process in chain
  • 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

Questão 140

Questão
'Ease of evolution of an OS' corresponds to the following objective:
Responda
  • Efficiency
  • Convenience
  • Ability to evolve

Questão 141

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 142

Questão
'No preemption' condition for deadlock is defined as
Responda
  • 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

Questão 143

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

Questão 144

Questão
Virtual address is a
Responda
  • Virtual address is a page number and an offset within the page
  • Другого варианта нет)

Questão 145

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

Questão 146

Questão
True or false: segmentation suffers from external fragmentation?
Responda
  • True
  • False

Questão 147

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 148

Questão
True or false: paging suffers from external fragmentation?
Responda
  • True
  • False

Questão 149

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

Questão 150

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 151

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

Questão 152

Questão
In memory systems, boundary registers?
Responda
  • track the beginning and ending of programs
  • track page boundaries
  • are only necessary with fixed partitions
  • are used for temporary program variable storage

Questão 153

Questão
On all instruction cycles, the processor accesses memory at least once, to: [blank_start]to fetch the instruction[blank_end], and often one or more additional times, [blank_start]to fetch operands[blank_end] and/or [blank_start]store results[blank_end].
Responda
  • to fetch the instruction
  • to fetch operands
  • store results

Questão 154

Questão
Operating System maintains the page table for:
Responda
  • each process
  • each thread
  • each instruction
  • each address

Questão 155

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 executed, is known as?
Responda
  • Multitasking
  • Semaphore
  • Mutual exclusion
  • multiprogramming

Questão 156

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 157

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 158

Questão
When memory is divided into 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 159

Questão
The number of resources requested by a process:
Responda
  • must always be less than the total number of resources available in the system
  • must always be equal to the total number of resources available in the system
  • must not exceed the total number of resources available in the system
  • must exceed the total number of resources available in the system

Questão 160

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

Questão 161

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 162

Questão
Which one of the following is the address generated by CPU?
Responda
  • logical address
  • physical address
  • absolute address
  • none of the above

Questão 163

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

Questão 164

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 165

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

Questão 166

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 167

Questão
Which of the following is not one of the principles of dealing with deadlock?
Responda
  • Initialization
  • Avoidance
  • Detection
  • Prevention

Questão 168

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 169

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

Questão 170

Questão
The Process Control Block is:
Responda
  • a secondary storage section
  • Process type variable
  • Data Structure
  • Block in memory

Questão 171

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

Questão 172

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 173

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

Questão 174

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 175

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 176

Questão
What controls the process in a single-threaded process model?(не точно) из книги
Responda
  • Process control block
  • User address space control block
  • User stack control block
  • Kernel stack control block

Questão 177

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 178

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

Questão 179

Questão
In the non-blocking send:
Responda
  • the sending process sends the message and resumes operation
  • the sending process keeps sending unit it receives a message
  • the sending process keeps sending until the message is received
  • none of the above

Questão 180

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

Questão 181

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

Questão 182

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

Questão 183

Questão
The degree of multi-programming is:
Responda
  • the number of processes in memory
  • the number of processes executed per unit time
  • the number of processes in the ready queue
  • the number of processes in the I/O queue

Questão 184

Questão
Every address generated by the CPU is divided into two parts:
Responda
  • page number + page offset
  • Другого варианта нет

Questão 185

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

Questão 186

Questão
Trace of the process is: (из книги)
Responda
  • List of files that are opened
  • List of interactions of the process with other process
  • List of threads of the process
  • List of instructions that are executed

Questão 187

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

Questão 188

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

Questão 189

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

Questão 190

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 191

Questão
To find a free partition this algorithm starts searching from where it left off, not from the beginning (из книги)
Responda
  • Worst fit
  • Next fit
  • Best fit
  • First fit

Questão 192

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

Questão 193

Questão
If a page number is not found in the TLB, then it is known as a:
Responda
  • TLB miss
  • buffer miss
  • TLB ht
  • page fault

Questão 194

Questão
Mutual exclusion can be provided by the:
Responda
  • binary semaphores
  • none of the above
  • both
  • mutex locks

Questão 195

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 196

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

Questão 197

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

Questão 198

Questão
In segmentation, each address is specified by (choose two):
Responda
  • a segment number
  • an offset
  • a value
  • a key

Questão 199

Questão
Which is the ready state of a process?
Responda
  • when process is using the CPU
  • when process is scheduled to run after some execution
  • when process is unable to run until some task has been completed
  • none of the above

Questão 200

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

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