Operating System Basics Questions and Answers

Practice Mode
Showing 10 of 563 questions
Q41
A binary semaphore
  • A has the values one or zero
  • B is essential to binary computers
  • C is used only for synchronisation
  • D is used only for mutual exclusion
Answer: Option A
Q42
_________ page replacement alogorithm suffers from Belady's anamoly.
  • A LRU
  • B MRU
  • C FIFO
  • D LIFO
Answer: Option C
Q43
_________ is a high speed cache used to hold recently referenced page table entries a part of paged virtual memory
  • A Translation Lookaside buffer
  • B Inverse page table
  • C Segmented page table
  • D All the above
Answer: Option A
Q44
_________ does the job of allocating a process to the processor.
  • A Long term scheduler
  • B Short term scheduler
  • C Medium term scheduler
  • D Dispatcher
Answer: Option D
Q45
In interactive environments such as time-sharing systems, the primary requirement is to provide reasonably good response time and in general, to share system resources equitably. In such situations, the scheduling algorithm that is most popularly applied is ________.
  • A Shortest Remaining Time Next (SRTN) Scheduling
  • B Priority Based Preemptive Scheduling
  • C Round Robin Scheduling
  • D None of the above
Answer: Option C
Q46
In the multi-programming environment, the main memory consisting of _________ number of process.
  • A Greater than 100
  • B Only one
  • C Greater than 50
  • D More than one
Answer: Option D
Q47
In a multithreaded environment _______.
  • A Each thread is allocated with new memory from main memory.
  • B Main thread terminates after the termination of child threads.
  • C Every process can have only one thread.
  • D None of the above
Answer: Option B
Q48
Which of the following statement is not true?
  • A Multiprogramming implies multitasking
  • B Multi-user does not imply multiprocessing
  • C Multitasking does not imply multiprocessing
  • D Multithreading implies multi-user
Answer: Option D
Q49
In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This voilates the _______________ condition of deadlock
  • A Mutual exclusion
  • B Hold and Wait
  • C Circular Wait
  • D No Preemption
Answer: Option C
Q50
In the ___________ method of data transfer, the participation of the processor is eliminated during data transfer.
  • A Buffering
  • B Caching
  • C Direct Memory Access
  • D Indirect Memory Access
Answer: Option C

📚 More from Technical

← All Topics 🎯 Practice ⏱️ Take Test 🔍 Search
Technical
Back to Technical
Other Subjects
Questions and Answers for Competitive Exams Various Entrance Test