Operating System MCQs
1K+ questions with answers
Scheduling is done so as to ____________
What is Turnaround time?
Scheduling is done so as to ____________
What is Waiting time?
What is Response time?
Round robin scheduling falls under the category of ____________
With round robin scheduling algorithm in a time shared system ____________
The portion of the process scheduler in an operating system that dispatches processes is concerned with ____________
Complex scheduling algorithms ____________
What is FIFO algorithm?
The strategy of making processes that are logically runnable to be temporarily suspended is called ____________
There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
Orders are processed in the sequence they arrive if _______ rule sequences the jobs.
Which of the following algorithms tends to minimize the process flow time?
Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________
Which of the following statements are true? (GATE 2010) I. Shortest remaining time first scheduling may cause starvation II. Preemptive scheduling may cause starvation III. Round robin is better than FCFS in terms of response time
Which is the most optimal scheduling algorithm?
The real difficulty with SJF in short term scheduling is ____________
The FCFS algorithm is particularly troublesome for ____________
Consider the following set of processes, the length of the CPU burst time given in milliseconds. Process P1 P2 P3 P4 Burst time 6 8 7 3
Preemptive Shortest Job First scheduling is sometimes called ____________
An SJF algorithm is simply a priority algorithm where the priority is ____________
What is ‘Aging’?
A solution to the problem of indefinite blockage of low – priority processes is ____________
Which of the following statements are true? (GATE 2010) i) Shortest remaining time first scheduling may cause starvation ii) Preemptive scheduling may cause starvation iii) Round robin is better than FCFS in terms of response time
Which of the following scheduling algorithms gives minimum average waiting time?
Concurrent access to shared data may result in ____________
A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called ____________
The segment of code in which the process may change common variables, update tables, write into files is known as ____________
Which of the following conditions must be satisfied to solve the critical section problem?
Mutual exclusion implies that ____________
Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section ____________
In the bakery algorithm to solve the critical section problem ____________
An un-interruptible unit is known as ____________
TestAndSet instruction is executed ____________
Semaphore is a/an _______ to solve the critical section problem.
What are the two atomic operations permissible on semaphores?
What are Spinlocks?
What is the main disadvantage of spinlocks?
The signal operation of the semaphore basically works on the basic _______ system call.
If the semaphore value is negative ____________
The code that changes the value of the semaphore is ____________
The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 = 1, S1 = 0, S2 = 0. Process P0 while(true) { wait(S0); print '0'; release(S1); release(S2); } Process P1 wait(S1); release(S0); Process P2 wait(S2); release(S0);
Two processes, P1 and P2, need to access a critical section of code. Consider the following synchronization construct used by the processes. Process P1 : while(true) { w1 = true; while(w2 == true); Critical section w1 = false; } Remainder Section Process P2 : while(true) { w2 = true; while(w1 == true); Critical section w2 = false; } Remainder Section
What will happen if a non-recursive mutex is locked more than once?
What is a semaphore?
What are the two kinds of semaphores?
What is a mutex?
At a particular time of computation the value of a counting semaphore is 7.Then 20 P operations and 15 V operations were completed on this semaphore. The resulting value of the semaphore is? (GATE 1987)
A binary semaphore is a semaphore with integer values ____________