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

Recent questions in Operating System

0 votes
1 answer
151
Operating System
In Dining philosopher's problem, there are 8 number of diners and X number of chopsticks. What is the minimum value of X which ensures that therewill be no deadlock Note: Even number philosopher takes left fork first and odd number philosopher takes right fork first.
In Dining philosopher's problem, there are 8 number of diners and X number of chopsticks. What is the minimum value of X which ensures that therewill be no deadlock Note:...
User Avatar
0 votes
2 answers
152
Operating System(Process)
A process executes the following segment of code: int main(){ fork(); fork() && fork(); } The number of new processes created is
A process executes the following segment of code: int main(){fork();fork() && fork();}The number of new processes created is
User Avatar
0 votes
1 answer
153
OS
By default the memory address starts with 0. But they have considered from 1. What should I consider when nothing is mentioned?
By default the memory address starts with 0. But they have considered from 1.What should I consider when nothing is mentioned?
User Avatar
0 votes
1 answer
154
Fork() | OS
int doWork(){ fork(); fork(); printf("Hello world!\n"); } int main() { doWork(); printf("Hello world!\n"); exit(0); }
int doWork(){ fork(); fork(); printf("Hello world!\n");}int main() { doWork(); printf("Hello world!\n"); exit(0);}
User Avatar
0 votes
1 answer
156
Operating System
When a page is referred for the first time, then it will be counted in page fault or not?. E.g page reference 1,2,3,4,2,1. LRU is used with 3 frames(initially empty).
When a page is referred for the first time, then it will be counted in page fault or not?.E.g page reference 1,2,3,4,2,1.LRU is used with 3 frames(initially empty).
User Avatar
1 votes
1 answer
158
#Self doubt
Since Dealock --> No Progress then Does Progess --> No Deadlock bcoz contrapositive should be true.
Since Dealock No Progressthen Does Progess No Deadlockbcoz contrapositive should be true.
User Avatar
2 votes
2 answers
161
Self Doubt
Can Safe state in DeadLock Avoidance Mechanism always guarantee No DeadLock??
Can Safe state in DeadLock Avoidance Mechanism always guarantee No DeadLock??
User Avatar
0 votes
1 answer
163
Operating System
What is the relationship between paging and virtual memory? A Virtual memory came before paging B When pages are created in disks, it is called a virtual memory? C Virtual memory can never be implemented without paging D Both have the same concepts
What is the relationship between paging and virtual memory?A Virtual memory came before pagingB When pages are created in disks, it is called a virtual memory? C Virtual ...
User Avatar
0 votes
2 answers
168
Zeal Testseries
I’m getting 2 as the answer, but the correct one given by them is 5. Somebody please confirm.
I’m getting 2 as the answer, but the correct one given by them is 5.Somebody please confirm.
User Avatar
1 votes
2 answers
170
DRDO CSE 2022 Paper 2 | Question: 2
What is the size of the physical address space in a paging system, which has a page table containing $64$ entries of $11$ bit each (including valid and invalid bit) and a page size of $256$ bytes.
What is the size of the physical address space in a paging system, which has a page table containing $64$ entries of $11$ bit each (including valid and invalid bit) and a...
User Avatar
Page: