Copiar y Editar

os

Descripción

Operating Systems (OS) Test sobre os, creado por Csse 1502 el 17/12/2017.
Csse 1502
Test por Csse 1502, actualizado hace más de 1 año
Csse 1502
Creado por Csse 1502 hace más de 6 años
1528
14
0

Resumen del Recurso

Pregunta 1

Pregunta
What is not a main structural element of a computer system?
Respuesta
  • Processor
  • Main Memory
  • I/O Modules
  • System Bus
  • Operating system

Pregunta 2

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

Pregunta 3

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

Pregunta 4

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

Pregunta 5

Pregunta
Which of the following element of a computer system stores data and programs?
Respuesta
  • Main memory
  • System bus
  • Processor
  • I/O modules

Pregunta 6

Pregunta
Which of the following provides for communication among elements of a computer system?
Respuesta
  • Main memory
  • System bus
  • Processor
  • I/O modules

Pregunta 7

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

Pregunta 8

Pregunta
The processor contains a single data register, called
Respuesta
  • PSW
  • PC
  • IR
  • AC

Pregunta 9

Pregunta
This register specifies a particular input/output device
Respuesta
  • Memory address register
  • I/OAR
  • Memory buffer register
  • I/OBR

Pregunta 10

Pregunta
This register is used for the exchange of data between an I/O module and the processor
Respuesta
  • Memory address register
  • I/OAR
  • Memory buffer register
  • I/OBR

Pregunta 11

Pregunta
This register contains the data to be written into memory or which receives the data read from memory
Respuesta
  • I/OAR
  • memory buffer register
  • memory address register
  • I/OBR

Pregunta 12

Pregunta
This register specifies the location in memory for the next read or write
Respuesta
  • Memory address register
  • I/OAR
  • Memory buffer register
  • I/OBR

Pregunta 13

Pregunta
Index register, segment register, and stack register are example of:
Respuesta
  • Address register
  • Data registers
  • Control registers
  • Status registers

Pregunta 14

Pregunta
Which register contains the address of the next instruction to be fetched?
Respuesta
  • instruction register
  • execution register
  • program counter
  • process counter

Pregunta 15

Pregunta
Which register contains the instruction most recently fetched?
Respuesta
  • instruction register
  • execution register
  • program counter
  • process counter

Pregunta 16

Pregunta
Which register contains condition codes set by the processor hardware as the result of operations?
Respuesta
  • Program counter
  • Accumulator
  • Program status word
  • Stack pointer

Pregunta 17

Pregunta
The fetched instruction is loaded into the
Respuesta
  • IR
  • Accumulator
  • Memory
  • PC

Pregunta 18

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

Pregunta 19

Pregunta
The processor is executing ‘Load AC from memory’ instruction. Choose the correct micro-instructions:
Respuesta
  • 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

Pregunta 20

Pregunta
When an I/O device completes an I/O operation, the device issues an interrupt signal to the processor and then:
Respuesta
  • 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

Pregunta 21

Pregunta
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:
Respuesta
  • Fast I/O wait
  • Slow I/O wait
  • Long I/O wait
  • Short I/O wait

Pregunta 22

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

Pregunta 23

Pregunta
Most I/O devices are:
Respuesta
  • much slower than the processor
  • much faster than the processor
  • much shorter than the processor
  • much longer than the processor

Pregunta 24

Pregunta
If there no interrupts, after each write operation, the processor must
Respuesta
  • 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

Pregunta 25

Pregunta
Complete the relationship concerning the memory systems: faster access time –
Respuesta
  • lower capacity
  • greater cost per bit
  • faster access speed
  • smaller cost per bit

Pregunta 26

Pregunta
Complete the relationship concerning the memory systems: greater capacity –
Respuesta
  • lower capacity
  • greater cost per bit
  • faster access speed
  • smaller cost per bit

Pregunta 27

Pregunta
Complete the relationship concerning the memory systems: greater capacity –
Respuesta
  • lower capacity
  • slower access time
  • greater cost per bit
  • faster access speed

Pregunta 28

Pregunta
The smaller, more expensive, faster memory is:
Respuesta
  • Disk drive
  • Cache
  • Main memory
  • Register

Pregunta 29

Pregunta
If the accessed word is found in the faster memory, that is defined as a:
Respuesta
  • bingo
  • win
  • hit
  • evrika

Pregunta 30

Pregunta
If the accessed word is not found in the faster memory, that is defined as a:
Respuesta
  • ricochet
  • miss
  • zero
  • Loss

Pregunta 31

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

Pregunta 32

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

Pregunta 33

Pregunta
The concept of modes of operation (user mode, system mode) was introduced with
Respuesta
  • Time-sharing-system
  • Simple batch system
  • Multiprogrammed batch system
  • Serial processing

Pregunta 34

Pregunta
'Ease of evolution of an OS' corresponds to the following objective:
Respuesta
  • Efficiency
  • Convenience
  • Ability to evolve

Pregunta 35

Pregunta
The principal objective of the time-sharing system is to
Respuesta
  • Minimize response time
  • Minimize processor utilization
  • Maximize response time
  • Maximize processor utilization

Pregunta 36

Pregunta
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
Respuesta
  • Multiprogramming or multitasking batch system
  • Simple batch system
  • Serial processing
  • Time-sharing-system

Pregunta 37

Pregunta
The programmer interacted directly with the computer hardware with
Respuesta
  • Simple batch systems
  • Serial processing
  • Time-sharing-systems
  • Multiprogrammed batch systems

Pregunta 38

Pregunta
Semaphore is a/an_to solve the critical section problem?
Respuesta
  • integer variable
  • special program for a system
  • complex structure
  • hardware for a system

Pregunta 39

Pregunta
'The OS as a resource manager' corresponds to the following objective:
Respuesta
  • Efficiency
  • Convenience
  • Ability to evolve

Pregunta 40

Pregunta
An un-interruptible unit is known as:
Respuesta
  • atomic
  • none of the above
  • static
  • single

Pregunta 41

Pregunta
A state is safe, if:
Respuesta
  • 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

Pregunta 42

Pregunta
'The OS as a User/Computer interface' corresponds to the following objective:
Respuesta
  • Efficiency
  • Convenience
  • Ability to evolve

Pregunta 43

Pregunta
This type of memory is nonvolatile
Respuesta
  • Secondary memory
  • Main memory
  • Register
  • Cache

Pregunta 44

Pregunta
An application programs is developed by the
Respuesta
  • Application programmer
  • End user
  • Operating system
  • Hardware

Pregunta 45

Pregunta
When a processor attempts to read a byte or word of memory, it firstly checks the:
Respuesta
  • Secondary memory
  • Register
  • Cache
  • Main memory

Pregunta 46

Pregunta
The end user views a computer system in terms of
Respuesta
  • a set of applications
  • a set of machine instructions
  • utilities
  • a set of system programs

Pregunta 47

Pregunta
The serial processing presented two main problems:
Respuesta
  • setup time
  • using a monitor
  • time slicing
  • multiprogramming
  • scheduling

Pregunta 48

Pregunta
The hardware and software used in providing applications to a user can be viewed in a:
Respuesta
  • layered fashion
  • classified fashion
  • sandwich fashion
  • leveled fashion

Pregunta 49

Pregunta
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:
Respuesta
  • data consistency
  • mutual exclusion
  • race condition
  • starvation

Pregunta 50

Pregunta
This contains the most frequently used functions in the OS:
Respuesta
  • Kernel (или nucleus)
  • Centre
  • Base
  • Root

Pregunta 51

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

Pregunta 52

Pregunta
Utilities are
Respuesta
  • Application program
  • System programs
  • Opcodes
  • Processor registers

Pregunta 53

Pregunta
Block size is:
Respuesta
  • 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)

Pregunta 54

Pregunta
There were no OS with
Respuesta
  • Simple batch systems
  • Serial processing
  • Time-sharing-systems
  • Multiprogrammed batch systems

Pregunta 55

Pregunta
Which of the following cannot be interrupted?
Respuesta
  • Process
  • Thread
  • Module
  • Atomic operation

Pregunta 56

Pregunta
Process is
Respuesta
  • 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

Pregunta 57

Pregunta
This determines which cache location the block will occupy: [blank_start]Mapping function[blank_end]
Respuesta
  • Mapping function

Pregunta 58

Pregunta
This resource can be created and destroyed
Respuesta
  • resumable resource
  • restartable resource
  • consumable resource
  • finite resource

Pregunta 59

Pregunta
This system handles multiple interactive jobs
Respuesta
  • Time-sharing-system
  • Simple batch system
  • Serial processing
  • Multiprogrammed batch system

Pregunta 60

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

Pregunta 61

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

Pregunta 62

Pregunta
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
Respuesta
  • replacement algorithm
  • write policy
  • cache size
  • locality of reference

Pregunta 63

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

Pregunta 64

Pregunta
A task in a blocked state
Respuesta
  • is waiting for same temporarily unavailable resources
  • must still be placed in the run queues
  • is executable
  • is running

Pregunta 65

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

Pregunta 66

Pregunta
This resource can be safely used by only one process at a time and is not depleted by that use
Respuesta
  • refurbished resource
  • replenishing resource
  • reusable resource
  • refreshing resource

Pregunta 67

Pregunta
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:
Respuesta
  • write policy
  • mapping function
  • locality of reference
  • replacement algorithm

Pregunta 68

Pregunta
'Lost signals, duplicate signals received'. This is
Respuesta
  • Improper synchronization
  • Nondeterminate program operation
  • Failed mutual exclusion
  • Deadlocks

Pregunta 69

Pregunta
The systems which allows only one process execution at a time, are called
Respuesta
  • uniprogramming systems
  • unitasking systems
  • uniprocessing systems
  • unicasting systems

Pregunta 70

Pregunta
Deadlock inevitable region can be referred to as a
Respuesta
  • fun region
  • fatal region
  • final region
  • false region

Pregunta 71

Pregunta
In the non-blocking send, non-blocking receive:
Respuesta
  • 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

Pregunta 72

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

Pregunta 73

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

Pregunta 74

Pregunta
This illustrates the progress of two processes competing for two resources
Respuesta
  • joint process diagram
  • joint ingres diagram
  • joint regress diagram
  • joint progress diagram

Pregunta 75

Pregunta
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.
Respuesta
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Pregunta 76

Pregunta
A monitor is a type of:
Respuesta
  • deadlock
  • low level synchronization construct
  • high level synchronization construct
  • none of the above

Pregunta 77

Pregunta
The state of a process is defined by:
Respuesta
  • 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

Pregunta 78

Pregunta
'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
Respuesta
  • Falled mutual exclusions
  • Deadlocks
  • Nondeterminate program operation
  • Improper syncronization

Pregunta 79

Pregunta
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.
Respuesta
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Pregunta 80

Pregunta
When each process in the set is blocked awaiting for resource siezed by another blocked process
Respuesta
  • it is a deadend
  • it is a deadlock
  • it is a softlock
  • it is a mortallock

Pregunta 81

Pregunta
Which of the following is not the state of a process?
Respuesta
  • Old
  • terminated
  • running
  • new
  • ready

Pregunta 82

Pregunta
The described technique is:
Respuesta
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Pregunta 83

Pregunta
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"
Respuesta
  • Long-term storage
  • Protection and access control
  • Automatic allocation and management
  • Process isolation
  • Support of modular programming

Pregunta 84

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

Pregunta 85

Pregunta
Which of the following statements is false:
Respuesta
  • 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

Pregunta 86

Pregunta
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"
Respuesta
  • Protection and access control
  • Long-term storage
  • Automatic allocation and management
  • Process isolation
  • Support of modular programming

Pregunta 87

Pregunta
Which of the following state transitions is not possible?
Respuesta
  • blocked to running
  • running to blocked
  • blocked to ready
  • ready to running

Pregunta 88

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

Pregunta 89

Pregunta
Memory is:
Respuesta
  • 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

Pregunta 90

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

Pregunta 91

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

Pregunta 92

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

Pregunta 93

Pregunta
Processor is:
Respuesta
  • 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

Pregunta 94

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

Pregunta 95

Pregunta
Interprocess communication:
Respuesta
  • 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

Pregunta 96

Pregunta
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
Respuesta
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Pregunta 97

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

Pregunta 98

Pregunta
Program is:
Respuesta
  • 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

Pregunta 99

Pregunta
A sequence of instructions, in a computer language, to get the desired result, is known as?
Respuesta
  • program
  • process
  • instruction
  • algorithm

Pregunta 100

Pregunta
In operating system security and protection, authenticity:
Respuesta
  • 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

Pregunta 101

Pregunta
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
Respuesta
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Pregunta 102

Pregunta
In operating system, each process has its own:
Respuesta
  • all of the mentioned
  • address space and global variables
  • set of data
  • program code

