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{2024-1} & \textbf{2024-2} &\textbf{2023}&  \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} &2&2&3& 2 &4&2&2&2.5&4
\\\hline\textbf{2 Marks Count} & 4&4&3&4 &1&3&1&3.16&4
\\\hline\textbf{Total Marks} & 10&10&9&10 &6&8&\bf{6}&\bf{8.83}&\bf{10}\\\hline
\end{array}}}$$

Filter

Recent questions in Operating System

30 votes
1 answer
4881
GATE CSE 2001 | Question: 1.12
A processor needs software interrupt to test the interrupt system of the processor implement co-routines obtain system services which need execution of privileged instructions return from subroutine
A processor needs software interrupt totest the interrupt system of the processorimplement co-routinesobtain system services which need execution of privileged instructio...
User Avatar
41 votes
6 answers
4887
GATE CSE 2000 | Question: 1.20, ISRO2008-47
Which of the following need not necessarily be saved on a context switch between processes? General purpose registers Translation look-aside buffer Program counter All of the above
Which of the following need not necessarily be saved on a context switch between processes?General purpose registersTranslation look-aside bufferProgram counterAll of the...
User Avatar
10 votes
2 answers
4888
GATE CSE 1992 | Question: 12-a
Draw the precedence graph for the concurrent program given below S1 parbegin begin S2:S4 end; begin S3; parbegin S5; begin S6:S8 end parend end; S7 parend; S9
Draw the precedence graph for the concurrent program given belowS1 parbegin begin S2:S4 end; begin S3; parbegin S5; begin S6:S8 end parend end; S7 parend; S9
User Avatar
24 votes
4 answers
4890
GATE CSE 1992 | Question: 02-xi
A computer system has $6$ tape devices, with n processes competing for them. Each process may need $3$ tape drives. The maximum value of n for which the system is guaranteed to be deadlock-free is: $2$ $3$ $4$ $1$
A computer system has $6$ tape devices, with n processes competing for them. Each process may need $3$ tape drives. The maximum value of n for which the system is guarant...
User Avatar
26 votes
5 answers
4891
GATE CSE 1992 | Question: 02,x, ISRO2015-35
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 : $42$ $2$ $7$ $12$
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 resu...
User Avatar
24 votes
1 answer
4894
GATE CSE 1991 | Question: 02-iii
Match the pairs in the following questions by writing the corresponding letters only. ...
Match the pairs in the following questions by writing the corresponding letters only.$$\begin{array}{|ll|ll|}\hline \text{(a)} & \text{Buddy system} & \text{(p)} & \tex...
User Avatar
16 votes
1 answer
4896
GATE CSE 1991 | Question: 01-xii
A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______
A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______
User Avatar
29 votes
3 answers
4898
GATE CSE 2008 | Question: 66
A process executes the following code for(i=0; i<n; i++) fork(); The total number of child processes created is $n$ $2^n-1$ $2^n$ $2^{n+1} - 1$
A process executes the following codefor(i=0; i<n; i++) fork();The total number of child processes created is$n$$2^n-1$$2^n$$2^{n+1} - 1$
User Avatar
Page: