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 viewed questions in Operating System

28 votes
7 answers
152
GATE CSE 2017 Set 2 | Question: 33
A system shares $9$ ... describes current state of the system? Safe, Deadlocked Safe, Not Deadlocked Not Safe, Deadlocked Not Safe, Not Deadlocked
A system shares $9$ tape drives. The current allocation and maximum requirement of tape drives for that processes are shown below:$$\begin{array}{ccc} \textbf{Process} &...
User Avatar
22 votes
5 answers
153
GATE CSE 2014 Set 3 | Question: 31
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is _________.
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks nev...
User Avatar
0 votes
1 answer
155
Consider the relation R(A,B,C,D) with dependencies AB -> C, ABC -> D and AC ->>- B.
R is not in 3NF R is in 3NF but not in BCNF R is in BCNF but not in 4NF R is in 4NF How to approach this ques ?
R is not in 3NF R is in 3NF but not in BCNF R is in BCNF but not in 4NF R is in 4NF How to approach this ques ?
User Avatar
5 votes
2 answers
157
ISRO2017-71
At a particular time the value of counting semaphore is 10. It will become 7 after: 3 V operations 3 P operations 5 V operations and 2 P operations 2 V operations and 5 P operations
At a particular time the value of counting semaphore is 10. It will become 7 after:3 V operations3 P operations5 V operations and 2 P operations2 V operations and 5 P ope...
User Avatar
32 votes
4 answers
164
GATE CSE 1997 | Question: 3.9
Thrashing reduces page I/O decreases the degree of multiprogramming implies excessive page I/O improve the system performance
Thrashingreduces page I/Odecreases the degree of multiprogrammingimplies excessive page I/Oimprove the system performance
User Avatar
39 votes
4 answers
165
GATE CSE 1995 | Question: 1.15
Which scheduling policy is most suitable for a time shared operating system? Shortest Job First Round Robin First Come First Serve Elevator
Which scheduling policy is most suitable for a time shared operating system?Shortest Job FirstRound RobinFirst Come First ServeElevator
User Avatar
4 votes
2 answers
166
Context switches in round robin
Here what are the number of context switches ? Is it 5 or 6? Do we consider context switch before P1 (i.e during the start) ?
Here what are the number of context switches ? Is it 5 or 6? Do we consider context switch before P1 (i.e during the start) ?
User Avatar
32 votes
2 answers
167
GATE CSE 1993 | Question: 7.8
The root directory of a disk should be placed at a fixed address in main memory at a fixed location on the disk anywhere on the disk at a fixed location on the system disk anywhere on the system disk
The root directory of a disk should be placedat a fixed address in main memoryat a fixed location on the diskanywhere on the diskat a fixed location on the system diskany...
User Avatar
28 votes
3 answers
168
GATE CSE 1993 | Question: 7.10
Assume that the following jobs are to be executed on a single processor system ... time (completion time) for job $p$ if scheduling is round robin with time slice $1$ $4$ $10$ $11$ $12$ None of the above
Assume that the following jobs are to be executed on a single processor system$$\begin{array}{|c|c|} \hline \textbf{Job Id} & \textbf{CPU Burst Time} \\\hline \text{p} ...
User Avatar
0 votes
4 answers
170
Finding hit ratio
Cache access time Tc = 100 ns Memory access time Tm = 500 ns If the effective access time is 10% greater than the cache access time, what is the hit ratio H? (A) 89% (B) 91% (C) 98% (D) 95%
Cache access time Tc = 100 nsMemory access time Tm = 500 nsIf the effective access time is 10% greater than the cache access time, what is the hit ratio H?(A) 89%(B) 91%(...
User Avatar
Page: