Register

Web Page

System calls, Processes, Threads, Inter‐process communication, Concurrency and synchronization. Deadlock. CPU scheduling. Memory management and Virtual memory. File systems. Disks is also under this

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}& \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 2 &4&2&2&2&3&2&2&1&1&1&2.1&4
\\\hline\textbf{2 Marks Count} & 4 &1&3&4&4&3&2&2&4&3&1&3&4
\\\hline\textbf{Total Marks} & 10 &6&8&10&10&9&6&6&9&7&\bf{6}&\bf{8.1}&\bf{10}\\\hline
\end{array}}}$$

Filter

Recent questions in Operating System

1 votes
2 answers
4603
Memory management
On a system using fixed partition  with sizes 2^8, 2^16, 2^24, 2^32 and 2 ^ 64. How many bits must the limit register have ? a) 16 bits b)24 bits c)32 bits d) 64 bits
On a system using fixed partition  with sizes 2^8, 2^16, 2^24, 2^32 and 2 ^ 64. How many bits must the limit register have ?a) 16 bitsb)24 bitsc)32 bitsd) 64 bits
User Avatar
2 votes
1 answer
4604
In which of the following Indefinite blocking may occur
In which of the following order indefinite blocking may occur if we add and remove process from the list associated with a semaphore. a)LIFO b)FIFO
In which of the following order indefinite blocking may occur if we add and remove process from the list associated with a semaphore.a)LIFOb)FIFO
User Avatar
1 votes
2 answers
4606
FIFO belady anamoly
Is it always true that FIFO  will suffer from Belady Anamoly when i increase the frame number allocate from k to k + 1 .or it depends upon the reference string also ?
Is it always true that FIFO  will suffer from Belady Anamoly when i increase the frame number allocate from k to k + 1 .or it depends upon the reference string also ?
User Avatar
3 votes
3 answers
4607
why is the below state although being unsafe not leading to deadlock ?
I got the state to be unsafe since Available is (1,1) which can't satisfy the need of any process so why is not deadlock ?
I got the state to be unsafe since Available is (1,1) which can't satisfy the need of any process so why is not deadlock ?
User Avatar
3 votes
2 answers
4613
why is bankers algorithm less efficient than resource allocation graph algorithm ?
I am unable to get this logic since in both of these algorithms we need to have a record of future requirement of the processes so then why is it that resource allocation graph algorithm is more efficient ?
I am unable to get this logic since in both of these algorithms we need to have a record of future requirement of the processes so then why is it that resource allocation...
User Avatar
14 votes
11 answers
4614
ISRO2015-30
Semaphores are used to solve the problem of Race Condition Process Synchronization Mutual Exclusion None of the above I and II II and III All of the above None of the above
Semaphores are used to solve the problem ofRace ConditionProcess SynchronizationMutual ExclusionNone of the aboveI and IIII and IIIAll of the aboveNone of the above
User Avatar
11 votes
10 answers
4615
ISRO2015-38
Suppose two jobs, each of which needs $10$ minutes of CPU time, start simultaneously. Assume $50\%$ I/O wait time. How long will it take for both to complete, if they run sequentially? 10 20 30 40
Suppose two jobs, each of which needs $10$ minutes of CPU time, start simultaneously. Assume $50\%$ I/O wait time. How long will it take for both to complete, if they run...
User Avatar
2 votes
4 answers
4617
When ever a process is going running to blocked state its get pre-empted right ??
When ever a process is going running to blocked state its get pre-empted right ?? so this is also a preemptive scheduling ??
When ever a process is going running to blocked state its get pre-empted right ??so this is also a preemptive scheduling ??
User Avatar
6 votes
4 answers
4619
What is the average TAT??
Consider the processes P1, P2, P3 arrived in the sequence P2, P3, P1 and the burst time of the processes are 3, 3, 24 respectively. What is the average TAT??
Consider the processes P1, P2, P3 arrived in the sequence P2, P3, P1 and the burst time of the processes are 3, 3, 24 respectively. What is the average TAT??
User Avatar
Page: