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

Most answered questions in Operating System

1 votes
4 answers
264
Calculate the number of levels of outer page required
In a paged virtual memory organization with 32 bit virtual address and 1 KB page size PTE is 32 bits. The number of levels of paging required to limit the outer page table fit in one page frame is ________
In a paged virtual memory organization with 32 bit virtual address and 1 KB page size PTE is 32 bits. The number of levels of paging required to limit the outer page tab...
User Avatar
4 votes
4 answers
265
Fork
what if the program like this(t1 is copied to all or printf will copied to all child) main() { t1=0,t2=0; t2=fork(); Fork(); Printf("Hi"); Fork(); t1=Fork(); Printf("hi"); } Arjun sir , I don't know the buffer concept.please explain with tree method. How many child and how many time Hi printed.
what if the program like this(t1 is copied to all or printf will copied to all child)main(){t1=0,t2=0;t2=fork();Fork();Printf("Hi");Fork();t1=Fork();Printf("hi");}Arjun s...
User Avatar
6 votes
4 answers
266
Question on process state transition
Answer to the above question is (C). I am unable to understand that how can a process in ready state can get blocked. Please give an explanation.
Answer to the above question is (C). I am unable to understand that how can a process in ready state can get blocked. Please give an explanation.
User Avatar
3 votes
4 answers
267
OS
Which of the following disk scheduling policies results in the minimum amount of head movement? (A) FCFS (B) Circular scan (C) Elevator
Which of the following disk scheduling policies results in the minimum amount of head movement?(A) FCFS(B) Circular scan(C) Elevator
User Avatar
2 votes
4 answers
270
When ever a process is going running to blocked state its get pre-empted right ??
When ever a process is going running to blocked state its get pre-empted right ?? so this is also a preemptive scheduling ??
When ever a process is going running to blocked state its get pre-empted right ??so this is also a preemptive scheduling ??
User Avatar
6 votes
4 answers
271
What is the average TAT??
Consider the processes P1, P2, P3 arrived in the sequence P2, P3, P1 and the burst time of the processes are 3, 3, 24 respectively. What is the average TAT??
Consider the processes P1, P2, P3 arrived in the sequence P2, P3, P1 and the burst time of the processes are 3, 3, 24 respectively. What is the average TAT??
User Avatar
8 votes
4 answers
273
ISRO2009-77
When a process is rolled back as a result of deadlock the difficulty which arises is Starvation System throughput Low device utilization Cycle stealing
When a process is rolled back as a result of deadlock the difficulty which arises isStarvationSystem throughputLow device utilizationCycle stealing
User Avatar
2 votes
4 answers
274
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
5 votes
4 answers
278
process sync
const int n = 5; int count = 0; void test(){ for i = 1 to n count += 2; } main() { Par begin test(); test(); test(); Par end } What can be the maximum and minimum value of count after completion of the program?
const int n = 5; int count = 0; void test(){ for i = 1 to n count += 2; } main() { Par begin test(); test(); test(); Par end }What can be the maximum and minimum value of...
User Avatar
5 votes
4 answers
279
'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
1 votes
4 answers
280
Segmentation
Segmentation may contain a) Internal fragmentation b) External fragmentation c) Both d) None Also please explain the answer...
Segmentation may contain a) Internal fragmentationb) External fragmentationc) Both d) NoneAlso please explain the answer...
User Avatar
Page: