MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 557 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 301. |
The address of a page table in memory is pointed by |
| A. | stack pointer |
| B. | page table base register |
| C. | page register |
| D. | program counter |
| Answer» C. page register | |
| 302. |
Program always deals with |
| A. | logical address |
| B. | absolute address |
| C. | physical address |
| D. | relative address |
| Answer» B. absolute address | |
| 303. |
The page table contains |
| A. | base address of each page in physical memory |
| B. | page offset |
| C. | page size |
| D. | none of the mentioned |
| Answer» B. page offset | |
| 304. |
Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called? |
| A. | fragmentation |
| B. | paging |
| C. | mapping |
| D. | none of the mentioned |
| Answer» C. mapping | |
| 305. |
Run time mapping from virtual to physical address is done by |
| A. | memory management unit |
| B. | cpu |
| C. | pci |
| D. | none of the mentioned |
| Answer» B. cpu | |
| 306. |
Which one of the following is the address generated by CPU? |
| A. | physical address |
| B. | absolute address |
| C. | logical address |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 307. |
A memory buffer used to accommodate a speed differential is called |
| A. | stack pointer |
| B. | cache |
| C. | accumulator |
| D. | disk buffer |
| Answer» C. accumulator | |
| 308. |
CPU fetches the instruction from memory according to the value of |
| A. | program counter |
| B. | status register |
| C. | instruction register |
| D. | program status word |
| Answer» B. status register | |
| 309. |
Swap space is allocated |
| A. | as a chunk of disk |
| B. | separate from a file system |
| C. | into a file system |
| D. | all of the mentioned |
| Answer» B. separate from a file system | |
| 310. |
Swapping                be done when a process has pending I/O, or has to execute I/O operations only into operating system buffers. |
| A. | must |
| B. | can |
| C. | must never |
| D. | maybe |
| Answer» D. maybe | |
| 311. |
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 | |
| 312. |
The                  consists of all processes whose memory images are in the backing store or in memory and are ready to run. |
| A. | wait queue |
| B. | ready queue |
| C. | cpu |
| D. | secondary storage |
| Answer» C. cpu | |
| 313. |
Swapping requires a |
| A. | motherboard |
| B. | keyboard |
| C. | monitor |
| D. | backing store |
| Answer» E. | |
| 314. |
The backing store is generally a |
| A. | fast disk |
| B. | disk large enough to accommodate copies of all memory images for all users |
| C. | disk to provide direct access to the memory images |
| D. | all of the mentioned |
| Answer» E. | |
| 315. |
If execution time binding is being used, then a process              be swapped to a different memory space. |
| A. | has to be |
| B. | can never |
| C. | must |
| D. | may |
| Answer» E. | |
| 316. |
The run time mapping from virtual to physical addresses is done by a hardware device called the |
| A. | virtual to physical mapper |
| B. | memory management unit |
| C. | memory mapping unit |
| D. | none of the mentioned |
| Answer» C. memory mapping unit | |
| 317. |
The size of a process is limited to the size of |
| A. | physical memory |
| B. | external storage |
| C. | secondary storage |
| D. | none of the mentioned |
| Answer» B. external storage | |
| 318. |
The address loaded into the memory address register of the memory is referred to as |
| A. | physical address |
| B. | logical address |
| C. | neither physical nor logical |
| D. | none of the mentioned |
| Answer» B. logical address | |
| 319. |
In a system that does not support swapping |
| A. | the compiler normally binds symbolic addresses (variables) to relocatable addresses |
| B. | the compiler normally binds symbolic addresses to physical addresses |
| C. | the loader binds relocatable addresses to physical addresses |
| D. | binding of symbolic addresses to physical addresses normally takes place during execution |
| Answer» B. the compiler normally binds symbolic addresses to physical addresses | |
| 320. |
The address generated by the CPU is referred to as |
| A. | physical address |
| B. | logical address |
| C. | neither physical nor logical |
| D. | none of the mentioned |
| Answer» C. neither physical nor logical | |
| 321. |
If binding is done at assembly or load time, then the process            be moved to different locations after being swapped out and in again. |
| A. | can |
| B. | must |
| C. | can never |
| D. | may |
| Answer» D. may | |
| 322. |
The                        swaps processes in and out of the memory. |
| A. | memory manager |
| B. | cpu |
| C. | cpu manager |
| D. | user |
| Answer» B. cpu | |
| 323. |
The                        must design and program the overlay structure. |
| A. | programmer |
| B. | system architect |
| C. | system designer |
| D. | none of the mentioned |
| Answer» B. system architect | |
| 324. |
What is the advantage of dynamic loading? |
| A. | a used routine is used multiple times |
| B. | an unused routine is never loaded |
| C. | cpu utilization increases |
| D. | all of the mentioned |
| Answer» C. cpu utilization increases | |
| 325. |
The idea of overlays is to |
| A. | data that are needed at any given time |
| B. | enable a process to be larger than the amount of memory allocated to it |
| C. | keep in memory only those instructions |
| D. | all of the mentioned |
| Answer» E. | |
| 326. |
What is Dynamic loading? |
| A. | loading multiple routines dynamically |
| B. | loading a routine only when it is called |
| C. | loading multiple routines randomly |
| D. | none of the mentioned |
| Answer» C. loading multiple routines randomly | |
| 327. |
If the process can be moved during its execution from one memory segment to another, then binding must be |
| A. | delayed until run time |
| B. | preponed to compile time |
| C. | preponed to load time |
| D. | none of the mentioned |
| Answer» B. preponed to compile time | |
| 328. |
Binding of instructions and data to memory addresses can be done at |
| A. | compile time |
| B. | load time |
| C. | execution time |
| D. | all of the mentioned |
| Answer» E. | |
| 329. |
What is Address Binding? |
| A. | going to an address in memory |
| B. | locating an address with the help of another address |
| C. | binding two addresses together to form a new address in a different memory space |
| D. | a mapping from one address space to another |
| Answer» E. | |
| 330. |
What is the solution to starvation? |
| A. | the number of rollbacks must be included in the cost factor |
| B. | the number of resources must be included in resource preemption |
| C. | resource preemption be done instead |
| D. | all of the mentioned |
| Answer» B. the number of resources must be included in resource preemption | |
| 331. |
If the resources are always preempted from the same process                      can occur. |
| A. | deadlock |
| B. | system crash |
| C. | aging |
| D. | starvation |
| Answer» E. | |
| 332. |
To                to a safe state, the system needs to keep more information about the states of processes. |
| A. | abort the process |
| B. | roll back the process |
| C. | queue the process |
| D. | none of the mentioned |
| Answer» C. queue the process | |
| 333. |
If we preempt a resource from a process, the process cannot continue with its normal execution and it must be |
| A. | aborted |
| B. | rolled back |
| C. | terminated |
| D. | queued |
| Answer» C. terminated | |
| 334. |
Cost factors for process termination include |
| A. | number of resources the deadlock process is not holding |
| B. | cpu utilization at the time of deadlock |
| C. | amount of time a deadlocked process has thus far consumed during its execution |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 335. |
The process to be aborted is chosen on the basis of the following factors? |
| A. | priority of the process |
| B. | process is interactive or batch |
| C. | how long the process has computed |
| D. | all of the mentioned |
| Answer» E. | |
| 336. |
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 | |
| 337. |
The two ways of aborting processes and eliminating deadlocks are |
| A. | abort all deadlocked processes |
| B. | abort all processes |
| C. | abort one process at a time until the deadlock cycle is eliminated |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 338. |
A deadlock can be broken by |
| A. | abort one or more processes to break the circular wait |
| B. | abort all the process in the system |
| C. | preempt all resources from all processes |
| D. | none of the mentioned |
| Answer» B. abort all the process in the system | |
| 339. |
‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock |
| A. | can never occur |
| B. | may occur |
| C. | has to occur |
| D. | none of the mentioned |
| Answer» B. may occur | |
| 340. |
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock |
| A. | can never occur |
| B. | may occur |
| C. | has to occur |
| D. | none of the mentioned |
| Answer» B. may occur | |
| 341. |
A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is? |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 1 |
| Answer» B. 3 | |
| 342. |
Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify |
| A. | the set of processes that have been deadlocked |
| B. | the set of processes in the deadlock queue |
| C. | the specific process that caused the deadlock |
| D. | all of the mentioned |
| Answer» B. the set of processes in the deadlock queue | |
| 343. |
A deadlock eventually cripples system throughput and will cause the CPU utilization to |
| A. | increase |
| B. | drop |
| C. | stay still |
| D. | none of the mentioned |
| Answer» C. stay still | |
| 344. |
What is the disadvantage of invoking the detection algorithm for every request? |
| A. | overhead of the detection algorithm due to consumption of memory |
| B. | excessive time consumed in the request to be allocated memory |
| C. | considerable overhead in computation time |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 345. |
If deadlocks occur frequently, the detection algorithm must be invoked |
| A. | rarely |
| B. | frequently |
| C. | rarely & frequently |
| D. | none of the mentioned |
| Answer» C. rarely & frequently | |
| 346. |
If the wait for graph contains a cycle |
| A. | then a deadlock does not exist |
| B. | then a deadlock exists |
| C. | then the system is in a safe state |
| D. | either deadlock exists or system is in a safe state |
| Answer» C. then the system is in a safe state | |
| 347. |
An edge from process Pi to Pj in a wait for graph indicates that |
| A. | pi is waiting for pj to release a resource that pi needs |
| B. | pj is waiting for pi to release a resource that pj needs |
| C. | pi is waiting for pj to leave the system |
| D. | pj is waiting for pi to leave the system |
| Answer» B. pj is waiting for pi to release a resource that pj needs | |
| 348. |
The content of the matrix Need is |
| A. | allocation – available |
| B. | max – available |
| C. | max – allocation |
| D. | allocation – max |
| Answer» D. allocation – max | |
| 349. |
The data structures available in the Banker’s algorithm are |
| A. | available |
| B. | need |
| C. | allocation |
| D. | all of the mentioned |
| Answer» E. | |
| 350. |
The wait-for graph is a deadlock detection algorithm that is applicable when |
| A. | all resources have a single instance |
| B. | all resources have multiple instances |
| C. | all resources have a single 7 multiple instances |
| D. | all of the mentioned |
| Answer» B. all resources have multiple instances | |