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{2024-1} & \textbf{2024-2} &\textbf{2023}&  \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} &2&2&3& 2 &4&2&2&2.5&4
\\\hline\textbf{2 Marks Count} & 4&4&3&4 &1&3&1&3.16&4
\\\hline\textbf{Total Marks} & 10&10&9&10 &6&8&\bf{6}&\bf{8.83}&\bf{10}\\\hline
\end{array}}}$$

Filter

Recent questions in Operating System

0 votes
0 answers
104
os linux scheduling
Let the base priority of a system be 130 and the nice value provided is -10. What is the time slice that the process gets in the O(1) scheduling algorithm? if it should be 300 or 400.
Let the base priority of a system be 130 and the nice value provided is -10. What is the time slice that the process gets in the O(1) scheduling algorithm?if it should be...
User Avatar
0 votes
1 answer
106
NPTEL : Synchronisation (semaphore)
In a certain application, the initial value of a counting semaphore s is 10. The following operations were completed on the semaphore in the given order 5P, 20P, 2V, 18P, 5V, 10P, 1V. The new value of counting semaphore is _____________ ?
In a certain application, the initial value of a counting semaphore s is 10. The following operations were completed on the semaphore in the given order 5P, 20P, 2V, 18P,...
User Avatar
0 votes
2 answers
108
Memory Management And Paging
Can Any explain the relationship between The “ Word Size “ and “ Logical Address Space “
Can Any explain the relationship between The “ Word Size “ and “ Logical Address Space “
User Avatar
0 votes
2 answers
112
What's the standard technique to test if the algorithm satisfies mutual exclusion, progress and bounded waiting or not?
Sorry if this is a stupid question. But it really intrigued me. Same resources at different algorithms are telling different ways to test these stuffs.Here's an algorith...
User Avatar
0 votes
1 answer
114
OS handout
Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be processes. Suppose each process P[i] executes the following: P(i) { while(1) { P(m[i]); P(m[(i+1)%4]; <CS> V(m[i]); V(m[(i+1)%4]; } } What is the maximum no. Of processes that can be in<CS> .......
Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be processes.Suppose each process P[i] executes the following:P(i){ while(1) { P(m[i]); ...
User Avatar
1 votes
2 answers
115
OS handout
For following code how many times the '*' will printed? main() { int i,n ; for(i = 1 ; i<=n ; ++i) { fork(); printf("*"); } }
For following code how many times the '*' will printed?main(){ int i,n ; for(i = 1 ; i<=n ; ++i) { fork(); printf("*"); }}
User Avatar
0 votes
1 answer
116
Self doubt
Like other allocation techniques, does Overlaying technique uses MMU? And how address translation takes place and security is maintained in Overlaying ?
Like other allocation techniques, does Overlaying technique uses MMU? And how address translation takes place and security is maintained in Overlaying ?
User Avatar
Page: