The processor is executing ‘Load AC from memory’ instruction. Choose the correct micro-instructions:

PC -> MAR M -> MBR MBR -> IR IR -> MAR M -> MBR MBR -> AC

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 -> MBR M -> MAR MAR -> AC

When an I/O device completes an I/O operation, the device issues an interrupt signal to the processor and then:

The processor finishes execution of the current instruction before responding to the interrupt

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

Most I/O devices are:

much shorter than the processor

If there no interrupts, after each write operation, the processor must

Finish execution of current instruction

Save the PSW and PC onto control stack

Pause and remain idle until the I/O operation finishes

The concept of a batch operating system was developed to

Maximize processor utilization (To improve utilization)

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

Multiprogramming or multitasking batch system

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

the state keeps the system protected and safe

Quiz

os

Csse 1502 200 questions 1,584 views

Take the quiz

This quiz has question types that open in the usual player.

Questions in this quiz (200)

1What is not a main structural element of a computer system?
1. AProcessor
2. BMain Memory
3. CI/O Modules
4. DSystem Bus
5. EOperating system
2Which of the following registers are used by the processor to exchange data with memory?
1. AMAR and MBR
2. BPC and IR
3. CProgram status word
4. DI/OAR and I/OBR
3Which of the following registers are used by the processor to exchange data with input/output module?
1. AMAR and MBR
2. BPC and IR
3. CProgram status word
4. DI/OAR and I/OBR
4Which of the following element of a computer system controls the operation of the computer and performs its data processing functions?
1. ASystem bus
2. BMain memory
3. CI/O modules
4. DProcessor
5Which of the following element of a computer system stores data and programs?
1. AMain memory
2. BSystem bus
3. CProcessor
4. DI/O modules
6Which of the following provides for communication among elements of a computer system?
1. AMain memory
2. BSystem bus
3. CProcessor
4. DI/O modules
7Which of the following element of a computer system moves data between the computer and its external environment?
1. AMain memory
2. BProcessor
3. CSystem bus
4. DI/O modules
8The processor contains a single data register, called
1. APSW
2. BPC
3. CIR
4. DAC
9This register specifies a particular input/output device
1. AMemory address register
2. BI/OAR
3. CMemory buffer register
4. DI/OBR
10This register is used for the exchange of data between an I/O module and the processor
1. AMemory address register
2. BI/OAR
3. CMemory buffer register
4. DI/OBR

11This register contains the data to be written into memory or which receives the data read from memory
1. AI/OAR
2. Bmemory buffer register
3. Cmemory address register
4. DI/OBR
12This register specifies the location in memory for the next read or write
1. AMemory address register
2. BI/OAR
3. CMemory buffer register
4. DI/OBR
13 Index register, segment register, and stack register are example of:
1. AAddress register
2. BData registers
3. CControl registers
4. DStatus registers
14Which register contains the address of the next instruction to be fetched?
1. Ainstruction register
2. Bexecution register
3. Cprogram counter
4. Dprocess counter
15 Which register contains the instruction most recently fetched?
1. Ainstruction register
2. Bexecution register
3. Cprogram counter
4. Dprocess counter
16Which register contains condition codes set by the processor hardware as the result of operations?
1. AProgram counter
2. BAccumulator
3. CProgram status word
4. DStack pointer
17 The fetched instruction is loaded into the
1. AIR
2. BAccumulator
3. CMemory
4. DPC
18At the beginning of each instruction cycle, the processor fetches an instruction from the memory. The address of the instruction is held in
1. AIR
2. BMBR
3. CMAR
4. DPC
19The processor is executing ‘Load AC from memory’ instruction. Choose the correct micro-instructions:
1. APC -> MAR
  M -> MBR
  MBR -> AC
  IR -> MAR
  M -> MBR
  MBR -> AC
2. BPC -> MBR
  M -> MAR
  MAR -> IR
  IR -> MAR
  M -> MBR
  MBR -> AC
3. CPC -> MAR
  M -> MBR
  MBR -> IR
  IR -> MAR
  M -> MBR
  MBR -> AC
4. DPC -> MAR
  M -> MBR
  MBR -> IR
  IR -> MBR
  M -> MAR
  MAR -> AC