Pregunta 103

Pregunta
The memory allocation scheme subject to "external" fragmentation is?
Respuesta
  • segmentation
  • swapping
  • multiple contiguous fixed partitionings
  • pure demand paging

Pregunta 104

Pregunta
In operating system security and protection, availability is:
Respuesta
  • 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

Pregunta 105

Pregunta
For each process OS creates and manages:
Respuesta
  • Process control block
  • Program code
  • Program
  • Thread control block

Pregunta 106

Pregunta
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.
Respuesta
  • Interrupt-driven I/O
  • Programmed I/O
  • Manual memory access
  • Direct memory access (DMA)

Pregunta 107

Pregunta
The memory allocation scheme subject to "internal" fragmentation is?
Respuesta
  • segmentation
  • swapping
  • multiple contiguous fixed partitionings
  • pure demand paging

Pregunta 108

Pregunta
In operating system security and protection, confidentiality is:
Respuesta
  • 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

Pregunta 109

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

Pregunta 110

Pregunta
The available vector defines
Respuesta
  • 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

Pregunta 111

Pregunta
Any program, no matter how small, will occupy an entire partition results in?
Respuesta
  • internal fragmentation
  • segmentation
  • paging
  • external fragmentation

Pregunta 112

Pregunta
In operating system security and protection, data integrity is:
Respuesta
  • 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

Pregunta 113

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

Pregunta 114

Pregunta
A binary semaphore is a semaphore with integer values:
Respuesta
  • 1
  • 0,5
  • 0
  • -1

Pregunta 115

Pregunta
The resource vector define
Respuesta
  • 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

Pregunta 116

Pregunta
A hardcopy sign-up sheet was used to reserve computer time with
Respuesta
  • Time slicing
  • Time sliding
  • Time scheduling
  • Time allocating

Pregunta 117

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

Pregunta 118

Pregunta
This matrix defines the current allocation to process i of the resource j
Respuesta
  • Allocation matrix
  • Resource matrix
  • Request matrix
  • Claim matrix

Pregunta 119

Pregunta
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
Respuesta
  • Time scheduling
  • Time sliding
  • Time slicing
  • Time allocating

Pregunta 120

Pregunta
The base register
Respuesta
  • 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

Pregunta 121

Pregunta
The two atomic operations permissible on semaphores are:
Respuesta
  • hold
  • stop
  • signal
  • wait

Pregunta 122

Pregunta
This matrix defines the amount of resources of type j requested by process i
Respuesta
  • Request matrix
  • Allocation matrix
  • Resource matrix
  • Claim matrix

Pregunta 123

Pregunta
How to solve problem of equal-size partitions? swapping (?) ----- page 318 book
Respuesta
  • swapping (?) ----- page 318 book unequal-size partitions
  • segmentation
  • compaction
  • virtual memory segmentation

Pregunta 124

Pregunta
The limit register
Respuesta
  • 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

Pregunta 125

Pregunta
Batch operating systems were used (years)
Respuesta
  • From the late 1940s to the mid-1950s
  • From the mid-1950 to early 1960s
  • In early 1960s

Pregunta 126

Pregunta
This matrix defines requirements of processes i for the resources j
Respuesta
  • Claim matrix
  • Allocation matrix
  • Resource matrix
  • Request matrix

Pregunta 127

Pregunta
How to solve problem of "external" fragmentation?
Respuesta
  • compaction
  • larger memory space
  • smaller memory space
  • none of these

Pregunta 128

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

Pregunta 129

Pregunta
The banker's algorithm is referred to as
Respuesta
  • resource allocation denial
  • denial of service
  • loan allocation denial
  • resource allocation refusal

Pregunta 130

Pregunta
A page fault?
Respuesta
  • 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

Pregunta 131

Pregunta
Job control language was used
Respuesta
  • 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

Pregunta 132

Pregunta
The process index register
Respuesta
  • 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

Pregunta 133

Pregunta
Which of the following condition is required for deadlock to be possible
Respuesta
  • 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

Pregunta 134

Pregunta
'Hold and wait' condition for deadlock is defined as
Respuesta
  • 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

Pregunta 135

Pregunta
Serial processing was used
Respuesta
  • In early 1960s
  • From late 1940s to the mid-1950s
  • From the mid-1950s to early 1960s

Pregunta 136

Pregunta
This term was first used by the designers of Multics in the 1960s
Respuesta
  • Monitor
  • Process
  • Multiprogramming
  • Time sharing

Pregunta 137

Pregunta
Which of the following statements is false?
Respuesta
  • 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

Pregunta 138

Pregunta
Banker’s algorithm for resource allocation deals with:
Respuesta
  • deadlock recovery
  • deadlock prevention
  • mutual exclusion
  • deadlock avoidance

Pregunta 139

Pregunta
'Circular wait' condition for deadlock is defined as
Respuesta
  • 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

Pregunta 140

Pregunta
'Ease of evolution of an OS' corresponds to the following objective:
Respuesta
  • Efficiency
  • Convenience
  • Ability to evolve

Pregunta 141

Pregunta
Swapping
Respuesta
  • 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

Pregunta 142

Pregunta
'No preemption' condition for deadlock is defined as
Respuesta
  • 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

Pregunta 143

Pregunta
A system is in the safe state if:
Respuesta
  • 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

Pregunta 144

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

Pregunta 145

Pregunta
Which of the following is not true about the memory management?
Respuesta
  • 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

Pregunta 146

Pregunta
True or false: segmentation suffers from external fragmentation?
Respuesta
  • True
  • False

Pregunta 147

Pregunta
'Mutual exclusion' condition for deadlock is defined as
Respuesta
  • 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

Pregunta 148

Pregunta
True or false: paging suffers from external fragmentation?
Respuesta
  • True
  • False

Pregunta 149

Pregunta
What is NOT an example of consumable resource?
Respuesta
  • Main memory
  • Information in I\O buffers
  • Signals
  • Messages

Pregunta 150

Pregunta
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?
Respuesta
  • virtual memory
  • segmentation
  • paging
  • partition

Pregunta 151

Pregunta
What is NOT an example of reusable resource?
Respuesta
  • interrupt
  • semaphores
  • processors
  • i/o channels

Pregunta 152

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

Pregunta 153

Pregunta
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].
Respuesta
  • to fetch the instruction
  • to fetch operands
  • store results

Pregunta 154

Pregunta
Operating System maintains the page table for:
Respuesta
  • each process
  • each thread
  • each instruction
  • each address

Pregunta 155

Pregunta
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?
Respuesta
  • Multitasking
  • Semaphore
  • Mutual exclusion
  • multiprogramming

Pregunta 156

Pregunta
In contiguous memory allocation:
Respuesta
  • 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

Pregunta 157

Pregunta
CPU fetches the instruction from memory according to the value of?
Respuesta
  • status register
  • program counter
  • instruction register
  • program status word

Pregunta 158

Pregunta
When memory is divided into several fixed sized partitions, each partition may contain ________.
Respuesta
  • exactly one process
  • none of the above
  • at least one process
  • multiple processes at once

Pregunta 159

Pregunta
The number of resources requested by a process:
Respuesta
  • 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

Pregunta 160

Pregunta
A memory used to provide a high speed is called?
Respuesta
  • cache
  • main memory
  • disk buffer
  • stack pointer

Pregunta 161

Pregunta
In fixed sized partition, the degree of multiprogramming is bounded by ___________.
Respuesta
  • the memory size
  • all of the above
  • the number of partitions
  • the CPU utilization

Pregunta 162

Pregunta
Which one of the following is the address generated by CPU?
Respuesta
  • logical address
  • physical address
  • absolute address
  • none of the above

Pregunta 163

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

Pregunta 164

Pregunta
The first fit, best fit and worst fit are strategies to select a ______.
Respuesta
  • 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

Pregunta 165

Pregunta
Runtime mapping from virtual to physical address is done by?
Respuesta
  • CPU
  • none of the above
  • memory management unit
  • PCI

Pregunta 166

Pregunta
In internal fragmentation, memory is internal to a partition and:
Respuesta
  • is not being used
  • none of the above
  • is always used
  • is being used

Pregunta 167

Pregunta
Which of the following is not one of the principles of dealing with deadlock?
Respuesta
  • Initialization
  • Avoidance
  • Detection
  • Prevention

Pregunta 168

Pregunta
The address of a page table in memory is pointed by:
Respuesta
  • page table base register
  • stack pointer
  • page register
  • program counter

Pregunta 169

