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

Most answered questions in Operating System

41 votes
6 answers
81
GATE IT 2004 | Question: 64
A process executes the following segment of code : for(i = 1; i <= n; i++) fork (); The number of new processes created is $n$ $((n(n + 1))/2)$ $2^n - 1$ $3^n - 1$
A process executes the following segment of code :for(i = 1; i <= n; i++) fork ();The number of new processes created is$n$$((n(n + 1))/2)$$2^n - 1$$3^n - 1$
User Avatar
68 votes
6 answers
83
GATE IT 2006 | Question: 56
For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ ... $\text{S < P < T}$ $\text{S < T < P}$ $\text{T < S < P}$
For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ and the number of segments are given below.$$\small \begin{array}{|c|c|c|}\h...
User Avatar
61 votes
6 answers
87
GATE CSE 2010 | Question: 45
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$ ... $P0$ print '$0$'? At least twice Exactly twice Exactly thrice Exactly once
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$$$\begin{array}{|l|l|}\hli...
User Avatar
25 votes
6 answers
88
GATE CSE 1997 | Question: 6.7
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$ $5$ $4$ $6$
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$$...
User Avatar
47 votes
6 answers
93
GATE CSE 2012 | Question: 31
Consider the $3$ processes, $P1, P2$ and $P3$ ... $P1, P3, P2$ FCFS: $P1, P2, P3$ RR2: $P1, P3, P2$ FCFS: $P1, P3, P2$ RR2: $P1, P2, P3$
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...
User Avatar
23 votes
6 answers
96
GATE CSE 1999 | Question: 2-18, ISRO2008-46
Raid configurations of the disks are used to provide Fault-tolerance High speed High data density (A) & (B)
Raid configurations of the disks are used to provideFault-tolerance High speedHigh data density(A) & (B)
User Avatar
29 votes
6 answers
97
GATE CSE 1999 | Question: 1.10
Which of the following disk scheduling strategies is likely to give the best throughput? Farthest cylinder next Nearest cylinder next First come first served Elevator algorithm
Which of the following disk scheduling strategies is likely to give the best throughput?Farthest cylinder nextNearest cylinder nextFirst come first servedElevator algorit...
User Avatar
Page: