Operating System MCQ’s With answers-Chapter 04

Posted by

Operating System MCQ’s with answer,  100% free MCQ PDF DOWNLOAD

61. A Semaphore is initialized to
(A) Negative integer value
(B) Positive integer value
(C) Non-negative integer value
(D) Non-positive integer value.

62. The wait operation
(A) Decrements the semaphore value
(B) Increments the semaphore value
(C) Fixes the semaphore value
(D) None of these.

63. 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 nonpositive
(D) The semaphore value becomes nonnegative.

64. 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.

65. In semaphore the process blocked by wait operation is unblocked if
(A) Semaphore value becomes nonnegative
(B) Semaphore value becomes nonpositive
(C) Semaphore value is negative
(D) Semaphore value is positive.

66. 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.

67. 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.

68. 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.

69. The page table that is maintained by operating system
(A) Shows frame location for each page of the process
(B) Shows actual address in main memory
(C) Referrer memory location to memory
(D) None of these.

70. Match the following pairs
A. Logical address
(1) An actual location in main memory
B. 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

71. The resident set of process is
(A) A process that are actually in main memory at anytime.
(B) A process that are actually in virtual memory at any time.
(C) A process that are actually in disk.
(D) None of these.

72. 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.

73. 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.

74. 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

75. 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.

76. 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.

77. The real time task
(A) The tasks that reacts to events that take place in out side world.
(B) The tasks that do not reacts to the outside world events.
(C) The tasks are independent of the time when it occurs.
(D) None of these.

78. Hard real-time tasks are
(A) A real time task that do not require dead line constraints.
(B) A real time task that requires dead line constraints.
(C) A task independent to time when it occurs.
(D) None of these.

79. The deterministic operating system
(A) Where operations are performed with in pre-determined time interval.
(B) Where operations can be performed with out pre-determined time interval.
(C) The operating time can not be determined.
(D) None of these.

80. In Responsive real time operating system
(A) The interruption is acknowledge and operating system response to interrupt.
(B) Once the operation starts no interrupt is acknowledge.
(C) The operation completes in fixed inter of time.
(D) None of these.


61. (C) 62. (A) 63. (A) 64. (B) 65. (B)
66. (B) 67. (A) 68. (A) 69. (A) 70. (A)
71. (A) 72. (A) 73. (B) 74. (A) 75. (A)
76. (C) 77. (A) 78. (B) 79. (A) 80. (A)