download Mastguru Android App

Question Detail

Shortest Job First executes first the job

  • with the least processor needs
  • that first entered the queue
  • that has been in the queue for the longest
  • that last entered the queue
Similar Questions :

1. To avoid the race condition, the number of processes that may be simultaneously inside the critical section is

  • 12
  • 3
  • 1
  • 0

2. If the property of locality of reference is well pronounced in a program

  • the number of page faults will be more
  • the number of page faults will be less
  • the number of page faults will same
  • none of above

3. Four necessary conditions for deadlock are non pre-emption, circular wait, hold and wait and

  • mutual exclusion
  • race condition
  • buffer overflow
  • None of above

4. Dirty bit is used to show

  • Page with corrupted data
  • Wrong page in memory
  • Page that is modified after being loaded in the cache memory
  • page that is less frequently accessed

5. Reference bit is used for

  • Implementing LRU page replacement algorithm
  • Implementing NRU algorithm
  • To check the page table entry in the cache memory
  • none of above
Read more from - Operating System Questions Answers - Chapter 1
Post a comment