OS final

1. 1In the blocking send, blocking receive

   1. Aboth sender and receiver are blocked until message is delivered
   2. Bnone of the above
   3. Cthe sending process sends the message and resumes operation
   4. Dthe sending process sends the message while receiver is blocked
2. 2The table _____ contains the base address of each page in physical memory

   1. Aprocess
   2. Bmemory
   3. Cpage
   4. Dframe
3. 3A state is safe, if:

   1. Athe system can allocate resources to each process in some order and still avoid deadlock
   2. Bthe system does not crash due to deadlock occurrence
   3. Cthe state keeps the system protected and safe
   4. Dall of the above
4. 4In 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
5. 5_____ is generally faster than_____

   1. Aworst fit, best fit
   2. Bbest fit, first fit
   3. Cfirst fit, best fit
   4. Dnone of the above
6. 6The two atomic operations permissible on semaphores are: (several answer)

   1. Await
   2. Bsignal
   3. Chold
   4. Dstop
7. 7Program:

   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
8. 8“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
9. 9“Hold and wait” condition for a 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
10. 10A monitor is a type of:

    1. Anone of the above
    2. Bhigh level synchronization construct
    3. Clow level synchronization construct
    4. Dsemaphore

11. 11What is NOT the example of consumable resources?

    1. AInformation in I\O buffers
    2. BSignals
    3. CMain memory
    4. DMessages
12. 12Which one is a synchronization tool?

    1. Asocket
    2. Bthread
    3. Cpipe
    4. Dsemaphore
13. 13A Process Control Block(PCB) does not contain which of the following?

    1. Astack
    2. Bdata
    3. Cprocess state
    4. Dbootstrap program
    5. Ecode
14. 14With ……………… only one process can execute at a time; meanwhile all other process are waiting for the processor. With ……………….. more than one process can be running simultaneously each on a different processor.

    1. AMultiprocessing, multiprogramming
    2. BUniprogramming, Multiprocessing
    3. CMultiprogramming, Uniprocessing
    4. DMultiprogramming, Multiprocessing
15. 15Memory:

    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
16. 16This 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
17. 17Which of the following condition is required for the deadlock to be possible?

    1. Amutual exclusion
    2. Ball of the above
    3. Cno resource can be forcibly removed from a process holding it
    4. Da process may hold allocated resources while awaiting assignment of other resources
18. 18The ________ is used as an index into the page table

    1. Apage number
    2. Bpage offset
    3. Cframe bit
    4. Dframe offset
19. 19A 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
20. 20A state of a process is defined by:

    1. Athe activity is just executed by the process
    2. Bthe final activity of the process
    3. Cthe activity to next be executed by the process
    4. Dthe current activity of the process
21. 21Suppose that a process is in “Blocked” state waiting for some I\O service. When a service is completed, it goes to the:

    1. AReady state
    2. BRunning state
    3. CTerminated state
    4. DSuspended state
22. 22The link between two processes P and Q to send and receive a message is called:

    1. Amessage-passing link
    2. Ball of the above
    3. Ccommunication link
    4. Dsynchronization link
23. 23Message passing system allows processes to:

    1. Ashare data
    2. Bcommunicate with one another without resorting to shared data
    3. Cname the recipient or sender of the message
    4. Dcommunicate with one another by resorting shared data
24. 24Which 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
25. 25The systems which allows only one process execution at a time, are called:

    1. Aunitasking systems
    2. Buniprocessing systems
    3. Cuniprogramming systems
    4. Dunicasting systems
26. 26Remote Procedure Calls(RPC) are used:

    1. Anone of the above
    2. Bfor communication between two processes on separate systems
    3. Cfor communication between two processes on the same systems
    4. Dfor communication between two processes remotely different from each other on the same system
27. 27A minimum of ______ variable(s) is/are required to be shared between processes to solve the critical section problem?

    1. Atwo
    2. Bthree
    3. Cone
    4. Dfour
28. 28This resource can be created and destroyed

    1. Aresumable resource
    2. Brestartable resource
    3. Cconsumable resource
    4. Dfinite resource
29. 29Fixed-length block of data in secondary memory is called:

    1. Apages
    2. Bnone of the above
    3. Cframes
    4. Dsegments
30. 30A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executing, is known as?

    1. AMultitasking
    2. BSemaphore
    3. CMutual exclusion
    4. DMultiprogramming
31. 31Every address generated by the CPU is divided into two parts: (several answers)

    1. Aframe offset
    2. Bpage number
    3. Cframe bit
    4. Dpage offset
32. 32True or false: segmentation suffers from external fragmentation?

    1. ATrue
    2. BFalse
33. 33For each process OS creates and manages:

    1. AProcess control block
    2. BProgram code
    3. CProgram
    4. DThread control block
34. 34What is a trap/exception?

    1. Auser generated interrupt caused by an error
    2. Bfailure of the system
    3. Chardware generated interrupt caused by an error
    4. Dsoftware generated interrupt caused by an error
35. 35What is the reusable resource:

    1. Anone of the above
    2. Bthat can be used by more than one process at a time
    3. Cthat can be used by one process at a time and is not depleted by that use
    4. Dthat can be shared between various threads
36. 36Interprocess communication:

    1. Anone of the above
    2. Ballows the processes to only synchronize their actions without communication
    3. Callows processes to communicate and synchronize their actions when using the same address space
    4. Dallows processes to communicate and synchronize their actions without using the same address space
37. 37Which of the following transitions is not possible?

    1. Ablocked to running
    2. Brunning to blocked
    3. Cblocked to ready
    4. Dready to running
38. 38Any program, no matter how small, will occupy an entire partition results in:

    1. Ainternal fragmentation
    2. Bsegmentation
    3. Cpaging
    4. Dexternal fragmentation
39. 39This matrix defines requirements of processes i for the resources j

    1. AClaim matrix
    2. BAllocation matrix
    3. CResource matrix
    4. DRequest matrix
40. 40Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called a(n)____

    1. ARace section
    2. BEntry section
    3. CShared memory segments
    4. DProcess synchronization
41. 41The context of a process in the PCB of a process DOES NOT contain:

    1. Acontext switch time
    2. Bthe process state
    3. Cmemory-management information
    4. Dthe value of the CPU registers
42. 42External 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
43. 43A deadlock avoidance algorithm dynamically examines the _____, to ensure that a circular wait condition can never exist

    1. Aresource allocation state
    2. Bresources
    3. Coperating system
    4. Dsystem storage state
44. 44The process control block is:

    1. Aprocess type variable
    2. Bdata structure
    3. Cblock in memory
    4. Dsecondary storage section
45. 45This 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
46. 46In a multiprogramming environment:

    1. Athe programs are developed by more than one person
    2. Bmore than one process resides in the memory
    3. Csingle user can execute many programs at the same time
    4. Dthe processor executes more than one process at a time
47. 47When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called:

    1. Apriority exchange
    2. Bpriority inversion
    3. Cpriority removal
    4. Dpriority modification
48. 48Main memory is broken into fixed-sized blocks called____

    1. Anone of the above
    2. Bpages
    3. Cframes
    4. Dsegments
49. 49The 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
50. 50The Banker’s algorithm is referred to as

    1. Adenial of service
    2. Bresource allocation denial
    3. Cloan allocation denial
    4. Dresource allocation refusal
51. 51The code that changes the value of the semaphore is:

    1. Anon-critical section code
    2. Bremainder section code
    3. Cnone of the above
    4. Dcritical section code
52. 52The two kinds of semaphore are: (Several answers)

    1. Amutex
    2. Bcounting
    3. Cbinary
    4. Ddecimal
53. 53“Circular wait” 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
54. 54Banker’s algorithm for resource allocation deals with:

    1. Adeadlock prevention
    2. Bmutual exclusion
    3. Cdeadlock recovery
    4. Ddeadlock avoidance
55. 55What 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
56. 56Process is:

    1. Aa job in secondary memory
    2. Ba unit of activity characterized by execution of a sequence of instructions, a current state, and an associated set
    3. Ccontents of main memory
    4. Dprogram in high level language kept on disk
57. 57A single thread of control allows the process to perform:

    1. Aboth
    2. Bone task at a time
    3. Cmultiple tasks at a time
58. 58When the memory allocated to a process is slightly larger than a process, then:

    1. Aboth will occur
    2. Bexternal fragmentation occurs
    3. Cinternal fragmentation occurs
    4. Dnone of the above
59. 59A problem encountered in multitasking when a process is perpetually denied necessary resources is called:

    1. Astarvation
    2. Bdeadlock
    3. Caging
    4. Dinversion
60. 60The memory allocation scheme subject to “internal fragmentation” is:

    1. Asegmentation
    2. Bvirtual memory segmentation
    3. Cfixed partitioning
    4. Dpure demand paging
