McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Common Topics in Competitive and Entrance exams .
| 251. |
Load time |
| A. | where the process will reside in memory, then absolute code can be generated |
| B. | where the process will reside in memory, then the compiler must generate relocatable memory |
| C. | if the process can be moved during its execution from one memory segment to another, then binding must be delayed until run time |
| D. | all of the above |
| Answer» B. where the process will reside in memory, then the compiler must generate relocatable memory | |
| 252. |
Fragmentation of the file system |
| A. | occurs only if the file system is used improperly |
| B. | can always be prevented |
| C. | can be temporarily removed by compaction |
| D. | is the characteristic of all files system |
| Answer» C. can be temporarily removed by compaction | |
| 253. |
Stub |
| A. | is included in the image for each library routine reference |
| B. | is small piece of code that indicates how to locate the appropriate memory resident library routine |
| C. | how to load the library if the routine is not already present |
| D. | all of the above |
| Answer» D. all of the above | |
| 254. |
Local replacement |
| A. | allows a process to select a replacement frame from the set of all frames |
| B. | requires that each process selects from only its own set of allocated frames |
| C. | both (A) and (B) above |
| D. | none of the above |
| Answer» B. requires that each process selects from only its own set of allocated frames | |
| 255. |
Thrashing |
| A. | the high paging activity |
| B. | is spending more time in paging than executing |
| C. | both A and B above |
| D. | none of the above |
| Answer» C. both A and B above | |
| 256. |
Thrashing can be avoided if |
| A. | the pages, belonging to the working set of the programs are in main memory |
| B. | the speed of CPU is increased |
| C. | the speed of I/O processor is increased |
| D. | all of the above |
| Answer» A. the pages, belonging to the working set of the programs are in main memory | |
| 257. |
The memory allocation scheme subject to external fragmentation is |
| A. | segmentation |
| B. | swapping |
| C. | pure demand paging |
| D. | multiple contiguous fixed partitions |
| Answer» A. segmentation | |
| 258. |
In virtual memory systems, dynamic address translation |
| A. | is the hardware necessary to implement paging |
| B. | stores pages at a specific location on disk |
| C. | is useless when swapping is used |
| D. | is the part of the operating system paging algorithm |
| Answer» A. is the hardware necessary to implement paging | |
| 259. |
Relocatable programs |
| A. | cannot be used with fixed partitions |
| B. | can be loaded almost anywhere in memory |
| C. | do not need a linker |
| D. | can be loaded only at one specific location |
| Answer» B. can be loaded almost anywhere in memory | |
| 260. |
Fixed partitions |
| A. | are very common in current operating systems |
| B. | are very efficient in memory utilization |
| C. | are very inefficient in memory utilization |
| D. | are most used on large mainframe operating systems |
| Answer» C. are very inefficient in memory utilization | |
| 261. |
Virtual system swapping |
| A. | allocates all of memory to one program |
| B. | pages working set pages in and out as a group |
| C. | is never as efficient as normal paging |
| D. | is used only on systems that are thrashing |
| Answer» D. is used only on systems that are thrashing | |
| 262. |
The term paging refers to |
| A. | boosting up the priority of a process in multilevel of queues without feedback |
| B. | gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blocking |
| C. | keeping track of the time a page has been in memory for the purpose of LRU replacement |
| D. | letting job reside in memory for a certain amount of time, so that the number of pages required can be estimated accurately |
| Answer» B. gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blocking | |
| 263. |
With a segmentation, if there are 64 segments, and the maximum segment size is 512 words, the length of the logical address in bits is |
| A. | 12 |
| B. | 14 |
| C. | 15 |
| D. | 16 |
| Answer» C. 15 | |
| 264. |
High paging rate |
| A. | may cause high I/O rate |
| B. | keeps the systems running well |
| C. | is a symptom of too much processor activity |
| D. | always creates a slow system |
| Answer» A. may cause high I/O rate | |
| 265. |
The total time to prepare a disk drive mechanism for a block of data to be read from it is |
| A. | seek time |
| B. | Latency |
| C. | latency plus seek time |
| D. | transmission time |
| Answer» C. latency plus seek time | |
| 266. |
Following illustrates Associative Memory |
| A. | The address of the data is supplied by the user |
| B. | Same as the tracks associated with disk memory |
| C. | No need for address; information is used as address |
| D. | Data is accessed serially |
| Answer» C. No need for address; information is used as address | |
| 267. |
A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth across the disk surface servicing all requests in its path, based on |
| A. | First Come First Served |
| B. | Shortest Seek Time First |
| C. | Sean |
| D. | None of these |
| Answer» C. Sean | |
| 268. |
Access to moving head disks requires three periods of delay before information is brought into memory. The response that correctly lists the three time delays for the physical access of data in the order of the relative speed from the slowest to the fastest is |
| A. | latency time, cache overhead time, seek time |
| B. | transmission time, latency time, seek time |
| C. | seek time, latency time, transmission time |
| D. | cache overhead time, latency time, seek time |
| Answer» C. seek time, latency time, transmission time | |
| 269. |
An unpaged cache associates disk domains with the address of the read and continues for a specific length. The major disadvantage of unpaged cache is that |
| A. | it allows cache domain to contain redundant data |
| B. | it does not allow writes to be cached |
| C. | its access time is greater than that of paged caching |
| D. | read ahead cache domain blocks are necessarily fixed in size |
| Answer» A. it allows cache domain to contain redundant data | |
| 270. |
UNIX recognizes following I/O devices |
| A. | Disk and Tape drives |
| B. | Terminals |
| C. | Communication lines |
| D. | All the above. |
| Answer» D. All the above. | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.