MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1690 Mcqs, each offering curated multiple-choice questions to sharpen your Technical Programming knowledge and support exam preparation. Choose a topic below to get started.
| 101. |
What is the host controller? |
| A. | controller built at the end of each disk |
| B. | controller at the computer end of the bus |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» C. all of the mentioned | |
| 102. |
The time in a swap out of a running process and swap in of a new process into the memory is very high. |
| A. | context – switch |
| B. | waiting |
| C. | execution |
| D. | all of the mentioned |
| Answer» B. waiting | |
| 103. |
The portion of the processor which contains the hardware required to fetch the operations is |
| A. | datapath |
| B. | processor |
| C. | control |
| D. | output unit |
| Answer» B. processor | |
| 104. |
Those processes should be aborted on occurrence of a deadlock, the termination of which? |
| A. | is more time consuming |
| B. | incurs minimum cost |
| C. | safety is not hampered |
| D. | all of the mentioned |
| Answer» C. safety is not hampered | |
| 105. |
The real difficulty with SJF in short term scheduling is |
| A. | it is too good an algorithm |
| B. | knowing the length of the next cpu request |
| C. | it is too complex to understand |
| D. | none of the mentioned |
| Answer» C. it is too complex to understand | |
| 106. |
In the bounded buffer problem, there are the empty and full semaphores that |
| A. | count the number of empty and full buffers |
| B. | count the number of empty and full memory spaces |
| C. | count the number of empty and full queues |
| D. | none of the mentioned |
| Answer» B. count the number of empty and full memory spaces | |
| 107. |
Which of the following page replacement algorithms suffers from Belady’s Anomaly? |
| A. | optimal replacement |
| B. | lru |
| C. | fifo |
| D. | both optimal replacement and fifo |
| Answer» D. both optimal replacement and fifo | |
| 108. |
The model in which one kernel thread is mapped to many user-level threads is called |
| A. | many to one model |
| B. | one to many model |
| C. | many to many model |
| D. | one to one model |
| Answer» B. one to many model | |
| 109. |
A deadlock free solution to the dining philosophers problem |
| A. | necessarily eliminates the possibility of starvation |
| B. | does not necessarily eliminate the possibility of starvation |
| C. | eliminates any possibility of any kind of problem further |
| D. | none of the mentioned |
| Answer» C. eliminates any possibility of any kind of problem further | |
| 110. |
Virtual memory allows |
| A. | execution of a process that may not be completely in memory |
| B. | a program to be smaller than the physical memory |
| C. | a program to be larger than the secondary storage |
| D. | execution of a process without being in physical memory |
| Answer» B. a program to be smaller than the physical memory | |
| 111. |
What does USB stand for? |
| A. | universal signal board |
| B. | universal signal bus |
| C. | universal serial bus |
| D. | universal serial board |
| Answer» D. universal serial board | |
| 112. |
Division by zero, accessing a protected or non existent memory address, or attempting to execute a privileged instruction from user mode are all categorized as |
| A. | errors |
| B. | exceptions |
| C. | interrupt handlers |
| D. | all of the mentioned |
| Answer» C. interrupt handlers | |
| 113. |
If the thread pool contains no available thread |
| A. | the server runs a new process |
| B. | the server goes to another thread pool |
| C. | the server demands for a new pool creation |
| D. | the server waits until one becomes free |
| Answer» E. | |
| 114. |
What are the operations that can be invoked on a condition variable? |
| A. | wait & signal |
| B. | hold & wait |
| C. | signal & hold |
| D. | continue & signal |
| Answer» B. hold & wait | |
| 115. |
When there is a large logical address space, the best way of paging would be |
| A. | not to page |
| B. | a two level paging algorithm |
| C. | the page table itself |
| D. | all of the mentioned |
| Answer» C. the page table itself | |
| 116. |
The larger the block size, the the internal fragmentation. |
| A. | greater |
| B. | lesser |
| C. | same |
| D. | none of the mentioned |
| Answer» B. lesser | |
| 117. |
What is a mutex? |
| A. | is a binary mutex |
| B. | must be accessed from only one process |
| C. | can be accessed from multiple processes |
| D. | none of the mentioned |
| Answer» C. can be accessed from multiple processes | |
| 118. |
The time taken for the desired sector to rotate to the disk head is called |
| A. | positioning time |
| B. | random access time |
| C. | seek time |
| D. | rotational latency |
| Answer» E. | |
| 119. |
The relocation register helps in |
| A. | providing more address space to processes |
| B. | a different address space to processes |
| C. | to protect the address spaces of processes |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 120. |
The segment limit contains the |
| A. | starting logical address of the process |
| B. | starting physical address of the segment in memory |
| C. | segment length |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 121. |
A parent process calling system call will be suspended until children processes terminate. |
| A. | wait |
| B. | fork |
| C. | exit |
| D. | exec |
| Answer» B. fork | |
| 122. |
A monitor is characterized by |
| A. | a set of programmer defined operators |
| B. | an identifier |
| C. | the number of variables in it |
| D. | all of the mentioned |
| Answer» B. an identifier | |
| 123. |
A deadlock avoidance algorithm dynamically examines the to ensure that a circular wait condition can never exist. |
| A. | resource allocation state |
| B. | system storage state |
| C. | operating system |
| D. | resources |
| Answer» B. system storage state | |
| 124. |
For larger page tables, they are kept in main memory and a points to the page table. |
| A. | page table base register |
| B. | page table base pointer |
| C. | page table register pointer |
| D. | page table base |
| Answer» B. page table base pointer | |
| 125. |
Storage of firmware is |
| A. | cache memory |
| B. | ram |
| C. | external |
| D. | rom |
| Answer» E. | |
| 126. |
The disadvantage of a process being allocated all its resources before beginning its execution is |
| A. | low cpu utilization |
| B. | low resource utilization |
| C. | very high resource utilization |
| D. | none of the mentioned |
| Answer» C. very high resource utilization | |
| 127. |
The operating system maintains a table that keeps track of how many frames have been allocated, how many are there, and how many are available. |
| A. | page |
| B. | mapping |
| C. | frame |
| D. | memory |
| Answer» D. memory | |
| 128. |
The heads of the magnetic disk are attached to a that moves all the heads as a unit. |
| A. | spindle |
| B. | disk arm |
| C. | track |
| D. | none of the mentioned |
| Answer» C. track | |
| 129. |
What are the two steps of a process execution? |
| A. | i/o & os burst |
| B. | cpu & i/o burst |
| C. | memory & i/o burst |
| D. | os & memory burst |
| Answer» C. memory & i/o burst | |
| 130. |
What is ‘Aging’? |
| A. | keeping track of cache contents |
| B. | keeping track of what pages are currently residing in memory |
| C. | keeping track of how many times a given page is referenced |
| D. | increasing the priority of jobs to ensure termination in a finite time |
| Answer» E. | |
| 131. |
CPU scheduling is the basis of |
| A. | multiprocessor systems |
| B. | multiprogramming operating systems |
| C. | larger memory sized systems |
| D. | none of the mentioned |
| Answer» C. larger memory sized systems | |
| 132. |
An un-interruptible unit is known as |
| A. | single |
| B. | atomic |
| C. | static |
| D. | none of the mentioned |
| Answer» C. static | |
| 133. |
If there are 32 segments, each of size 1Kb, then the logical address should have |
| A. | 13 bits |
| B. | 14 bits |
| C. | 15 bits |
| D. | 16 bits |
| Answer» B. 14 bits | |
| 134. |
All unsafe states are |
| A. | deadlocks |
| B. | not deadlocks |
| C. | fatal |
| D. | none of the mentioned |
| Answer» C. fatal | |
| 135. |
Whenever the data is found in the cache memory it is called as |
| A. | hit |
| B. | miss |
| C. | found |
| D. | error |
| Answer» B. miss | |
| 136. |
In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the: |
| A. | blocked state |
| B. | ready state |
| C. | suspended state |
| D. | terminated state |
| Answer» C. suspended state | |
| 137. |
The systems which allow only one process execution at a time, are called |
| A. | uniprogramming systems |
| B. | uniprocessing systems |
| C. | unitasking systems |
| D. | none of the mentioned |
| Answer» C. unitasking systems | |
| 138. |
A fork system call will fail if |
| A. | the previously executed statement is also a fork call |
| B. | the limit on the maximum number of processes in the system would be executed |
| C. | the limit on the minimum number of processes that can be under execution by a single user would be executed |
| D. | all of the mentioned |
| Answer» C. the limit on the minimum number of processes that can be under execution by a single user would be executed | |
| 139. |
Instead of starting a new thread for every task to execute concurrently, the task can be passed to a |
| A. | process |
| B. | thread pool |
| C. | thread queue |
| D. | none of the mentioned |
| Answer» C. thread queue | |
| 140. |
The first linux kernel which supports the SMP hardware? |
| A. | linux 0.1 |
| B. | linux 1.0 |
| C. | linux 1.2 |
| D. | linux 2.0 |
| Answer» E. | |
| 141. |
When the target thread periodically checks if it should terminate and terminates itself in an orderly manner, it is called? |
| A. | asynchronous cancellation |
| B. | systematic cancellation |
| C. | sudden termination |
| D. | deferred cancellation |
| Answer» E. | |
| 142. |
A swapper manipulates whereas the pager is concerned with individual of a process. |
| A. | the entire process, parts |
| B. | all the pages of a process, segments |
| C. | the entire process, pages |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 143. |
The hardware mechanism that allows a device to notify the CPU is called |
| A. | polling |
| B. | interrupt |
| C. | driver |
| D. | controlling |
| Answer» C. driver | |
| 144. |
If a kernel thread performs a blocking system call, |
| A. | the kernel can schedule another thread in the application for execution |
| B. | the kernel cannot schedule another thread in the same application for execution |
| C. | the kernel must schedule another thread of a different application for execution |
| D. | the kernel must schedule another thread of the same application on a different processor |
| Answer» B. the kernel cannot schedule another thread in the same application for execution | |
| 145. |
The is used as an index into the page table. |
| A. | frame bit |
| B. | page number |
| C. | page offset |
| D. | frame offset |
| Answer» C. page offset | |
| 146. |
If a process needs I/O to or from a disk, and if the drive or controller is busy then |
| A. | the request will be placed in the queue of pending requests for that drive |
| B. | the request will not be processed and will be ignored completely |
| C. | the request will be not be placed |
| D. | none of the mentioned |
| Answer» B. the request will not be processed and will be ignored completely | |
| 147. |
In virtual memory, which is not a page replacement algorithm ? |
| A. | FIFO |
| B. | BFS |
| C. | LRU |
| D. | Optimal |
| Answer» C. LRU | |
| 148. |
The three ways in which a process responds to a signal are |
| A. | ignoring the signal |
| B. | handling the signal |
| C. | performing some default action |
| D. | all of the mentioned |
| Answer» E. | |
| 149. |
What is Turnaround time? |
| A. | the total waiting time for a process to finish execution |
| B. | the total time spent in the ready queue |
| C. | the total time spent in the running queue |
| D. | the total time from the completion till the submission of a process |
| Answer» E. | |
| 150. |
In general the two interrupt request lines are |
| A. | maskable & non maskable interrupts |
| B. | blocked & non maskable interrupts |
| C. | maskable & blocked interrupts |
| D. | none of the mentioned |
| Answer» B. blocked & non maskable interrupts | |