Pregunta
A solution to the problem of external fragmentation is:
Respuesta
  • compaction
  • larger memory size
  • unequal size parts
  • smaller memory space

Pregunta 170

Pregunta
The Process Control Block is:
Respuesta
  • a secondary storage section
  • Process type variable
  • Data Structure
  • Block in memory

Pregunta 171

Pregunta
Program always deals with:
Respuesta
  • logical address
  • physical address
  • relative address
  • absolute address

Pregunta 172

Pregunta
__________ is generally faster than _________ .
Respuesta
  • worst fit, best fit
  • best fit, first fit
  • first fit, best fit
  • none of the above

Pregunta 173

Pregunta
Which one of the following is a synchronization tool?
Respuesta
  • socket
  • thread
  • pipe
  • semaphore

Pregunta 174

Pregunta
External fragmentation exists when:
Respuesta
  • 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

Pregunta 175

Pregunta
What is compaction?
Respuesta
  • a paging technique
  • a technique for overcoming fatal error
  • a technique for overcoming internal fragmentation
  • a technique for overcoming external fragmentation

Pregunta 176

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

Pregunta 177

Pregunta
External fragmentation will not occur when:
Respuesta
  • no matter which algorithm is used, it will always occur
  • first fit is used
  • best fit is used
  • next fit is used

Pregunta 178

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

Pregunta 179

Pregunta
In the non-blocking send:
Respuesta
  • 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

Pregunta 180

Pregunta
Main memory is broken into fixed-sized blocks called ________.:
Respuesta
  • none of the above
  • pages
  • frames
  • segments

Pregunta 181

Pregunta
Fixed-length block of data in secondary memory is called ________.:
Respuesta
  • none of the above
  • frames
  • segments
  • pages

Pregunta 182

Pregunta
Variable-length block of data that resides in secondary memory is called ________.
Respuesta
  • none of the above
  • frames
  • segments
  • pages

Pregunta 183

Pregunta
The degree of multi-programming is:
Respuesta
  • 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

Pregunta 184

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

Pregunta 185

Pregunta
The __________ is used as an index into the page table.
Respuesta
  • page number
  • page offset
  • frame bit
  • frame offset

Pregunta 186

Pregunta
Trace of the process is: (из книги)
Respuesta
  • 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

Pregunta 187

Pregunta
The _____ table contains the base address of each page in physical memory.
Respuesta
  • process
  • memory
  • page
  • frame

Pregunta 188

Pregunta
With paging there is no ________ fragmentation.
Respuesta
  • either type of
  • none of the above
  • external
  • internal

Pregunta 189

Pregunta
A set of processes is deadlock if:
Respuesta
  • 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

Pregunta 190

Pregunta
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.
Respuesta
  • memory
  • page
  • frame
  • segment

Pregunta 191

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

Pregunta 192

Pregunta
For every process there is a __________.
Respuesta
  • pointer to page table
  • copy of page table
  • frame table
  • page table

Pregunta 193

Pregunta
If a page number is not found in the TLB, then it is known as a:
Respuesta
  • TLB miss
  • buffer miss
  • TLB ht
  • page fault

Pregunta 194

Pregunta
Mutual exclusion can be provided by the:
Respuesta
  • binary semaphores
  • none of the above
  • both
  • mutex locks

Pregunta 195

Pregunta
If a page table entry is present in the TLB, then it is known as a:
Respuesta
  • buffer miss
  • TLB miss
  • page fault
  • TLB hit

Pregunta 196

Pregunta
If a page table entry is not in main memory, then it is known as a:
Respuesta
  • page fault
  • buffer miss
  • TLB hit
  • TLB miss

Pregunta 197

Pregunta
What is a medium-term scheduler?
Respuesta
  • 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

Pregunta 198

Pregunta
In segmentation, each address is specified by (choose two):
Respuesta
  • a segment number
  • an offset
  • a value
  • a key

Pregunta 199

Pregunta
Which is the ready state of a process?
Respuesta
  • 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

Pregunta 200

Pregunta
Which one of the following is the deadlock avoidance algorithm?
Respuesta
  • round-robin algorithm
  • elevator algorithm
  • banker’s algorithm
  • dinning philosophers problem
Mostrar resumen completo Ocultar resumen completo

¿Quieres crear tus propios Tests gratis con GoConqr? Más información.

Similar

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
Explorar la Librería