Top 250+ Solved Operating System Advanced MCQ Questions Answer
Q. The memory allocation scheme subject to external fragmentation is
a. segmentation
b. swapping
c. pure demand paging
d. multiple contiguous fixed partitions
Q. In virtual memory systems, dynamic addresstranslation
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
Q. 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
Q. 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
Q. 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
Q. 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
Q. 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
Q. The total time to prepare a disk drivemechanism for a block of data to be read from it is
a. seek time
b. Latency
c. latency plus seek time
d. transmission time
Q. 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
Q. 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
Q. 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
Q. 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
Q. UNIX recognizes following I/O devices
a. Disk and Tape drives
b. Terminals
c. Communication lines
d. All the above.
Q. The cluster is a case of
a. Distributed memory
b. Shared memory
c. Master/slave architecture
d. Symmetric multi processor.