Top 250+ Solved Operating System Advanced MCQ Questions Answer
Q. A Semaphore is initialized to
a. Negative integer value
b. Positive integer value
c. Non-negative integer value
d. Non-positive integer value.
Q. The wait operation
a. Decrements the semaphore value
b. Increments the semaphore value
c. Fixes the semaphore value
d. None of these.
Q. In semaphore, the process executing the wait is blocked if
a. The semaphore value becomes negative
b. The semaphore value become positive
c. The semaphore value becomes non-positive
d. The semaphore value becomes non- negative.
Q. In semaphore when the order of processes that are waiting to be removed from the queue is first in first out (FIFO) then it is called
a. Weak semaphore
b. Strong semaphore
c. Binary semaphore
d. None of these.
Q. The compaction is the technique in memory management that is used to over come
a. Internal fragmentation
b. External fragmentation
c. Both (A) and (B)
d. None of these.
Q. Physical address (absolute address) in memory partitioning is
a. Actual location in main memory
b. A reference to memory location independent of current assignment
c. A logical address
d. None of these.
Q. The frame
a. Can hold exactly one page of data
b. Can hold more than one page of data
c. Can hole two page of data
d. None of these.
Q. 82. In real time computing
a. The result of computation does not depend on the time at which computa- tion is done.
b. The result of computation also depends on the time at which computation is done.
Q. Match the following pairsA. Logical address(1) An actual location in main memoryB. Relative address(2) An address is expressed as a location relative to some known point.C. Physical address(3) A memory location independent of the current assignment of data to memory
a. A – 3, B – 2, C–1
b. A – 2, B – 1, C – 3
c. A – 3, B – 1, C – 2
d. A – 1, B – 2, C – 3
Q. 105. The Least Recently Used (LRU) policy
a. Replaces the page in memory that has not been referenced for the least time.
b. Replaces the page in memory that has not been referenced for the longest time.
c. Replaces the page in memory in round robin fashion.
d. None of these.
Q. Physical address in memory management is
a. Actual location in main memory
b. Memory location independent of current assignment of data to memory.
c. Memory location dependent to some known point.
d. None of these.
Q. Relative address in memory management is
a. Independent of some known point
b. Dependent to some known point
c. Actual location in the main memory
d. None of these.
Q. A Absolute loading B Re-locatable loading C Dynamic Run-Time loading; 1. For loader, load module, either is an absolute main memory address or specific address reference. 2. For loader, load modules have no absolute address. 3. For loader, load modules have all memory reference in relative form.
a. A – 1, B – 2, C – 3
b. A – 2, B – 3 , C – 1
c. A – 1, B – 3, C – 2
d. A – 3, B – 2, C – 1
Q. For Load-time dynamic linking
a. Load module (application module) to be loaded is read into memory.
b. Some of the linking is postponed until execution time.
c. External references to target modules remain in the loaded program.
d. None of these.
Q. In thread scheduling, load sharing is referred to
a. Simultaneous scheduling of threads that make up a single process.
b. Implicit scheduling defined by the assignment of threads to processors.
c. A global queue of ready thread is maintained and each processor, when idle, selects a thread from queue.
d. None of these.