search
Log In

Web Page

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

$$\small{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}&\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&3&2&2&1&1&1&2&3
\\\hline\textbf{2 Marks Count}&4&3&2&2&4&3&3&3&4
\\\hline\textbf{Total Marks}&10&9&6&6&9&7&\bf{6}&\bf{7.8}&\bf{10}\\\hline
\end{array}}}$$

Recent questions in Operating System

1 vote
4 answers
2
2 votes
3 answers
3
1 vote
2 answers
4
The seek time of a disk is $30$ ms. It rotates at the rate of $30$ rotations/second. The capacity of each track is $300$ words. The access time is (approximately) $62$ ms $60$ ms $50$ ms $47$ ms
asked Apr 2 in Operating System Lakshman Patel RJIT 100 views
1 vote
2 answers
5
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is recorded as follows. What is the number of Page Faults? $0100,0200,0430,0499,0510,0530,0560,0120,0220,0240,0260,0320,0370.$ $15,4$ $6,4$ $7,2$ $4,6$
asked Apr 1 in Operating System Lakshman Patel RJIT 149 views
2 votes
2 answers
7
Consider a system having $’m’$ resources of the same type. These resources are shared by $3$ processes $A,B,C;$ which have peak time demands of $3,4,6$ respectively. The minimum value of $’m’$ that ensures that deadlock will never occur is $11$ $12$ $13$ $14$
asked Apr 1 in Operating System Lakshman Patel RJIT 133 views
0 votes
1 answer
8
1 vote
1 answer
9
0 votes
1 answer
10
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is recorded as follows. What is the number of Page Faults? $0100,0200,0430,0510,0530,0560,0120,0220,0240,0260,0320,0370.$ $15,4$ $6,4$ $7,2$ $4,6$
asked Apr 1 in Operating System Lakshman Patel RJIT 72 views
0 votes
1 answer
11
Disk request come to a disk driver for cylinders in the order $10,22,20,2,40,6$ and $38,$ at a time when the disk drive is reading from cylinder $20$. The total seek time, if the disk arm scheduling algorithm is first-come-first-served is $900$ ms $850$ ms $360$ ms $876$ ms
asked Apr 1 in Operating System Lakshman Patel RJIT 96 views
1 vote
3 answers
12
If file size is large and if it is to be accessed randomly then which of the following allocation strategy should be best to use in a system? Linked allocation Indexed allocation Contiguous allocation None of the options
asked Mar 31 in Operating System Lakshman Patel RJIT 169 views
1 vote
2 answers
14
1 vote
1 answer
15
1 vote
1 answer
16
Process is in a ready state _______ . when process is scheduled to run after some execution when process is unable to run until some task has been completed when process is using the $CPU$ none of the options
asked Mar 31 in Operating System Lakshman Patel RJIT 163 views
0 votes
2 answers
17
1 vote
1 answer
19
1 vote
2 answers
20
In a particular system it is observed that, the cache performance gets improved as a result of increasing the block size of the cache. The primary reason behind this is : Programs exhibits temporal locality Programs have small working set Read operation is frequently required rather than write operation Programs exhibits spatial locality
asked Mar 31 in Operating System Lakshman Patel RJIT 166 views
...