20When an I/O device completes an I/O operation, the device issues an interrupt signal to the processor and then:
1. AThe processor stops execution of the current instruction without finishing it and responds to the interrupt
2. BThe processor loads the program counter with the entry location of the interrupt-handling routine
3. CThe processor saves information needed to resume the current program at the point if interrupt
4. DThe processor finishes execution of the current instruction before responding to the interrupt
21When 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:
1. AFast I/O wait
2. BSlow I/O wait
3. CLong I/O wait
4. DShort I/O wait
22When the time required for the I/O operation will take much more time than executing a sequence of user instructions, it is
1. ASlow I/O wait
2. BLong I/O wait
3. CFast I/O wait
4. DShort I/O wait
23Most I/O devices are:
1. Amuch slower than the processor
2. Bmuch faster than the processor
3. Cmuch shorter than the processor
4. Dmuch longer than the processor
24If there no interrupts, after each write operation, the processor must
1. ALoad new PC value
2. BFinish execution of current instruction
3. CSave the PSW and PC onto control stack
4. DPause and remain idle until the I/O operation finishes
25Complete the relationship concerning the memory systems: faster access time –
1. Alower capacity
2. Bgreater cost per bit
3. Cfaster access speed
4. Dsmaller cost per bit
26 Complete the relationship concerning the memory systems: greater capacity –
1. Alower capacity
2. Bgreater cost per bit
3. Cfaster access speed
4. Dsmaller cost per bit
27Complete the relationship concerning the memory systems: greater capacity –
1. Alower capacity
2. Bslower access time
3. Cgreater cost per bit
4. Dfaster access speed
28The smaller, more expensive, faster memory is:
1. ADisk drive
2. BCache
3. CMain memory
4. DRegister
29If the accessed word is found in the faster memory, that is defined as a:
1. Abingo
2. Bwin
3. Chit
4. Devrika
30If the accessed word is not found in the faster memory, that is defined as a:
1. Aricochet
2. Bmiss
3. Czero
4. DLoss
31The central idea in this system was the use of a piece of software known as the monitor
1. ATime-sharing-system
2. BSimple batch system
3. CMultiprogrammed batch system
4. DSerial processing
32The concept of a batch operating system was developed to
1. AMaximize processor utilization (To improve utilization)
2. BMinimize response time
3. CSupport interactive mode
4. DMinimize processor utilization
33The concept of modes of operation (user mode, system mode) was introduced with
1. ATime-sharing-system
2. BSimple batch system
3. CMultiprogrammed batch system
4. DSerial processing
34 'Ease of evolution of an OS' corresponds to the following objective:
1. AEfficiency
2. BConvenience
3. CAbility to evolve
35The principal objective of the time-sharing system is to
1. AMinimize response time
2. BMinimize processor utilization
3. CMaximize response time
4. DMaximize processor utilization
36The 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
1. AMultiprogramming or multitasking batch system
2. BSimple batch system
3. CSerial processing
4. DTime-sharing-system
37The programmer interacted directly with the computer hardware with
1. ASimple batch systems
2. BSerial processing
3. CTime-sharing-systems
4. DMultiprogrammed batch systems
38Semaphore is a/an_to solve the critical section problem?
1. Ainteger variable
2. Bspecial program for a system
3. Ccomplex structure
4. Dhardware for a system
39 'The OS as a resource manager' corresponds to the following objective:
1. AEfficiency
2. BConvenience
3. CAbility to evolve
40 An un-interruptible unit is known as:
1. Aatomic
2. Bnone of the above
3. Cstatic
4. Dsingle
41A state is safe, if:
1. Athe system can allocate resources to each process in some order and still avoid a deadlock
2. Bthe system does not crash due to deadlock occurrence
3. Call of the above
4. Dthe state keeps the system protected and safe
42'The OS as a User/Computer interface' corresponds to the following objective:
1. AEfficiency
2. BConvenience
3. CAbility to evolve
43This type of memory is nonvolatile
1. ASecondary memory
2. BMain memory
3. CRegister
4. DCache
44An application programs is developed by the
1. AApplication programmer
2. BEnd user
3. COperating system
4. DHardware
45 When a processor attempts to read a byte or word of memory, it firstly checks the:
1. ASecondary memory
2. BRegister
3. CCache
4. DMain memory
46The end user views a computer system in terms of
1. Aa set of applications
2. Ba set of machine instructions
3. Cutilities
4. Da set of system programs
47The serial processing presented two main problems:
1. Asetup time
2. Busing a monitor
3. Ctime slicing
4. Dmultiprogramming
5. Escheduling
48The hardware and software used in providing applications to a user can be viewed in a:
1. Alayered fashion
2. Bclassified fashion
3. Csandwich fashion
4. Dleveled fashion
49A 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:
1. Adata consistency
2. Bmutual exclusion
3. Crace condition
4. Dstarvation
50This contains the most frequently used functions in the OS:
1. AKernel (или nucleus)
2. BCentre
3. CBase
4. DRoot
51The initial value of the semaphore that allows only one of the many processes to enter their critical sections,is?
1. A1
2. B10
3. C2
4. D0
52Utilities are
1. AApplication program
2. BSystem programs
3. COpcodes
4. DProcessor registers
53Block size is:
1. AThe unit of data exchanged between cache and main memory
2. BLarger 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
3. C(How much data should be transferred from main memory to cache)
54There were no OS with
1. ASimple batch systems
2. BSerial processing
3. CTime-sharing-systems
4. DMultiprogrammed batch systems
55Which of the following cannot be interrupted?
1. AProcess
2. BThread
3. CModule
4. DAtomic operation
56Process is
1. Aa unit of activity characterized by execution of a sequence of instructions, a current state, and an associated set
2. Ba job in secondary memory
3. Ccontents of main memory
4. Dprogram in high level language kept on disk
57This determines which cache location the block will occupy: [blank_start]Mapping function[blank_end]
1. AMapping function
58This resource can be created and destroyed
1. Aresumable resource
2. Brestartable resource
3. Cconsumable resource
4. Dfinite resource
59This system handles multiple interactive jobs
1. ATime-sharing-system
2. BSimple batch system
3. CSerial processing
4. DMultiprogrammed batch system
60Process(2.0) is:
1. AA program in execution
2. BProgram in High level language kept on disk
3. CContents of main memory
4. DA job in secondary memory
61This system was developed by General Motors for the use on an IBM 701
1. ASimple Batch Systems or GM-NAA I/O
2. BSerial processing
3. CMultiprogrammed batch system
4. DTime-sharing system
62This 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
1. Areplacement algorithm
2. Bwrite policy
3. Ccache size
4. Dlocality of reference
63Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and
1. Ahold and wait
2. Bdeadlock avoidance
3. Cstarvation
4. Drace condition
64A task in a blocked state
1. Ais waiting for same temporarily unavailable resources
2. Bmust still be placed in the run queues
3. Cis executable
4. Dis running
65This type of system was developed at MIT by a group known as Project MAC for the IBM 709 in 1961
1. ASerial processing
2. BMultiprogrammed batch system
3. CSimple batch system
4. DTime-sharing-system
66 This resource can be safely used by only one process at a time and is not depleted by that use
1. Arefurbished resource
2. Breplenishing resource
3. Creusable resource
4. Drefreshing resource
67If 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:
1. Awrite policy
2. Bmapping function
3. Clocality of reference
4. Dreplacement algorithm
68'Lost signals, duplicate signals received'. This is
1. AImproper synchronization
2. BNondeterminate program operation
3. CFailed mutual exclusion
4. DDeadlocks
69The systems which allows only one process execution at a time, are called
1. Auniprogramming systems
2. Bunitasking systems
3. Cuniprocessing systems
4. Dunicasting systems
70Deadlock inevitable region can be referred to as a
1. Afun region
2. Bfatal region
3. Cfinal region
4. Dfalse region
71In the non-blocking send, non-blocking receive:
1. Athe sending process keeps sending until it receives a message
2. Bthe sending process sends the message and resumes operation
3. Cneither of processes are required to wait
4. Dthe sending process keeps sending until the message is received
72Which of the following is not a technique possible for I/O operations?
1. ADirect memory access (DMA)
2. BManual memory access
3. CInterrupt-driven I/O
4. DProgrammed I/O
73'Two or more programs hung up waiting for each other'. This error is caused by
1. AFalled mutual exclusions
2. BDeadlocks
3. CNondeterminate program operation
4. DImproper synchronization
74This illustrates the progress of two processes competing for two resources
1. Ajoint process diagram
2. Bjoint ingres diagram
3. Cjoint regress diagram
4. Djoint progress diagram
75The 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.
1. ADirect memory access (DMA)
2. BManual memory access
3. CInterrupt-driven I/O
4. DProgrammed I/O
76A monitor is a type of:
1. Adeadlock
2. Blow level synchronization construct
3. Chigh level synchronization construct
4. Dnone of the above
77The state of a process is defined by:
1. Athe current activity of the process
2. Bthe activity to next be executed by the process
3. Cthe final activity of the process
4. Dthe activity is just executed by the process
78'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
1. AFalled mutual exclusions
2. BDeadlocks
3. CNondeterminate program operation
4. DImproper syncronization
79The 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.
1. ADirect memory access (DMA)
2. BManual memory access
3. CInterrupt-driven I/O
4. DProgrammed I/O
80When each process in the set is blocked awaiting for resource siezed by another blocked process
1. Ait is a deadend
2. Bit is a deadlock
3. Cit is a softlock
4. Dit is a mortallock
81Which of the following is not the state of a process?
1. AOld
2. Bterminated
3. Crunning
4. Dnew
5. Eready
82The described technique is:
1. ADirect memory access (DMA)
2. BManual memory access
3. CInterrupt-driven I/O
4. DProgrammed I/O
83Choose 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"
1. ALong-term storage
2. BProtection and access control
3. CAutomatic allocation and management
4. DProcess isolation
5. ESupport of modular programming
84 Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the:
1. AReady state
2. BRunning state
3. CTerminated state
4. DSuspended state
85Which of the following statements is false:
1. Acompaction does not involve relocation of programs
2. Bthe technique of storage compaction involves moving all occupied areas of storage to one end or other of main storage
3. Ccompaction is also known as garbage collection
4. Dthe system must stop everything while it performs the compaction
86Choose the storage management responsibility for "Programmers should be able to define program modules, and to create, destroy, and alter the size of modules dynamically"
1. AProtection and access control
2. BLong-term storage
3. CAutomatic allocation and management
4. DProcess isolation
5. ESupport of modular programming
87Which of the following state transitions is not possible?
1. Ablocked to running
2. Brunning to blocked
3. Cblocked to ready
4. Dready to running
88The main disadvantage of this technique: it is a time-consuming process that keeps the processor busy needlessly.
1. ADirect memory access (DMA)
2. BManual memory access
3. CInterrupt-driven I/O
4. DProgrammed I/O
89Memory is:
1. Ais the device where information stored
2. Bis a sequence of the instructions
3. Cis a device that performs a sequence of operations specified by instructions in memory
4. Dis typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
90Choose the storage management responsibility for "The OS can achieve efficiency by assigning memory to jobs only as needed"
1. AProtection and access control
2. BLong-term storage
3. CAutomatic allocation and management
4. DProcess isolation
5. ESupport of modular programming
91 If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called
1. Amutual exclusion
2. Basynchronous exclusion
3. Ccritical exclusion
4. Dsynchronous exclusion
92The processor issues an I/O command to a module and then go on to some other useful work.
1. ADirect memory access (DMA)
2. BManual memory access
3. CInterrupt-driven I/O
4. DProgrammed I/O
93 Processor is:
1. Ais the device where information stored
2. Bis a sequence of the instructions
3. Cis a device that performs a sequence of operations specified by instructions in memory
4. Dis typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
94Choose the storage management responsibility for "The OS must allow portions of memory to be accessible in various ways by various users"
1. AProtection and access control
2. BLong-term storage
3. CAutomatic allocation and management
4. DProcess isolation
5. ESupport of modular programming
95Interprocess communication:
1. Aallows processes to communicate and synchronize their actions without using the same address space
2. Ballows processes to communicate and synchronize their actions when using the same address space
3. Callows the processes to only synchronize their actions without communication
4. Dnone of the above
96The I/O module performs the requested action and alerts the processor to request service when it is ready to exchange data with the processor
1. ADirect memory access (DMA)
2. BManual memory access
3. CInterrupt-driven I/O
4. DProgrammed I/O
97Choose the storage management responsibility for "The OS must prevent independent processes from interfering with each other's memory, both data and instructions"
1. AProtection and access control
2. BLong-term storage
3. CAutomatic allocation and management
4. DProcess isolation
5. ESupport of modular programming
98Program is:
1. Ais the device where information stored
2. Bis a sequence of the instructions
3. Cis a device that performs a sequence of operations specified by instructions in memory
4. Dis typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
99A sequence of instructions, in a computer language, to get the desired result, is known as?
1. Aprogram
2. Bprocess
3. Cinstruction
4. Dalgorithm
100In operating system security and protection, authenticity:
1. AConcerned with the proper verification of the identity of users and the validity of messages or data
2. BAssuring that users cannot read data for which access is unauthorized
3. CProtection of data from unauthorized modification
4. DConcerned with protecting the system against interruption
101The 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
1. ADirect memory access (DMA)
2. BManual memory access
3. CInterrupt-driven I/O
4. DProgrammed I/O
102 In operating system, each process has its own:
1. Aall of the mentioned
2. Baddress space and global variables
3. Cset of data
4. Dprogram code
103The memory allocation scheme subject to "external" fragmentation is?
1. Asegmentation
2. Bswapping
3. Cmultiple contiguous fixed partitionings
4. Dpure demand paging
104In operating system security and protection, availability is:
1. AConcerned with the proper verification of the identity of users and the validity of messages or data
2. BAssuring that users cannot read data for which access is unauthorized
3. CProtection of data from unauthorized modification
4. DConcerned with protecting the system against interruption
105For each process OS creates and manages:
1. AProcess control block
2. BProgram code
3. CProgram
4. DThread control block
106The 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.
1. AInterrupt-driven I/O
2. BProgrammed I/O
3. CManual memory access
4. DDirect memory access (DMA)
107The memory allocation scheme subject to "internal" fragmentation is?
1. Asegmentation
2. Bswapping
3. Cmultiple contiguous fixed partitionings
4. Dpure demand paging
108In operating system security and protection, confidentiality is:
1. AConcerned with the proper verification of the identity of users and the validity of messages or data
2. BAssuring that users cannot read data for which access is unauthorized
3. CProtection of data from unauthorized modification
4. DConcerned with protecting the system against interruption
109The module transfers the entire block of data to/from memory without going through the processor.
1. AInterrupt-driven I/O
2. BProgrammed I/O
3. CManual memory access
4. DDirect memory access (DMA)
110The available vector defines
1. Atotal amount of each resource NOT allocated to any process
2. Btotal amount of each resource allocated to all processes
3. Ctotal amount of each resource in the system
4. Dtotal amount of resources required for all processes
111Any program, no matter how small, will occupy an entire partition results in?
1. Ainternal fragmentation
2. Bsegmentation
3. Cpaging
4. Dexternal fragmentation
112In operating system security and protection, data integrity is:
1. AConcerned with the proper verification of the identity of users and the validity of messages or data
2. BAssuring that users cannot read data for which access is unauthorized
3. CProtection of data from unauthorized modification
4. DConcerned with protecting the system against interruption
113The main disadvantage of this technique: there is a competition for bus usage
1. AInterrupt-driven I/O
2. BProgrammed I/O
3. CManual memory access
4. DDirect memory access (DMA)
114A binary semaphore is a semaphore with integer values:
1. A1
2. B0,5
3. C0
4. D-1
115The resource vector define
1. Atotal amount of each resource in the system
2. Btotal amount of resources required for all processes
3. Ctotal amount of each resource allocated to all processes
4. Dtotal amount of each resource NOT allocated to any process
116A hardcopy sign-up sheet was used to reserve computer time with
1. ATime slicing
2. BTime sliding
3. CTime scheduling
4. DTime allocating
117Short-term scheduler, or dispatcher, picks a process. Each process in the queue is given some time in turn. This strategy is called:
1. ARound-robin technique
2. BPrioritizing
3. CCarousel technique
4. DMerry-go-round technique
118This matrix defines the current allocation to process i of the resource j
1. AAllocation matrix
2. BResource matrix
3. CRequest matrix
4. DClaim matrix
119A 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
1. ATime scheduling
2. BTime sliding
3. CTime slicing
4. DTime allocating
120The base register
1. ADefines the size of the region of (in bytes or words)
2. BContains the index into the process list of the process currently controlling the processor
3. CPoints to the next instruction in that process to be executed
4. DContains the staring address of the region of memory occupied by the process
121The two atomic operations permissible on semaphores are:
1. Ahold
2. Bstop
3. Csignal
4. Dwait
122This matrix defines the amount of resources of type j requested by process i
1. ARequest matrix
2. BAllocation matrix
3. CResource matrix
4. DClaim matrix
123How to solve problem of equal-size partitions?
swapping (?) ----- page 318 book
1. Aswapping (?) ----- page 318 book
  unequal-size partitions
2. Bsegmentation
3. Ccompaction
4. Dvirtual memory segmentation
124The limit register
1. ADefines the size of the region of (in bytes or words)
2. BContains the index into the process list of the process currently controlling the processor
3. CPoints to the next instruction in that process to be executed
4. DContains the staring address of the region of memory occupied by the process
125Batch operating systems were used (years)
1. AFrom the late 1940s to the mid-1950s
2. BFrom the mid-1950 to early 1960s
3. CIn early 1960s
126This matrix defines requirements of processes i for the resources j
1. AClaim matrix
2. BAllocation matrix
3. CResource matrix
4. DRequest matrix
127How to solve problem of "external" fragmentation?
1. Acompaction
2. Blarger memory space
3. Csmaller memory space
4. Dnone of these
128The principal tool available to system programmers in developing the early multiprogramming and multiuser interactive systems
1. AInterrupt
2. BJob control language
3. CMonitor
4. DAdd hec method
129The banker's algorithm is referred to as
1. Aresource allocation denial
2. Bdenial of service
3. Cloan allocation denial
4. Dresource allocation refusal
130A page fault?
1. Aoccurs when a program accesses a page of memory
2. Bis a reference to a page belonging to another program
3. Cis an access to a page not currently in memory
4. Dis an error is a specific page
131Job control language was used
1. Aused to provide instructions to the monitor,In early 1960s
2. BFrom late 1940s to the mid-1950s
3. CFrom the mid-1950s to early 1960s
4. DExecute instructions
5. EControl the sequence of events as the resident monitor
6. FTranslate the user’s program into object code
7. GProvide instructions to the monitor to improve job setup time
132The process index register
1. AContains the index into a process list of the process currently controlling the processor
2. BDefine the region in memory occupied by the process
3. CPoints to the next instruction in that process to be executed
4. DContains the starting address of the region of memory occupied by the process
133Which of the following condition is required for deadlock to be possible
1. Amutual exclusion
2. Ba process may hold allocated resources while awaiting assignment of other resources
3. Cno resource can be forcibly removed from a process holding it
4. Dall of the above
134'Hold and wait' condition for deadlock is defined as
1. AProcess holds a resource while awaiting for other resource
2. BEach process holds resource needed by next process in chain
3. CNo resource can be forcibly removed from process holding it
4. DOnly one process may use a resource at a time
135Serial processing was used
1. AIn early 1960s
2. BFrom late 1940s to the mid-1950s
3. CFrom the mid-1950s to early 1960s
136This term was first used by the designers of Multics in the 1960s
1. AMonitor
2. BProcess
3. CMultiprogramming
4. DTime sharing
137 Which of the following statements is false?
1. AI\O transfers are more efficient with large pages
2. Ba large page size causes instructions and data that will not be referenced brought into primary storage
3. Ca small page size causes large page tables
4. Dinternal fragmentation is increased with small pages
138Banker’s algorithm for resource allocation deals with:
1. Adeadlock recovery
2. Bdeadlock prevention
3. Cmutual exclusion
4. Ddeadlock avoidance
139'Circular wait' condition for deadlock is defined as
1. AEach process holds resource needed by next process in chain
2. BProcess holds a resource while awaiting for other resource
3. CNo resource can be forcibly removed from process holding it
4. DOnly one process may use a resource at a time
140'Ease of evolution of an OS' corresponds to the following objective:
1. AEfficiency
2. BConvenience
3. CAbility to evolve
141Swapping
1. Aallows many programs to use memory simultaneously
2. Ballows each program in turn to use the memory
3. Cdoes not work with overlaying
4. Dnone of the above
142'No preemption' condition for deadlock is defined as
1. ANo resource can be forcibly removed from process holding it
2. BOnly one process may use a resource at a time
3. CProcess holds a resource while awaiting for other resource
4. DEach process holds resource needed by next process in chain
143A system is in the safe state if:
1. Ab)there exist a safe sequence
2. Bnone of the above
3. Cboth a and b
4. Da)the system can allocate resources to each process in some order and still avoid a deadlock
144Virtual address is a
1. AVirtual address is a page number and an offset within the page
2. BДругого варианта нет)
145Which of the following is not true about the memory management?
1. Avirtual memory is used only in multi-user systems
2. Bsegmentation suffers from external fragmentation
3. Cpaging suffers from internal fragmentation
4. Dsegmented memory can be paged
5. ENone of the above
146True or false: segmentation suffers from external fragmentation?
1. ATrue
2. BFalse
147'Mutual exclusion' condition for deadlock is defined as
1. AOnly one process may use a resource at a time
2. BNo resource can be forcibly removed from process holding it
3. CProcess holds a resource while awaiting for other resource
4. DEach process holds resource needed by next process in chain
148True or false: paging suffers from external fragmentation?
1. ATrue
2. BFalse
149 What is NOT an example of consumable resource?
1. AMain memory
2. BInformation in I\O buffers
3. CSignals
4. DMessages
150 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?
1. Avirtual memory
2. Bsegmentation
3. Cpaging
4. Dpartition
151What is NOT an example of reusable resource?
1. Ainterrupt
2. Bsemaphores
3. Cprocessors
4. Di/o channels
152In memory systems, boundary registers?
1. Atrack the beginning and ending of programs
2. Btrack page boundaries
3. Care only necessary with fixed partitions
4. Dare used for temporary program variable storage
153On 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].
1. Ato fetch the instruction
2. Bto fetch operands
3. Cstore results
154Operating System maintains the page table for:
1. Aeach process
2. Beach thread
3. Ceach instruction
4. Deach address
155A 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?
1. AMultitasking
2. BSemaphore
3. CMutual exclusion
4. Dmultiprogramming
156In contiguous memory allocation:
1. Aeach process is contained in a single contiguous section of memory
2. Bnone of the above
3. Cthe memory space is contiguous
4. Dall processes is contained in a single contiguous section of memory
157CPU fetches the instruction from memory according to the value of?
1. Astatus register
2. Bprogram counter
3. Cinstruction register
4. Dprogram status word
158When memory is divided into several fixed sized partitions, each partition may contain ________.
1. Aexactly one process
2. Bnone of the above
3. Cat least one process
4. Dmultiple processes at once
159The number of resources requested by a process:
1. Amust always be less than the total number of resources available in the system
2. Bmust always be equal to the total number of resources available in the system
3. Cmust not exceed the total number of resources available in the system
4. Dmust exceed the total number of resources available in the system
160A memory used to provide a high speed is called?
1. Acache
2. Bmain memory
3. Cdisk buffer
4. Dstack pointer
161In fixed sized partition, the degree of multiprogramming is bounded by ___________.
1. Athe memory size
2. Ball of the above
3. Cthe number of partitions
4. Dthe CPU utilization
162Which one of the following is the address generated by CPU?
1. Alogical address
2. Bphysical address
3. Cabsolute address
4. Dnone of the above
163A deadlock avoidance algorithm dynamically examines the _____ to ensure that a circular wait condition can never exist
1. Aresource allocation state
2. Boperating system
3. Cresources
4. Dsystem storage state
164The first fit, best fit and worst fit are strategies to select a ______.
1. Aprocess from a queue to put in memory
2. Ball of the above
3. Cfree hole from a set of available holes
4. Dprocessor to run the next process
165Runtime mapping from virtual to physical address is done by?
1. ACPU
2. Bnone of the above
3. Cmemory management unit
4. DPCI
166In internal fragmentation, memory is internal to a partition and:
1. Ais not being used
2. Bnone of the above
3. Cis always used
4. Dis being used
167Which of the following is not one of the principles of dealing with deadlock?
1. AInitialization
2. BAvoidance
3. CDetection
4. DPrevention
168The address of a page table in memory is pointed by:
1. Apage table base register
2. Bstack pointer
3. Cpage register
4. Dprogram counter
169A solution to the problem of external fragmentation is:
1. Acompaction
2. Blarger memory size
3. Cunequal size parts
4. Dsmaller memory space
170The Process Control Block is:
1. Aa secondary storage section
2. BProcess type variable
3. CData Structure
4. DBlock in memory
171Program always deals with:
1. Alogical address
2. Bphysical address
3. Crelative address
4. Dabsolute address
172__________ is generally faster than _________ .
1. Aworst fit, best fit
2. Bbest fit, first fit
3. Cfirst fit, best fit
4. Dnone of the above
173 Which one of the following is a synchronization tool?
1. Asocket
2. Bthread
3. Cpipe
4. Dsemaphore
174External fragmentation exists when:
1. Anone of the above
2. Bthe total memory is insufficient to satisfy a request
3. Cenough total memory exists to satisfy a request but it is not contiguous
4. Da request cannot be satisfied even when the total memory is free
175 What is compaction?
1. Aa paging technique
2. Ba technique for overcoming fatal error
3. Ca technique for overcoming internal fragmentation
4. Da technique for overcoming external fragmentation
176What controls the process in a single-threaded process model?(не точно) из книги
1. AProcess control block
2. BUser address space control block
3. CUser stack control block
4. DKernel stack control block
177External fragmentation will not occur when:
1. Ano matter which algorithm is used, it will always occur
2. Bfirst fit is used
3. Cbest fit is used
4. Dnext fit is used
178When the memory allocated to a process is slightly larger than the process, then:
1. Aboth will occur
2. Bexternal fragmentation occurs
3. Cinternal fragmentation occurs
4. Dnone of the above
179In the non-blocking send:
1. Athe sending process sends the message and resumes operation
2. Bthe sending process keeps sending unit it receives a message
3. Cthe sending process keeps sending until the message is received
4. Dnone of the above
180Main memory is broken into fixed-sized blocks called ________.:
1. Anone of the above
2. Bpages
3. Cframes
4. Dsegments
181Fixed-length block of data in secondary memory is called ________.:
1. Anone of the above
2. Bframes
3. Csegments
4. Dpages
182Variable-length block of data that resides in secondary memory is called ________.
1. Anone of the above
2. Bframes
3. Csegments
4. Dpages
183The degree of multi-programming is:
1. Athe number of processes in memory
2. Bthe number of processes executed per unit time
3. Cthe number of processes in the ready queue
4. Dthe number of processes in the I/O queue
184Every address generated by the CPU is divided into two parts:
1. Apage number + page offset
2. BДругого варианта нет
185The __________ is used as an index into the page table.
1. Apage number
2. Bpage offset
3. Cframe bit
4. Dframe offset
186Trace of the process is: (из книги)
1. AList of files that are opened
2. BList of interactions of the process with other process
3. CList of threads of the process
4. DList of instructions that are executed
187The _____ table contains the base address of each page in physical memory.
1. Aprocess
2. Bmemory
3. Cpage
4. Dframe
188With paging there is no ________ fragmentation.
1. Aeither type of
2. Bnone of the above
3. Cexternal
4. Dinternal
189A set of processes is deadlock if:
1. Anone of the above
2. Beach process is blocked and will remain so forever
3. Call processes are trying to kill each other
4. Deach process is terminated
190The operating system maintains a ______ table that keeps track of how many frames have been allocated, how many are there, and how many are available.
1. Amemory
2. Bpage
3. Cframe
4. Dsegment
191To find a free partition this algorithm starts searching from where it left off, not from the beginning (из книги)
1. AWorst fit
2. BNext fit
3. CBest fit
4. DFirst fit
192For every process there is a __________.
1. Apointer to page table
2. Bcopy of page table
3. Cframe table
4. Dpage table
193If a page number is not found in the TLB, then it is known as a:
1. ATLB miss
2. Bbuffer miss
3. CTLB ht
4. Dpage fault
194Mutual exclusion can be provided by the:
1. Abinary semaphores
2. Bnone of the above
3. Cboth
4. Dmutex locks
195If a page table entry is present in the TLB, then it is known as a:
1. Abuffer miss
2. BTLB miss
3. Cpage fault
4. DTLB hit
196If a page table entry is not in main memory, then it is known as a:
1. Apage fault
2. Bbuffer miss
3. CTLB hit
4. DTLB miss
197What is a medium-term scheduler?
1. AIt selects which process has to be executed next and allocates CPU
2. BIt selects which process has to be brought into the ready queue
3. CNone of the above
4. DIt selects which process to remove from memory by swapping
198In segmentation, each address is specified by (choose two):
1. Aa segment number
2. Ban offset
3. Ca value
4. Da key
199Which is the ready state of a process?
1. Awhen process is using the CPU
2. Bwhen process is scheduled to run after some execution
3. Cwhen process is unable to run until some task has been completed
4. Dnone of the above
200Which one of the following is the deadlock avoidance algorithm?
1. Around-robin algorithm
2. Belevator algorithm
3. Cbanker’s algorithm
4. Ddinning philosophers problem

Information

Description: Operating Systems (OS) Quiz on os, created by Csse 1502 on 17/12/2017.
Author: Csse 1502
Language: English
Views: 1,584
Tags: operating systems (os)
Rating: No ratings yet
Rate this quiz
Rate this quiz

os

Questions in this quiz (200)

Information

Feedback

What do you think of the new look?