61. 61Which one is deadlock avoidance algorithm?

    1. Adining philosophers problem
    2. Belevator algorithm
    3. Cbanker's algorithm
    4. Dround-robin algorithm
62. 62What 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
63. 63Variable-length block of data that resides in secondary memory is called:

    1. Anone of the above
    2. Bframes
    3. Csegments
    4. Dpages
64. 64The memory allocation scheme subject to “external fragmentation” is:

    1. Asegmentation
    2. Bswapping
    3. Cmultiple contiguous fixed partitionings
    4. Dpure demand paging
65. 65Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and

    1. Arace condition
    2. Bdeadlock avoidance
    3. Chold and wait
    4. Dstarvation
66. 66A binary semaphore is semaphore with integer values: (Several answers)

    1. A1
    2. B-1
    3. C0
    4. D0.5
67. 67Program always deals with:

    1. Alogical address
    2. Bphysical address
    3. Crelative address
    4. Dabsolute address
68. 68The systems which allows only one process execution at a time, are called

    1. Auniprogramming systems
    2. Bunitasking systems
    3. Cuniprocessing systems
    4. Dunicasting systems
69. 69Swapping:

    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
70. 70When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access take place, is called:

    1. Adynamic condition
    2. Brace condition
    3. Ccritical condition
    4. Dessential condition
71. 71If 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
72. 72With paging there is no _____ fragmentation

    1. Aeither type of
    2. Bnone of the above
    3. Cexternal
    4. Dinternal
73. 73The address of a page table in memory is pointed by:

    1. Apage table base register
    2. Bstack pointer
    3. Cpage register
    4. Dprogram counter
74. 74What is a medium-term scheduler?

    1. Ait selects which process has to be executed next and allocates CPU
    2. Bnone of the above
    3. Cit selects which process has to be brought into the ready queue
    4. Dit selects which process has to remove from memory by swapping
75. 75“No preemption” condition for a 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
76. 76Processor:

    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
77. 77Fixed-length block of main memory is called____:

    1. Aframes
    2. Bsegments
    3. Cnone of the above
    4. Dpages
78. 78The initial value of the semaphore that allows only one of the many processes to enter their critical section, is?

    1. A1
    2. B0
    3. C2
    4. D10
79. 79Mutual exclusion means that:

    1. Aif a process is executing in its critical section, then other processes must be executing in their critical section
    2. Bif a process is executing in its critical section, then all the resources of the system must be blocked until it finishes exclusion
    3. Cif a process is executing in its critical section, then no other process must be executing in their critical sections
    4. Dnone of the above
80. 80For every process there is a_________.

    1. Apointer to page table
    2. Bcopy of page table
    3. Cframe table
    4. Dpage table
81. 81In 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
82. 82Listing the sequence of instructions that are executed is called:

    1. Atrace
    2. Bprogram counter
    3. Cinstruction
    4. Dcontrol block
83. 83The segment of code in which the process may change common variables, update tables, write into files known as:

    1. Acritical section
    2. Bprogram
    3. Cnon-critical section
    4. Dmutual exclusion
84. 84Deadlock inevitable region can be referred as:

    1. Afun region
    2. Bfatal region
    3. Cfinal region
    4. Dfalse region
85. 85How to solve a problem of equal-size partitions?

    1. Aunequal-size partitions
    2. Bsegmentation
    3. Ccompaction
    4. Dvirtual memory segmentation
86. 86Paging?

    1. Aallows multiple programs to reside in separate areas of core at the time
    2. Bis a method of memory allocation by which the program is subdivided into equal portions, or pages and core is subdivided equal portions or blocks
    3. Cis a method of allocating processor time
    4. Dconsists of those addresses that may be generated by a processor during execution of a computation
87. 87In 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
88. 88A set of processes is deadlock if:

    1. Aeach process is blocked and will remain so forever
    2. Bnone of the above
    3. Call processes are trying to kill each other
    4. Deach process is terminated
89. 89A memory used to provide a high speed is called?

    1. Acache
    2. Bmain memory
    3. Cdisk buffer
    4. Dstack pointer
90. 90In indirect communication between processes P and Q:

    1. Athere is a mailbox to help communication between P and Q
    2. Bnone of the above
    3. Cthere is another machine between the two processes to help communication
    4. Dthere is another process R to handle and pass on the messages between P and Q
91. 91Semaphore is a/an ______ to solve the critical section problem?

    1. Aspecial program for a system
    2. Bcomplex structure
    3. Cinteger variable
    4. Dhardware for a system
92. 92Which of the following is not the state of a process?

    1. Anew
    2. Brunning
    3. Cterminated
    4. Dold
    5. Eready
93. 93The address of the next instruction to be executed by the current process is provided by the:

    1. Apipe
    2. Bprogram counter
    3. CCPU registers
    4. Dprocess stack
94. 94Which of the following is not true about the memory management?

    1. Asegmentation suffers from external fragmentation
    2. Bpaging suffers from internal fragmentation
    3. Cvirtual memory is used only in multi-user systems
    4. Dsegmented memory can be paged
95. 95The primary distinction between the short-term scheduler and long-term scheduler is:

    1. Athe length of their queues
    2. Bnone of the above
    3. Cthe type of processes the schedule
    4. Dthe frequency of their execution
96. 96In the non-blocking send:

    1. Athe sending process sends the message and resumes operation
    2. Bthe sending process keeps sending until the message is received
    3. Cthe sending process keeps sending until it receives a message
    4. Dnone of the above
97. 97The objective of multi-programming is to:

    1. Ahave multiple programs waiting in a queue ready to run
    2. Bto maximize CPU utilization
    3. Cto minimize CPU utilization
98. 98A system is in the safe state if:

    1. Aa) the system can allocate resources to each process in some order and stil avoid a deadlock
    2. Bb) there exist a safe sequence
    3. Cboth a) and b)
    4. Dnone of the above
99. 99When memory is divided into a 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
100. 100In the non-blocking send, non-blocking receive:

     1. Athe sending process keeps sending until it receives a message
     2. Bneither of processes are required to wait
     3. Cthe sending process keeps sending until the message is received
     4. Dthe sending process sends the message and resumes operation
101. 101A process can be terminated due to:

     1. Afatal error
     2. Bnormal exit
     3. Call of the mentioned
     4. Dkilled by another process
102. 102What is a short-term scheduler?

     1. Ait selects which process has to be executed next and allocates CPU
     2. Bnone of the above
     3. Cit selects which process has to be brought into the ready queue
     4. Dit selects which process has to remove from memory by swapping
103. 103In 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
104. 104External 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
105. 105CPU fetches the instruction from memory according to the value of?

     1. Astatus register
     2. Bprogram counter
     3. Cinstruction register
     4. Dprogram status word
106. 106A sequence of instructions, in a computer language, to get the desired result, is known as:

     1. Aalgorithm
     2. Binstruction
     3. Cprocess
     4. Dprogram
107. 107Semaphores:

     1. Aare used for memory management
     2. Bsynchronize critical resources to prevent deadlock
     3. Care used to do I/O
     4. Dsynchronize critical resources to prevent contention
108. 108This matrix defines the current allocation to process i of the resource j

     1. AAllocation matrix
     2. BResource matrix
     3. CRequest matrix
     4. DClaim matrix
109. 109The 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
110. 110For non-sharable resources like a printer, mutual exclusion:

     1. Amust exist
     2. Bnone of the above
     3. Cmust not exist
     4. Dmay exist
111. 111If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called

     1. Acritical exclusion
     2. Basynchronous exclusion
     3. Cmutual exclusion
     4. Dsynchronous exclusion
112. 112Interprocess communication:

     1. Aallows process to synchronize activity
     2. Bis never necessary
     3. Cis usually done via disk drives
     4. Dis required for all processes
113. 113The available vector defines:

     1. Atotal amount of resources required for all processes
     2. Btotal amount of each resource in the system
     3. Ctotal amount of each resource allocated to all processes
     4. Dtotal amount of each resource NOT allocated to any process
114. 114A task in a blocked state

     1. Ais running
     2. Bis executable
     3. Cmust still be placed in the run queues
     4. Dis waiting for same temporarily unavailable resources
115. 115The systems which allows only one process execution at a time, are called:

     1. Aunitasking systems
     2. Buniprocessing systems
     3. Cuniprogramming systems
     4. Dnone of the above
116. 116True or false: segmentation suffers from external fragmentation

     1. ATrue
     2. BFalse
117. 117What is NOT an example of reusable resource?

     1. Asemaphores
     2. Bprocessors
     3. Cinterrupt
     4. Di/o channels
118. 118An un-interruptible unit is known as:

     1. Asingle
     2. Bnone of the above
     3. Cstatic
     4. Datomic
119. 119How to solve a problem of “external” fragmentation?

     1. Aunequal-size partitions
     2. Bsegmentation
     3. Ccompaction
     4. Dvirtual memory segmentation
120. 120Runtime mapping from virtual to physical address is done by?

     1. ACPU
     2. Bnone of the above
     3. Cmemory management unit
     4. DPCI
121. 121A solution to the problem of external fragmentation is:

     1. Acompaction
     2. Blarger memory size
     3. Cunequal size parts
     4. Dsmaller memory space
122. 122A 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. Arace condition
     2. Bdata consistency
     3. Cstarvation
     4. Dmutual exclusion
123. 123Which one of the following is the address generated by CPU?

     1. Alogical address
     2. Bphysical address
     3. Cabsolute address
     4. Dnone of the above
124. 124What is the ready state of a process?

     1. Awhen process is scheduled to run after some execution
     2. Bnone of the above
     3. Cwhen process is using CPU
     4. Dwhen process is unable to run until some task has been completed
125. 125Mutual exclusion can be provided by the:

     1. Anone of the above
     2. Bmutex locks
     3. Cboth
     4. Dbinary semaphores
126. 126What is a long-term scheduler?

     1. Ait selects which process has to be executed next and allocates CPU
     2. Bnone of the above
     3. Cit selects which process has to be brought into the ready queue
     4. Dit selects which process has to remove from memory by swapping
127. 127Operating system maintains the page table for

     1. Aeach process
     2. Beach thread
     3. Ceach instruction
     4. Deach address
128. 128If a page number is not found in the TLB, then it is known as a:

     1. ATLB miss
     2. Bbuffer miss
     3. CTLB hit
129. 129Part of a program where the shared memory is accessed and which should be executed invisibly, is called:

     1. Asemaphores
     2. Bmutual exclusion
     3. Ccritical section
     4. Ddirectory
130. 130In 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
131. 131The resource vector defines

     1. Atotal amount of resources required for all processes
     2. Btotal amount of each resource in the system
     3. Ctotal amount of each resource allocated to all processes
     4. Dtotal amount of each resource NOT allocated to any process
132. 132When each process in the set is blocked awaiting for resource seized by another blocked process

     1. Ait is a deadend
     2. Bit is a deadlock
     3. Cit is a softlock
     4. Dit is a mortallock
133. 133The number of resources requested be a process:

     1. Amust exceed 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 always be less than the total number of resources available in the system
134. 134What is interprocess communication?

     1. Acommunication between two process
     2. Bcommunication between two threads of same process
     3. Cnone of the above
     4. Dcommunication within the process
135. 135The degree of multi-programming is:

     1. Athe number of processes executed per unit time
     2. Bthe number of processes in the I/O queue
     3. Cthe number of processes in the ready queue
     4. Dthe number of processes in main memory
136. 136This matrix defines the amount of resources of type j requested by process i

     1. AAllocation matrix
     2. BResource matrix
     3. CRequest matrix
     4. DClaim matrix
137. 137If 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
138. 138To avoid the race condition, the number of processes that may be simultaneously inside their critical section is:

     1. A10
     2. B0
     3. C1
     4. D2
139. 139Which process can be affected by other processes executing in the system?

     1. Ainit process
     2. Bcooperating process
     3. Cchild process
     4. Dparent process
140. 140Which 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
141. 141Which 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
142. 142The main disadvantage of this technique: consumes a lot of processor time, because every word

     1. ADirect memory access (DMA)
     2. BManual memory access
     3. CInterrupt-driven I/O
     4. DProgrammed I/O
143. 143The 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:

     1. ADirect memory access (DMA)
     2. BManual memory access
     3. CInterrupt-driven I/O
     4. DProgrammed I/O
144. 144Which 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
145. 145The figure below illustrates a partial program execution.
     What is the memory location of the data is addressed in the instruction?

     

     1. A301
     2. B940
     3. C302
     4. D941
146. 146The figure below illustrates a partial program execution.
     What is the address of the instruction that will be executed next?

     

     1. A301
     2. B940
     3. C300
     4. D941
147. 147Choose the micro-instruction that reflect instruction execution stage shown in the figure below:

     

     1. APC -> MAR 300
        M -> MAR 1940
        MBR -> IR 1940
     2. BPC -> MAR 301
        M -> MBR 1940
        MBR -> IR 1940
     3. CM -> MAR 300
        M -> MBR 1940
        MBR -> IR 1940
     4. DPC -> MAR 300
        M -> MBR 1940
        MBR -> IR 1940
148. 148Choose the micro-instruction that reflect instruction execution stage shown in the figure below:

     

     1. APC -> MAR 301
        M -> MBR 6941
        MBR -> IR 5941
     2. BPC -> MAR 301
        M -> MBR 5941
        MBR -> IR 5941
     3. CIR -> MAR 941
        M -> MBR 0002
        MBR -> AC 0002
     4. DIR -> MAR 941
        AC -> MBR 0003
        MBR -> M 0003
149. 149The figure a) demonstrates the program timing diagram for:

     

     1. AInterrupts; fast I/O wait
     2. BInterrupts; slow I/O wait
     3. CNo interrupts
     4. DInterrupts; long I/O wait
     5. EInterrupts; short I/O wait
150. 150The figure b) demonstrates the program timing diagram for:

     

     1. AInterrupts; fast I/O wait
     2. BInterrupts; slow I/O wait
     3. CNo interrupts
     4. DInterrupts; long I/O wait
     5. EInterrupts; short I/O wait
151. 151The following figure demonstrates:

     

     1. AInterrupts; fast I/O wait
     2. BInterrupts; slow I/O wait
     3. CNo interrupts
     4. DInterrupts; long I/O wait
     5. EInterrupts; short I/O wait
152. 152The figure a) demonstrates the program timing diagram for:

     

     1. AInterrupts; fast I/O wait
     2. BInterrupts; slow I/O wait
     3. CNo interrupts
     4. DInterrupts; long I/O wait
     5. EInterrupts; short I/O wait
153. 153The figure b) demonstrates the program timing diagram for:

     1. AInterrupts; fast I/O wait
     2. BInterrupts; slow I/O wait
     3. CNo interrupts
     4. DInterrupts; long I/O wait
     5. EInterrupts; short I/O wait
154. 154We 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:

     1. ATs = H1*T1 + H2*T2 + (1-H2)*T3
     2. BTs = H1*T1 + (1-H1)*(H1*T1 + H2*(T1 + T2) + (1 - H2)*(T2 + T3))
     3. CTs = H1*T1 + (1-H1)*H2*(T2 + T3)
     4. DTs = H1*T1 + (1-H1)*(H2*(T1 + T2) + (1 - H2)*(T1 + T2 + T3))
155. 155This 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
156. 156If the accessed word is found in the faster memory, that is defined as a:

     1. Abingo
     2. Bwin
     3. Chit
     4. Devrika
157. 157If the accessed word is not found in the faster memory, that is defined as a:

     1. Amiss
     2. Bricochet
     3. Czero
     4. Dloss
158. 158The processor contains a single data register, called

     1. APSW
     2. BPC
     3. CIR
     4. DAC
159. 159Which register contains the instruction most recently fetched?

     1. Ainstruction register
     2. Bexecution register
     3. Cprogram counter
     4. Dprocess counter
160. 160This 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
161. 161Which 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
162. 162This 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
163. 163The 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:

     1. ADirect access memory (DMA)
     2. BManual memory access
     3. CInterrupt-driven I/O
     4. DProgrammed I/O
164. 164The 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:

     1. ADirect access memory (DMA)
     2. BManual memory access
     3. CInterrupt-driven I/O
     4. DProgrammed I/O
165. 165The figure below illustrates a partial program execution.
     Instruction in the IR will:

     

     1. ALoad 3 to AC from the memory
     2. BAdd 3 to AC from the memory
     3. CStore 3 to AC from the memory
     4. DAdd 2 to AC from the memory
166. 166The figure below illustrates a partial program execution.
     Instruction in the IR will:

     

     1. ALoad 3 to AC from the memory
     2. BAdd 3 to AC from the memory
     3. CStore 3 to AC from the memory
     4. DAdd 2 to AC from the memory
167. 167Choose the micro-instructions that reflect instruction execution stage shown in the figure below

     

     1. AIR -> MAR 941
        M -> MBR 0002
        MBR ->AC 0005
     2. BPC -> MAR 301
        M -> I/OBR 5941
        I/OBR 5941
     3. CIR -> MAR 941
        M -> MBR 0002
        MBR -> AC 0002
     4. DPC -> MAR 302
        M -> MBR 2941
        MBR -> IR 294
168. 168The processor is executing “Load AC from memory” instruction. Choose the correct micro-instruction:

     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
169. 169The following figure demonstrates:

     

     1. AInterrupts; fast I/O wait
     2. BInterrupts; slow I/O wait
     3. CNo interrupts
     4. DInterrupts; long I/O wait
     5. EInterrupts; short I/O wait
170. 170If 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
171. 171Complete 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
172. 172As one goes down the memory hierarchy following occurs:

     

     1. Aincreasing frequency of access to the memory by the processor
     2. Bincreasing cost per bit
     3. Cdecreasing access time
     4. Dincreasing capacity
173. 173User-visible registers minimize main memory references by optimizing register use

     1. ATrue
     2. BFalse
174. 174This 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
175. 175Which 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
176. 176The main disadvantages 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 access memory (DMA)
177. 177At 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
178. 178The smaller, more expensive, faster memory is:

     1. ACache
     2. BDisk drive
     3. CMain memory
     4. DRegister
179. 179The figure a) demonstrates the program timing diagram for:

     

     1. AInterrupts; fast I/O wait
     2. BInterrupts; slow I/O wait
     3. CNo interrupts
     4. DInterrupts; long I/O wait
     5. EInterrupts; short I/O wait
180. 180There were no OS with

     1. ASimple batch systems
     2. BSerial processing
     3. CTime-sharing-systems
     4. DMultiprogrammed batch systems
181. 181The 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
182. 182Serial processing was used

     1. AIn early 1960s
     2. BFrom late 1940s to the mid-1950s
     3. CFrom the mid-1950s to early 1960s
183. 183The programmer interacted directly with the computer hardware with

     1. ASimple batch systems
     2. BSerial processing
     3. CTime-sharing systems
     4. DMultiprogrammed batch systems
184. 184In operation 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
185. 185Choose the storage management responsibility for “The OS can achieve efficiency by assigning memory to jobs only as needed”

     1. AProcess isolation
     2. BProtection and access control
     3. CLong-term storage
     4. DSupport of modular programming
     5. EAutomatic allocation and management
186. 186The limit register:

     1. ADefines the size of the region of memory occupied by the process (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
187. 187In operating system security and protection, authenticity: 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
188. 188An application programs is developed by the

     1. AApplication programmer
     2. BEnd user
     3. COperating system
     4. DHardware
189. 189“The OS as a User/Computer interface” corresponds to the following objective

     1. AEfficiency
     2. BConvenience
     3. CAbility to evolve
190. 190Process is:

     1. AProgram in High level language kept on disk
     2. BContents of main memory
     3. CA job in secondary memory
     4. DA program in execution
191. 191If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called

     1. ASynchronous exclusion
     2. BCritical exclusion
     3. CAsynchronous exclusion
     4. DMutual exclusion
192. 192CTSS is illustrated in the figure There are four interactive users with the following memory requirements
     JOB1: 15000 words
     JOB2: 20000 words
     JOB3: 5000 words
     JOB4: 10000 words
     In (d) control is transferred back to the JOB1. A portion of JOB2, remaining in main memory is equal to

     

     1. A15000 words
     2. B20000 words
     3. C5000 words
     4. D25000 words
193. 193193. CTSS is illustrated in the figure There are four interactive users with the following memory requirements
     JOB1: 15000 words
     JOB2: 20000 words
     JOB3: 5000 words
     JOB4: 10000 words
     In (e) JOB4 is loaded. A portion of JOB1, remaining in main memory, is equal to

     

     1. A15000 words
     2. B20000 words
     3. C5000 words
     4. D25000 words
194. 194In operating system security and protection, сonfidentiality 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
195. 195In 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
196. 196When 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
197. 197This type of memory is nonvolatile:

     1. ARegister
     2. BSecondary memory
     3. CCache
     4. DMain memory
198. 198If 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
199. 199What is not a structural element of a computer system?

     1. ASystem bus
     2. BMain memory
     3. COperating system
     4. DProcessor
200. 200The 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

Beschreibung

Quiz am OS final, erstellt von Aidar Darmesh am 29/05/2017.

Autor

Aidar Darmesh

Sprache

English

Aufrufe

18

Bewertung

Noch keine Bewertungen

Bewerte dieses Quiz

Bewerte dieses Quiz

Mehr zu Processes, Threads and Communication