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

49 votes
4 answers
3
GATE CSE 2001 | Question: 2.21
Consider a machine with $64$ MB physical memory and a $32$-bit virtual address space. If the page size s $4$ KB, what is the approximate size of the page table? $\text{16 MB}$ $\text{8 MB}$ $\text{2 MB}$ $\text{24 MB}$
Consider a machine with $64$ MB physical memory and a $32$-bit virtual address space. If the page size s $4$ KB, what is the approximate size of the page table?$\text{16 ...
User Avatar
3 votes
2 answers
4
Operating systems efficiency
CPU Efficiency is very less in case of: (a) Batch OS (b) Multi-Programming OS (c) Multi-tasking OS (d) Multi-Processing OS
CPU Efficiency is very less in case of:(a) Batch OS (b) Multi-Programming OS(c) Multi-tasking OS(d) Multi-Processing OS
User Avatar
35 votes
2 answers
8
GATE CSE 2005 | Question: 22, ISRO2015-36
Increasing the RAM of a computer typically improves performance because: Virtual Memory increases Larger RAMs are faster Fewer page faults occur Fewer segmentation faults occur
Increasing the RAM of a computer typically improves performance because:Virtual Memory increasesLarger RAMs are fasterFewer page faults occurFewer segmentation faults occ...
User Avatar
2 votes
4 answers
9
which of the following is not a necessary condition for deadlock?
which of the following is not a necessary condition for deadlock? a)Mutual exclusion b)Reentrancy c)Hold and Wait d)No pre-emption
which of the following is not a necessary condition for deadlock?a)Mutual exclusionb)Reentrancyc)Hold and Waitd)No pre-emption
User Avatar
49 votes
10 answers
14
GATE CSE 2015 Set 2 | Question: 23
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could lead to a deadlock? $1$ $2$ $3$ $4$
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could l...
User Avatar
5 votes
2 answers
16
ISRO2013-55
Consider a logical address space of $8$ pages of $1024$ words each, mapped onto a physical memory of $32$ frames. How many bits are there in the physical address and logical address respectively? $5, 3$ $10, 10$ $15, 13$ $15, 15$
Consider a logical address space of $8$ pages of $1024$ words each, mapped onto a physical memory of $32$ frames. How many bits are there in the physical address and logi...
User Avatar
5 votes
4 answers
18
'm' processes share 'n' resources of same type. The maximum need of each process does not exceed 'n' and the sum all their maximum needs is always less than m+n. In this setup deadlock can occur or not?
This is a question from Operating System concepts by Silberschatz, Gagne and Galvin. On very first go I could make that in such a situation deadlock can never occur. But ...
User Avatar
35 votes
6 answers
20
GATE CSE 2015 Set 3 | Question: 1
The maximum number of processes that can be in $\textit{Ready}$ state for a computer system with $n$ CPUs is : $n$ $n^2$ $2^n$ Independent of $n$
The maximum number of processes that can be in $\textit{Ready}$ state for a computer system with $n$ CPUs is :$n$$n^2$$2^n$Independent of $n$
User Avatar
Page: