GATE CS Operating System questions
Practise Operating System questions for GATE CS. Explore official PYQs and original subject-wise quizzes, check answers and view available solutions. Free, no sign-in.
Trace the state changes explicitly. For scheduling, memory and synchronisation questions, record the given policy before calculating the result.
Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.
20 on this page
A CPU has two modes -- privileged and non-privileged. In order to change the mode from privileged to non-privileged
A processor needs software interrupt to
Which of the following statements is false?
Which of the following is not a valid deadlock prevention scheme?
Suppose the time to service a page fault is on the average milliseconds, while a memory access takes microsecond. Then a hit ratio results in average memory access time of
Let be mutexes (binary semaphores) and be processes. Suppose each process executes the following: wait (m[i]); wait (m(i+1) mod 4]); ........... release (m[i]); release (m(i+1) mod 4]); This could cause
Which of the following need not necessarily be saved on a context switch between processes?
Raid configurations of the disks are used to provide
Which of the following actions is/are typically not performed by the operating system when switching context from process to process ?
Which of the following is/are advantage(s) of virtual memory?
A multi-user, multi-processing operating system cannot be implemented on hardware that does not support
System calls are usually invoked by using
Which of the following disk scheduling strategies is likely to give the best throughput?
Listed below are some operating system abstractions (in the left column) and the hardware components (in the right column) …
In a computer system where the ‘best-fit’ algorithm is used for allocating ‘jobs’ to ‘memory partitions’, the following situation was encountered: …
If an instruction takes microseconds and a page fault takes an additional microseconds, the effective instruction time if on the average a page fault occurs every instruction is:
Consider processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes seconds, what must be the quantum size such that the overhead resulting from process switching is minimized but at the same time each process is guaranteed to get its turn at the CPU at least every seconds?
The overlay tree for a program is as shown below: What will be the size of the partition (in physical memory) required to load (and run) this program?
Formatting for a floppy disk refers to
A computer has six tape drives, with processes competing for them. Each process may need two drives. What is the maximum value of for the system to be deadlock free?