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}}}$$

Most viewed questions in Operating System

47 votes
6 answers
92
Consider the $3$ processes, $P1, P2$ and $P3$ shown in the table. $$\small \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arrival Time} & \textbf{Time Units Req...
54 votes
7 answers
96
Let a memory have four free blocks of sizes $4k$, $8k$, $20k$, $2k$. These blocks are allocated following the best-fit strategy. The allocation requests are stored in a q...
31 votes
5 answers
104
Which of the following scheduling algorithms is non-preemptive?Round RobinFirst-In First-OutMultilevel Queue SchedulingMultilevel Queue Scheduling with Feedback
25 votes
6 answers
108
An operating system contains $3$ user processes each requiring $2$ units of resource $R$. The minimum number of units of $R$ such that no deadlocks will ever arise is$3$$...
24 votes
8 answers
109
2 votes
4 answers
110