Operating System(Computer ) Questions and Answers

Question 1. Of the following which is the methods for allocating disks
  1.    Contiguous
  2.    Linked
  3.    Indexed
  4.    All of the above
Explanation:-
Answer: Option B. -> Linked
Answer: (b)
Question 2. In memory management :A-Fixed allocation policy, B-Variable allocation policy: 1-It gives a process a fixed number of frames in main memory within which to execute. 2-It allows the number of page frames allocated to a process to be varied over the life time of the process. 3-In it a number of allocated frames are decided at initial load time.
  1.    A - 1, 3, B - 2
  2.    A - 1, B - 3
  3.    A - 2, B - 1, 3
  4.    A - 1, 2, B - 3
Explanation:-
Answer: Option A. -> A - 1, 3, B - 2
Answer: (a)
Question 3. In the following processes: a = a + 1; b = 2 × b; b = b + 1; a = 2 × a; the output is.
  1.    a > b
  2.    a < b
  3.    a = b
  4.    None of these.
Explanation:-
Answer: Option D. -> None of these.
Answer: (d)
Question 4. Semaphores
  1.    are used to do I/O
  2.    Synchronize critical resources to prevent contention
  3.    synchronize critical resources to prevent deadlock.
  4.    allow processes to communicate with one another.
Explanation:-
Answer: Option C. -> synchronize critical resources to prevent deadlock.
Answer: (c)
Question 5. The page table that is maintained by operating system
  1.    Shows frame location for each page of the process
  2.    Shows actual address in main memory
  3.    Referrer memory location to memory
  4.    None of these.
Explanation:-
Answer: Option A. -> Shows frame location for each page of the process
Answer: (a)
Question 6. The Least Recently Used (LRU) policy
  1.    Replaces the page in memory that has not been referenced for the least time.
  2.    Replaces the page in memory that has not been referenced for the longest time.
  3.    Replaces the page in memory in round robin fashion.
  4.    None of these.
Explanation:-
Answer: Option B. -> Replaces the page in memory that has not been referenced for the longest time.
Answer: (b)
Question 7. Memory that is located on the disk either Hard or floppy is referred as
  1.    Virtual memory
  2.    Real memory
  3.    Main memory
  4.    None of these.
Explanation:-
Answer: Option A. -> Virtual memory
Answer: (a)
Question 8. In multi processor scheduling, independent parallelism indicates
  1.    There is synchronization among processes at gross level.
  2.    There is no explicit synchronization among processes.
  3.    A parallel processing or multi tasking is done within a single application.
  4.    None of these.
Explanation:-
Answer: Option B. -> There is no explicit synchronization among processes.
Answer: (b)
Question 9. A solution to the Dining Philosophers Problem which avoids deadlock is
  1.    ensure that all philosophers pick up the left fork before the right fork.
  2.    ensure that all philosophers pick up the right fork before the left fork.
  3.    ensure that one particular philosopher picks up the left fork before the right fork, and all other philosophers pick up the right fork before the left fork.
  4.    none of the above
Explanation:-
Answer: Option C. -> ensure that one particular philosopher picks up the left fork before the right fork, and all other philosophers pick up the right fork before the left fork.
Answer: (c)
Question 10. Program counter (PC) contains
  1.    Address of an instruction to be fetched
  2.    Instructions most recently fetched
  3.    Data to be written into memory
  4.    Data to be read from memory
Explanation:-
Answer: Option A. -> Address of an instruction to be fetched
Answer: (a)
© Lakshya_Education.com, All Right Reserved.
Contact Us services