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.
| 51. |
The main memory accommodates |
| A. | operating system |
| B. | cpu |
| C. | user processes |
| D. | all of the mentioned |
| Answer» B. cpu | |
| 52. |
Paging increases the time. |
| A. | waiting |
| B. | execution |
| C. | context – switch |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 53. |
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 | |
| 54. |
There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round- Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms? |
| A. | tq = 15ms |
| B. | tq = 40ms |
| C. | tq = 45ms |
| D. | tq = 50ms |
| Answer» B. tq = 40ms | |
| 55. |
If one or more devices use a common set of wires to communicate with the computer system, the connection is called |
| A. | cpu |
| B. | monitor |
| C. | wirefull |
| D. | bus |
| Answer» E. | |
| 56. |
Under multiprogramming, turnaround time for short jobs is usually and that for long jobs is slightly |
| A. | lengthened; shortened |
| B. | shortened; lengthened |
| C. | shortened; shortened |
| D. | shortened; unchanged |
| Answer» C. shortened; shortened | |
| 57. |
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 | |
| 58. |
The backing store is generally a |
| A. | fast disk |
| B. | disk large enough to accommodate copies of all memory imagesfor all users |
| C. | disk to provide direct access to the memory images |
| D. | all of the mentioned |
| Answer» E. | |
| 59. |
In fixed size partition, the degree of multiprogramming is bounded by |
| A. | the number of partitions |
| B. | the cpu utilization |
| C. | the memory size |
| D. | all of the mentioned |
| Answer» B. the cpu utilization | |
| 60. |
The time taken to move the disk arm to the desired cylinder is called the |
| A. | positioning time |
| B. | random access time |
| C. | seek time |
| D. | rotational latency |
| Answer» D. rotational latency | |
| 61. |
Segment replacement algorithms are more complex than page replacement algorithms because |
| A. | segments are better than pages |
| B. | pages are better than segments |
| C. | segments have variable sizes |
| D. | segments have fixed sizes |
| Answer» D. segments have fixed sizes | |
| 62. |
Sometimes the overhead of keeping track of a hole might be |
| A. | larger than the memory |
| B. | larger than the hole itself |
| C. | very small |
| D. | all of the mentioned |
| Answer» C. very small | |
| 63. |
A parent process calling system call will be suspended until children processes terminate. |
| A. | wait |
| B. | fork |
| C. | exit |
| D. | exec |
| Answer» B. fork | |
| 64. |
When the page fault rate is low |
| A. | the turnaround time increases |
| B. | the effective access time increases |
| C. | the effective access time decreases |
| D. | turnaround time & effective access time increases |
| Answer» D. turnaround time & effective access time increases | |
| 65. |
The can be turned off by the CPU before the execution of critical instruction sequences that must not be interrupted. |
| A. | nonmaskable interrupt |
| B. | blocked interrupt |
| C. | maskable interrupt |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 66. |
What is the objective of multiprogramming? |
| A. | have a process running at all time |
| B. | have multiple programs waiting in a queue ready to run |
| C. | to increase cpu utilization |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 67. |
To enable a process to wait within the monitor |
| A. | a condition variable must be declared as condition |
| B. | condition variables must be used as boolean objects |
| C. | semaphore must be used |
| D. | all of the mentioned |
| Answer» B. condition variables must be used as boolean objects | |
| 68. |
A procedure defined within a can access only those variables declared locally within the and its formal parameters. |
| A. | process, semaphore |
| B. | process, monitor |
| C. | semaphore, semaphore |
| D. | monitor, monitor |
| Answer» E. | |
| 69. |
If the offset is legal |
| A. | it is used as a physical memory address itself |
| B. | it is subtracted from the segment base to produce the physical memory address |
| C. | it is added to the segment base to produce the physical memory address |
| D. | none of the mentioned |
| Answer» B. it is subtracted from the segment base to produce the physical memory address | |
| 70. |
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 | |
| 71. |
Semaphores are mostly used to implement |
| A. | system calls |
| B. | ipc mechanisms |
| C. | system protection |
| D. | none of the mentioned |
| Answer» C. system protection | |
| 72. |
Data cannot be written to secondary storage unless written within a |
| A. | file |
| B. | swap space |
| C. | directory |
| D. | text format |
| Answer» B. swap space | |
| 73. |
The keeps state information about the use of I/O components. |
| A. | cpu |
| B. | os |
| C. | kernel |
| D. | shell |
| Answer» D. shell | |
| 74. |
For an effective operating system, when to check for deadlock? |
| A. | every time a resource request is made |
| B. | at fixed time intervals |
| C. | every time a resource request is made at fixed time intervals |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 75. |
The scheme used in the above question is known as or |
| A. | sector sparing & forwarding |
| B. | forwarding & sector utilization |
| C. | backwarding & forwarding |
| D. | sector utilization & backwarding |
| Answer» B. forwarding & sector utilization | |
| 76. |
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. | |
| 77. |
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 | |
| 78. |
In indirect communication between |
| A. | there is another process r to handle and pass on the messages between p and q |
| B. | there is another machine between the two processes to help communication |
| C. | there is a mailbox to help communication between p and q |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 79. |
A minimum of variable(s) is/are required to be shared between processes to solve the critical section problem. |
| A. | one |
| B. | two |
| C. | three |
| D. | four |
| Answer» C. three | |
| 80. |
The transfer between CPU and Cache is |
| A. | block transfer |
| B. | word transfer |
| C. | set transfer |
| D. | associative transfer |
| Answer» C. set transfer | |
| 81. |
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 | |
| 82. |
Users that their processes are running on a paged system. |
| A. | are aware |
| B. | are unaware |
| C. | may unaware |
| D. | none of the mentioned |
| Answer» C. may unaware | |
| 83. |
A system is in a safe state only if there exists a |
| A. | safe allocation |
| B. | safe resource |
| C. | safe sequence |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 84. |
is the concept in which a process is copied into the main memory from the secondary memory according to the requirement. |
| A. | paging |
| B. | demand paging |
| C. | segmentation |
| D. | swapping |
| Answer» C. segmentation | |
| 85. |
Buffering is done to |
| A. | cope with device speed mismatch |
| B. | cope with device transfer size mismatch |
| C. | maintain copy semantics |
| D. | all of the mentioned |
| Answer» E. | |
| 86. |
In the Many to One model, multiple threads are unable to run in parallel on multiprocessors because of |
| A. | only one thread can access the kernel at a time |
| B. | many user threads have access to just one kernel thread |
| C. | there is only one kernel thread |
| D. | none of the mentioned |
| Answer» B. many user threads have access to just one kernel thread | |
| 87. |
The request and release of resources are |
| A. | command line statements |
| B. | interrupts |
| C. | system calls |
| D. | special programs |
| Answer» D. special programs | |
| 88. |
A keyboard is an example of a device that is accessed through a interface. |
| A. | block stream |
| B. | set of blocks |
| C. | character stream |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 89. |
For non sharable resources like a printer, mutual exclusion |
| A. | must exist |
| B. | must not exist |
| C. | may exist |
| D. | none of the mentioned |
| Answer» B. must not exist | |
| 90. |
The entry of all the PCBs of the current processes is in |
| A. | process register |
| B. | program counter |
| C. | process table |
| D. | process unit |
| Answer» D. process unit | |
| 91. |
The system periodically performs checkpoints that consists of the following operation(s) |
| A. | putting all the log records currently in main memory onto stable storage |
| B. | putting all modified data residing in main memory onto stable storage |
| C. | putting a log record onto stable storage |
| D. | all of the mentioned |
| Answer» E. | |
| 92. |
When the event for which a thread is blocked occurs? |
| A. | thread moves to the ready queue |
| B. | thread remains blocked |
| C. | thread completes |
| D. | a new thread is provided |
| Answer» B. thread remains blocked | |
| 93. |
The memory implemented using the semiconductor chips is |
| A. | cache |
| B. | main |
| C. | secondary |
| D. | registers |
| Answer» C. secondary | |
| 94. |
The resource allocation graph is not applicable to a resource allocation system |
| A. | with multiple instances of each resource type |
| B. | with a single instance of each resource type |
| C. | single & multiple instances of each resource type |
| D. | none of the mentioned |
| Answer» B. with a single instance of each resource type | |
| 95. |
A state is safe, if |
| A. | the system does not crash due to deadlock occurrence |
| B. | the system can allocate resources to each process in some order and still avoid a deadlock |
| C. | the state keeps the system protected and safe |
| D. | all of the mentioned |
| Answer» C. the state keeps the system protected and safe | |
| 96. |
The primary distinction between the short term scheduler and the long term scheduler is |
| A. | the length of their queues |
| B. | the type of processes they schedule |
| C. | the frequency of their execution |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 97. |
The process in which a file is partitioned into smaller parts and different parts are stored in different disks is |
| A. | raid |
| B. | mirroring |
| C. | stripping |
| D. | raid classification |
| Answer» D. raid classification | |
| 98. |
An SJF algorithm is simply a priority algorithm where the priority is |
| A. | the predicted next cpu burst |
| B. | the inverse of the predicted next cpu burst |
| C. | the current cpu burst |
| D. | anything the user wants |
| Answer» B. the inverse of the predicted next cpu burst | |
| 99. |
When a process begins execution with no pages in memory? |
| A. | process execution becomes impossible |
| B. | a page fault occurs for every page brought into memory |
| C. | process causes system crash |
| D. | none of the mentioned |
| Answer» C. process causes system crash | |
| 100. |
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 | |