Operating System Questions Answers - Chapter 1

• 8. Which among following scheduling algorithms give minimum average waiting time

  1. FCFS
  2. SJF
  3. Round robin
  4. On priority

  Answer And Explanation

  Answer: Option B

  • Comment on this question

• 9. Dirty bit is used to show

  1. Page with corrupted data
  2. Wrong page in memory
  3. Page that is modified after being loaded in the cache memory
  4. page that is less frequently accessed

  Answer And Explanation

  Answer: Option C

  • Comment on this question

• 10. In real time OS, which is most suitable scheduling scheme

  1. round robin
  2. FCFS
  3. pre-emptive scheduling
  4. random scheduling

  Answer And Explanation

  Answer: Option C

  • Comment on this question

• 11. Size of virtual memory depends on

  1. size of data bus
  2. size of address bus
  3. size of main memory
  4. none of above

  Answer And Explanation

  Answer: Option B

  • Comment on this question

• 12. Semophores are used to solve the problem of

  1. race condition
  2. process synchronization
  3. mutual exclusion
  4. belady problem

  Answer And Explanation

  Answer: Option C

  • Comment on this question

• 13. For multiprogramming operating system

  1. special support from processor is essential
  2. special support from processor is not essential
  3. cache memory is essential
  4. none of above

  Answer And Explanation

  Answer: Option B

  • Comment on this question

• 14. In which scheduling policies, context switching never takes place

  1. FCFS
  2. round robin
  3. Shortest job first
  4. Pre-empitive

  Answer And Explanation

  Answer: Option A

  • Comment on this question