Copiar y Editar

OS Part 2

Descripción

Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Test sobre OS Part 2, creado por Good Guy Beket el 18/12/2017.
Good Guy Beket
Test por Good Guy Beket, actualizado hace más de 1 año Más Menos
Creado por un usuario eliminado hace más de 6 años
Good Guy Beket
Copiado por Good Guy Beket hace más de 6 años
690
18
0

Resumen del Recurso

Pregunta 1

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

Pregunta 2

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

Pregunta 3

Pregunta
What is the ready state of a process?
Respuesta
  • when process is scheduled to run after some execution
  • none of the above
  • when process is using CPU
  • when process is unable to run until some task has been completed

Pregunta 4

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

Pregunta 5

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

Pregunta 6

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

Pregunta 7

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

Pregunta 8

Pregunta
Part of a program where the shared memory is accessed and which should be executed invisibly, is called:
Respuesta
  • semaphores
  • mutual exclusion
  • critical section
  • directory

Pregunta 9

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 10

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

Pregunta 11

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

Pregunta 12

Pregunta
The number of resources requested be a process:
Respuesta
  • must exceed 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 always be less than the total number of resources available in the system

Pregunta 13

Pregunta
What is interprocess communication?
Respuesta
  • communication between two process
  • communication between two threads of same process
  • none of the above
  • communication within the process

Pregunta 14

Pregunta
The degree of multi-programming is:
Respuesta
  • the number of processes executed per unit time
  • the number of processes in the I/O queue
  • the number of processes in the ready queue
  • the number of processes in memory

Pregunta 15

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

Pregunta 16

Pregunta
To avoid the race condition, the number of processes that may be simultaneously inside their critical section is:
Respuesta
  • 10
  • 0
  • 1
  • 2

Pregunta 17

Pregunta
Which process can be affected by other processes executing in the system?
Respuesta
  • init process
  • cooperating process
  • child process
  • parent process

Pregunta 18

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 19

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 20

Pregunta
The main disadvantage of this technique: consumes a lot of processor time, because every word
Respuesta
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Pregunta 21

Pregunta
The processor issues an I/O command to a module and then go on to some other useful work. 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. The described technique is:
Respuesta
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Pregunta 22

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 23

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 24

Pregunta
We have 
Ts = average (system) access time
 T1 = access time of M1 (cache) 
T2 = access time of M2 (main memory) 
T3 = access time of M3 (disk) 
H1 = hit ratio, fraction of time reference is found i M1 
H2 = hit ratio, fraction of time reference is found i M2 
The average time to access an item, in case the item in disk is:
Respuesta
  • Ts = H1*T1 + H2*T2 + (1-H2)*T3
  • Ts = H1*T1 + (1-H1)*(H1*T1 + H2*(T1 + T2) + (1 - H2)*(T2 + T3))
  • Ts = H1*T1 + (1-H1)*H2*(T2 + T3)
  • Ts = H1*T1 + (1-H1)*(H2*(T1 + T2) + (1 - H2)*(T1 + T2 + T3))

Pregunta 25

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 26

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

Pregunta 27

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

Pregunta 28

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

Pregunta 29

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

Pregunta 30

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 31

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 32

Pregunta
This 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 33

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. The module transfers the entire block of data to/from memory without going through the processor. The described technique is:
Respuesta
  • Direct memory access (DMA)
  • Manual memory access
  • Interrupt-driven I/O
  • Programmed I/O

Pregunta 34

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

Pregunta 35

Pregunta
The processor is executing "Load AC from memory" instruction. Choose the correct micro-instruction:
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 36

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 37

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 38

Pregunta
User-visible registers minimize main memory references by optimizing register use
Respuesta
  • True
  • False

Pregunta 39

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 40

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 41

Pregunta
The main disadvantages 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 42

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 43

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

Pregunta 44

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

Pregunta 45

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 46

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

Pregunta 47

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

Pregunta 48

Pregunta
In operation 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 49

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

Pregunta 50

Pregunta
The limit register
Respuesta
  • Defines the size of the region of memory occupied by the process (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 51

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

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

Pregunta 53

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

Pregunta 54

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

Pregunta 55

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
  • Synchronous exclusion
  • Critical exclusion
  • Asynchronous exclusion
  • Mutual exclusion

Pregunta 56

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 57

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 58

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 59

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

Pregunta 60

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 61

Pregunta
What is not a structural element of a computer system?
Respuesta
  • System bus
  • Main memory
  • Operating system
  • Processor

Pregunta 62

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 63

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

Pregunta 64

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 65

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

Pregunta 66

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 67

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

Pregunta 68

Pregunta
We have Ts = average (system) access time
 T1 = access time of M1 (cache)
 T2 = access time of M2 (main memory)
 T3 = access time of M3 (disk)
 H1 = hit ratio, fraction of time reference is found i M1
 H2 = hit ratio, fraction of time reference is found i M2
 The average time to access an item, in case the item in main memory is:
Respuesta
  • Ts = H1*T1 + H2*T2 + (1-H2)*T3
  • Ts = H1*T1 + (1-H1)*(H1*T1 + H2*(T1 + T2) + (1 - H2)*(T2 + T3))
  • Ts = H1*T1 + (1-H1)*(T1+T2)
  • Ts = H1*T1 + (1-H1)*(H2*(T1 + T2) + (1 - H2)*(T1 + T2 + T3))

Pregunta 69

Pregunta
Control and status registers control the operation of the processor and the execution of programs
Respuesta
  • True
  • False

Pregunta 70

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 71

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

Pregunta 72

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 73

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

Pregunta 74

Pregunta
'More than one program attempts to make use of a shared resource at the same time'. This is
Respuesta
  • Failed mutual exclusion
  • Improper synchronization
  • Deadlocks
  • Nondeterminate program operation

Pregunta 75

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

Pregunta 76

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

Pregunta 77

Pregunta
"When program shares memory and their execution is interleaved by the processor, they may interfere with each other by overwriting common memory areas in unpredictable ways. The result of a particular program depend on the activities of other programs in shared systems". This is:
Respuesta
  • Falled mutual exclusions
  • Deadlocks
  • Nondeterminate program operation
  • Improper synchronisation

Pregunta 78

Pregunta
The state of a processor is defined by:
Respuesta
  • the activity just executed by the process
  • the current activity of the process
  • the final activity of the process
  • the activity to next be executed by the process

Pregunta 79

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

Pregunta 80

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

Pregunta 81

Pregunta
We have Ts = average (system) access time T1 = access time of M1 (cache)
 T2 = access time of M2 (main memory) T3 = access time of M3 (disk)
 H1 = hit ratio, fraction of time reference is found i M1
 H2 = hit ratio, fraction of time reference is found i M2
 The average time to access an item, in case the item in cache is:
Respuesta
  • Ts = H1*T1 + H2*T2 + (1-H2)*T3
  • Ts = H1*T1 + (1-H1)*(H1*T1 + H2*(T1 + T2) + (1 - H2)*(T2 + T3))
  • Ts = H1*T1
  • Ts = H1*T1 + (1-H1)*(H2*(T1 + T2) + (1 - H2)*(T1 + T2 + T3))

Pregunta 82

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

Pregunta 83

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 84

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

Pregunta 85

Pregunta
Batch operating system were used
Respuesta
  • From the late 1940s to the mid-1950s
  • From the mid-1950 to early 1960s
  • In early 1960s

Pregunta 86

Pregunta
"More than one programs hung up waiting for each other". This is
Respuesta
  • Failed mutual exclusions
  • Deadlocks
  • Nondeterminate program operation
  • Improper synchronization

Pregunta 87

Pregunta
This contains the most frequently used functions in the OS:
Respuesta
  • Centre
  • Base
  • Root
  • Kernel

Pregunta 88

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

Pregunta 89

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

Pregunta 90

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

Pregunta 91

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 92

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

Pregunta 93

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 94

Pregunta
Choose the storage management responsibility for "Programmers should be able to define programs 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 95

Pregunta
'Lost signals, duplicate signals received'. This is
Respuesta
  • Improper synchronization
  • Nondeterminate program operation
  • Deadlocks
  • Failed mutual exclusion
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