Quiz
OS Part 2
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (95)
1A 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:
- Arace condition
- Bdata consistency
- Cstarvation
- Dmutual exclusion
2Which one of the following is the address generated by CPU?
- Alogical address
- Bphysical address
- Cabsolute address
- Dnone of the above
3What is the ready state of a process?
- Awhen process is scheduled to run after some execution
- Bnone of the above
- Cwhen process is using CPU
- Dwhen process is unable to run until some task has been completed
4Mutual exclusion can be provided by the:
- Anone of the above maint
- Bmutex locks
- Cboth
- Dbinary semaphores
5What is a long-term scheduler?
- Ait selects which process has to be executed next and allocates CPU
- Bnone of the above
- Cit selects which process has to be brought into the ready queue
- Dit selects which process has to remove from memory by swapping
6Operating system maintains the page table for
- Aeach process
- Beach thread
- Ceach instruction
- Deach address
7If a page number is not found in the TLB, then it is known as a:
- ATLB miss
- Bbuffer miss
- CTLB hit
- Dpage fault
8Part of a program where the shared memory is accessed and which should be executed invisibly, is called:
- Asemaphores
- Bmutual exclusion
- Ccritical section
- Ddirectory
9In memory systems, boundary registers?
- Atrack the beginning and ending of programs
- Btrack page boundaries
- Care only necessary with fixed partitions
- Dare used for temporary program variable storage
10The resource vector defines
- Atotal amount of resources required for all processes
- Btotal amount of each resource in the system
- Ctotal amount of each resource allocated to all processes
- Dtotal amount of each resource NOT allocated to any process
11When each process in the set is blocked awaiting for resource seized by another blocked process
- Ait is a deadend
- Bit is a deadlock
- Cit is a softlock
- Dit is a mortallock
12The number of resources requested be a process:
- Amust exceed the total number of resources available in the system
- Bmust always be equal to the total number of resources available in the system
- Cmust not exceed the total number of resources available in the system
- Dmust always be less than the total number of resources available in the system
13What is interprocess communication?
- Acommunication between two process
- Bcommunication between two threads of same process
- Cnone of the above
- Dcommunication within the process
14The degree of multi-programming is:
- Athe number of processes executed per unit time
- Bthe number of processes in the I/O queue
- Cthe number of processes in the ready queue
- Dthe number of processes in memory
15This matrix defines the amount of resources of type j requested by process i
- AAllocation matrix
- BResource matrix
- CRequest matrix
- DClaim matrix
16To avoid the race condition, the number of processes that may be simultaneously inside their critical section is:
- A10
- B0
- C1
- D2
17Which process can be affected by other processes executing in the system?
- Ainit process
- Bcooperating process
- Cchild process
- Dparent process
18Which of the following registers are used by the processor to exchange data with memory?
- AMAR and MBR
- BPC and IR
- CProgram status word
- DI/OAR and I/OBR
19Which of the following registers are used by the processor to exchange data with input/output module?
- AMAR and MBR
- BPC and IR
- CProgram status word
- DI/OAR and I/OBR
20The main disadvantage of this technique: consumes a lot of processor time, because every word
- ADirect memory access (DMA)
- BManual memory access
- CInterrupt-driven I/O
- DProgrammed I/O
21The 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:
- ADirect memory access (DMA)
- BManual memory access
- CInterrupt-driven I/O
- DProgrammed I/O
22Which of the following is not a technique possible for I/O operations?
- ADirect memory access (DMA)
- BManual memory access
- CInterrupt-driven I/O
- DProgrammed I/O
23If a page table entry is not in main memory, then it is known as a:
- Apage fault
- Bbuffer miss
- CTLB hit
- DTLB miss
24We 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:- ATs = H1*T1 + H2*T2 + (1-H2)*T3
- BTs = H1*T1 + (1-H1)*(H1*T1 + H2*(T1 + T2) + (1 - H2)*(T2 + T3))
- CTs = H1*T1 + (1-H1)*H2*(T2 + T3)
- DTs = H1*T1 + (1-H1)*(H2*(T1 + T2) + (1 - H2)*(T1 + T2 + T3))
25This 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:
- Areplacement algorithm
- Bwrite policy
- Ccache size
- Dlocality of reference
26If the accessed word is found in the faster memory, that is defined as a:
- Abingo
- Bwin
- Chit
- Devrika
27If the accessed word is not found in the faster memory, that is defined as a:
- Aricochet
- Bmiss
- Czero
- Dloss
28The processor contains a single data register, called
- APSW
- BPC
- CIR
- DAC
29Which register contains the instruction most recently fetched?
- Ainstruction register
- Bexecution register
- Cprogram counter
- Dprocess counter
30This register specifies the location in memory for the next read or write
- AMemory address register
- BI/OAR
- CMemory buffer register
- DI/OBR
31Which of the following element of a computer system moves data between the computer and its external environment?
- AMain memory
- BProcessor
- CSystem bus
- DI/O modules
32This 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
- ADirect memory access (DMA)
- BManual memory access
- CInterrupt-driven I/O
- DProgrammed I/O
33The 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:
- ADirect memory access (DMA)
- BManual memory access
- CInterrupt-driven I/O
- DProgrammed I/O
34The 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:- ADirect memory access (DMA)
- BManual memory access
- CInterrupt-driven I/O
- DProgrammed I/O
35The processor is executing "Load AC from memory" instruction. Choose the correct micro-instruction:
- APC -> MAR
M -> MBR
MBR -> AC
IR -> MAR
M -> MBR
MBR -> AC - BPC -> MBR
M -> MAR
MAR -> IR
IR -> MAR
M -> MBR
MBR -> AC - CPC -> MAR
M -> MBR
MBR -> IR
IR -> MAR
M -> MBR
MBR -> AC - DPC -> MAR
M -> MBR
MBR -> IR
IR -> MBR
M -> MAR
MAR -> AC
- APC -> MAR
36If there no interrupts, after each write operation, the processor must:
- ALoad new PC value
- BFinish execution of current instruction
- CSave the PSW and PC onto control stack
- DPause and remain idle until the I/O operation finishes
37Complete the relationship concerning the memory systems: greater capacity
- Alower capacity
- Bgreater cost per bit
- Cfaster access speed
- Dsmaller cost per bit
38User-visible registers minimize main memory references by optimizing register use
- ATrue
- BFalse
39This register contains the data to be written into memory or which receives the data read from memory
- AI/OAR
- Bmemory buffer register
- Cmemory address register
- DI/OBR
40Which of the following element of a computer system controls the operation of the computer and performs its data processing functions?
- ASystem bus
- BMain memory
- CI/O modules
- DProcessor
41The main disadvantages of this technique: there is a competition for bus usage
- AInterrupt-driven I/O
- BProgrammed I/O
- CManual memory access
- DDirect memory access (DMA)
42At the beginning of each instruction cycle, the processor fetches an instruction from the memory. The address of the instruction is held in
- AIR
- BMBR
- CMAR
- DPC
43The smaller, more expensive, faster memory is:
- ADisk drive
- BCache
- CMain memory
- DRegister
44There were no OS with
- ASimple batch systems
- BSerial processing
- CTime-sharing-systems
- DMultiprogrammed batch systems
45The principal objective of the time-sharing system is to
- AMinimize response time
- BMinimize processor utilization
- CMaximize response time
- DMaximize processor utilization
46Serial processing was used
- AIn early 1960s
- BFrom late 1940s to the mid-1950s
- CFrom the mid-1950s to early 1960s
47The programmer interacted directly with the computer hardware with
- ASimple batch systems
- BSerial processing
- CTime-sharing-systems
- DMultiprogrammed batch systems
48In operation system security and protection, availability is:
- AConcerned with the proper verification of the identity of users and the validity of messages or data
- BAssuring that users cannot read data for which access is unauthorized
- CProtection of data from unauthorized modification
- DConcerned with protecting the system against interruption
49Choose the storage management responsibility for "The OS can achieve efficiency by assigning memory to jobs only as needed"
- AProcess isolation
- BProtection and access control
- CLong-term storage
- DSupport of modular programming
- EAutomatic allocation and management
50The limit register
- ADefines the size of the region of memory occupied by the process (in bytes or words)
- BContains the index into the process list of the process currently controlling the processor
- CPoints to the next instruction in that process to be executed
- DContains the staring address of the region of memory occupied by the process
51In operating system security and protection, authenticity is:
- AConcerned with the proper verification of the identity of users and the validity of messages or data
- BAssuring that users cannot read data for which access is unauthorized
- CProtection of data from unauthorized modification
- DConcerned with protecting the system against interruption
52An application programs is developed by the
- AApplication programmer
- BEnd user
- COperating system
- DHardware
53"The OS as a User/Computer interface" corresponds to the following objective
- AEfficiency
- BConvenience
- CAbility to evolve
54Process is
- AProgram in High level language kept on disk
- BContents of main memory
- CA job in secondary memory
- DA program in execution
55If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called
- ASynchronous exclusion
- BCritical exclusion
- CAsynchronous exclusion
- DMutual exclusion
56In operating system security and protection, confidentiality is:
- AConcerned with the proper verification of the identity of users and the validity of messages or data
- BAssuring that users cannot read data for which access is unauthorized
- CProtection of data from unauthorized modification
- DConcerned with protecting the system against interruption
57In operating system security and protection, Data integrity is:
- AConcerned with the proper verification of the identity of users and the validity of messages or data
- BAssuring that users cannot read data for which access is unauthorized
- CProtection of data from unauthorized modification
- DConcerned with protecting the system against interruption
58When 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:
- AFast I/O wait
- BSlow I/O wait
- CLong I/O wait
- DShort I/O wait
59This type of memory is nonvolatile:
- ARegister
- BSecondary memory
- CCache
- DMain memory
60If 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:
- Awrite policy
- Bmapping function
- Clocality of reference
- Dreplacement algorithm
61What is not a structural element of a computer system?
- ASystem bus
- BMain memory
- COperating system
- DProcessor
62The main disadvantage of this technique: it is a time-consuming process that keeps the processor busy needlessly
- ADirect memory access (DMA)
- BManual memory access
- CInterrupt-driven I/O
- DProgrammed I/O
63Which of the following element of a computer system stores data and programs
- AMain memory
- BSystem bus
- CProcessor
- DI/O modules
64When an I/O device completes an I/O operation, the device issues an interrupt signal to the processor and then:
- AThe processor stops execution of the current instruction without finishing it and responds to the interrupt
- BThe processor loads the program counter with the entry location of the interrupt-handling routine
- CThe processor saves information needed to resume the current program at the point if interrupt
- DThe processor finishes execution of the current instruction before responding to the interrupt
65Complete the relationship concerning the memory systems: greater capacity
- Alower capacity
- Bslower access speed
- Cgreater cost per bit
- Dfaster access speed
66Which register contains condition codes set by the processor hardware as the result of operations?
- AProgram counter
- BAccumulator
- CProgram status word
- DStack pointer
67Which of the following provides for communication among elements of a computer system?
- Amain memory
- Bsystem bus
- Cprocessor
- DI/O modules
68We 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:- ATs = H1*T1 + H2*T2 + (1-H2)*T3
- BTs = H1*T1 + (1-H1)*(H1*T1 + H2*(T1 + T2) + (1 - H2)*(T2 + T3))
- CTs = H1*T1 + (1-H1)*(T1+T2)
- DTs = H1*T1 + (1-H1)*(H2*(T1 + T2) + (1 - H2)*(T1 + T2 + T3))
69Control and status registers control the operation of the processor and the execution of programs
- ATrue
- BFalse
70This type of system was developed at MIT by a group known as Project MAC for the IBM 709 in 1961
- ASerial processing
- BMultiprogrammed batch system
- CSimple batch system
- DTime-sharing-system
71The concept of codes of operation (user mode, system mode) was introduced with
- ATime-sharing-system
- BSimple batch system
- CMultiprogrammed batch system
- DSerial processing
72Short-term scheduler, or dispatcher, picks a process. Each process in the queue is given some time in turn. This strategy is called:
- ARound-robin technique
- BPrioritizing
- CCarousel technique
- DMerry-go-round technique
73Central idea in this system was the use of piece of software known as the monitor:
- ATime-sharing-system
- BSimple batch system
- CMultiprogrammed batch system
- DSerial processing
74'More than one program attempts to make use of a shared resource at the same time'. This is
- AFailed mutual exclusion
- BImproper synchronization
- CDeadlocks
- DNondeterminate program operation
75The term was first used by the designers of Multics in 1960s:
- AMonitor
- BProcess
- CMultiprogramming
- DTime sharing
76Utilities are
- AApplication program
- BSystem programs
- COpcodes
- DProcessor registers
77"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:- AFalled mutual exclusions
- BDeadlocks
- CNondeterminate program operation
- DImproper synchronisation
78The state of a processor is defined by:
- Athe activity just executed by the process
- Bthe current activity of the process
- Cthe final activity of the process
- Dthe activity to next be executed by the process
79The hardware and software used in providing applications to a user can be viewed in:
- Aclassified fashion
- Blayered fashion
- Csandwich fashion
- Dleveled fashion
80Suppose that a process is in "Blocked" state waiting for some I/O device.
When the service is completed, it goes to the:- ASuspended state
- BTerminated state
- CReady state
- DRunning state
81We 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:- ATs = H1*T1 + H2*T2 + (1-H2)*T3
- BTs = H1*T1 + (1-H1)*(H1*T1 + H2*(T1 + T2) + (1 - H2)*(T2 + T3))
- CTs = H1*T1
- DTs = H1*T1 + (1-H1)*(H2*(T1 + T2) + (1 - H2)*(T1 + T2 + T3))
82The serial processing presented two main problems:
- Asetup time
- Busing a monitor
- Ctime slicing
- Dmultiprogramming
- Escheduling
83The process index register:
- Acontains the index into a process list of the process currently controlling the processor
- Bdefine the region in memory occupied by the process
- Cpoints to the next instruction in that process to be executed
- Dcontains the starting address of the region of memory occupied by the process
84The concept of a batch operating system was developed to
- AMaximize processor utilization
- BMinimize response time
- CSupport interactive mode
- DMinimize processor utilization
85Batch operating system were used
- AFrom the late 1940s to the mid-1950s
- BFrom the mid-1950 to early 1960s
- CIn early 1960s
86"More than one programs hung up waiting for each other".
This is- AFailed mutual exclusions
- BDeadlocks
- CNondeterminate program operation
- DImproper synchronization
87This contains the most frequently used functions in the OS:
- ACentre
- BBase
- CRoot
- DKernel
88The end user views a computer system in terms of:
- Aa set of machine instructions
- Butilities
- Ca set of system programs
- Da set of applications
89Which of the following is not the state of a process?
- Anew
- Bwaiting
- Cterminated
- Dready
- Erunning
- Fold
90The fetched instruction is loaded into the
- AIR
- BAccumulator
- CMemory
- DPC
91When the time required for the I/O operation will take much more time than executing a sequence of user instructions, it is:
- ASlow I/O wait
- BLong I/O wait
- CFast I/O wait
- DShort I/O wait
92The system handles multiple interactive jobs
- ATime-sharing-system
- BSimple batch system
- CSerial processing
- DMultiprogrammed batch system
93A 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
- ATime scheduling
- BTime sliding
- CTime slicing
- DTime allocating
94Choose the storage management responsibility for "Programmers should be able to define programs modules, and to create, destroy, and alter the size of modules dynamically":
- AProtection and access control
- BLong-term storage
- Cautomatic allocation and management
- Dprocess isolation
- Esupport of modular programming
95'Lost signals, duplicate signals received'. This is
- AImproper synchronization
- BNondeterminate program operation
- CDeadlocks
- DFailed mutual exclusion
Information
- Description
- Suicidal Operating Systems [Teachers: Teshebayeva Karagoz, Mishina Aigerim ; Final Exam + STATE EXAM] ▼ Quiz on OS Part 2, created by Good Guy Beket on 18/12/2017.
- Author
- Good Guy Beket
- Language
- English
- Views
- 716
- Tags
- Rating
- 5.0 out of 5 · 1 rating Rate this quiz