Question
a.
P-operator
b.
V-operator
c.
Semaphore
d.
Swapping
Posted under UGC NET computer science question paper Operating System
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. ………….. synchronizes critical resources to prevent dead lock.
Similar Questions
Discover Related MCQs
Q. …………….. is one of pre-emptive scheduling algorithm.
View solution
Q. In order to allow only one process to enter its critical section, binary semaphore are initialized to
View solution
Q. Remote Computing Service involves the use of time sharing and …………..
View solution
Q. Applications-software
View solution
Q. At any given time Parallel Virtual Machine (PVM) has ……………. send buffer and …………… receive buffer.
View solution
Q. In the process management Round-robin method is essentially the pre-emptive version of …………
View solution
Q. A page fault
View solution
Q. A semaphore count of negative n means (s = –n) that the queue contains ………….. waiting processes.
View solution
Q. A program is located in the smallest available hole in the memory is ……………
View solution
Q. With a four programs in memory and with 80% average I/O wait, the CPU utilization is?
View solution
Q. Assume N segments in memory and a page size of P bytes. The wastage on account of internal fragmentation is:
View solution
Q. Suppose it takes 100 ns to access a page table and 20 ns to access associative memory with a 90% hit rate, the average access time equals:
View solution
Q. Variable partition memory management technique with compaction results in:
View solution
Q. Four jobs J1, J2, J3 and J4 are waiting to be run. Their expected run times are 9, 6, 3 and 5 respectively. In order to minimize average response time, the jobs should be run in the order:
View solution
Q. Suppose it takes 100 ns to access page table and 20 ns to access associative memory. If the average access time is 28 ns, the corresponding hit rate is:
View solution
Q. N processes are waiting for I/O. A process spends a fraction p of its time in I/O wait state. The CPU utilization is given by:
View solution
Q. If holes are half as large as processes, the fraction of memory wasted in holes is:
View solution
Q. An example of a non pre-emptive scheduling algorithm is:
View solution
Q. An example of distributed OS is:
View solution
Q. In which of the following, ready to execute processes must be present in RAM?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Operating System? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
