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
4683
Consider the relation R(A,B,C,D) with dependencies AB -> C, ABC -> D and AC ->>- B.
R is not in 3NF R is in 3NF but not in BCNF R is in BCNF but not in 4NF R is in 4NF How to approach this ques ?
R is not in 3NF R is in 3NF but not in BCNF R is in BCNF but not in 4NF R is in 4NF How to approach this ques ?
User Avatar
4 votes
3 answers
4685
ISRO2014-66
Consider a system where each file is associated with a 16 bit number. For each file, each user should have the read and write capability. How much memory is needed to store each user's access data? 16 KB 32 KB 64 KB 128 KB
Consider a system where each file is associated with a 16 bit number. For each file, each user should have the read and write capability. How much memory is needed to sto...
User Avatar
0 votes
1 answer
4687
Average memory acces time
User Avatar
0 votes
3 answers
4688
No. of bits in physical and logical address space
Is it possible to have different number of pages and frames or they need to be equal in number?
Is it possible to have different number of pages and frames or they need to be equal in number?
User Avatar
0 votes
2 answers
4690
What is the output?
a) x = 1, y = 2 b) x = 1, y = 3 c) x = 4, y = 6 Multiple options can be selected
a) x = 1, y = 2b) x = 1, y = 3c) x = 4, y = 6Multiple options can be selected
User Avatar
0 votes
1 answer
4693
Starvation is possible or not?
User Avatar
5 votes
4 answers
4696
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
1 votes
1 answer
4698
Question number 5.24
Question 5.24
Question 5.24
User Avatar
5 votes
4 answers
4699
'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
6 answers
4700
UGC NET CSE | December 2013 | Part 2 | Question: 49
How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size? 332.8 KB 83.6 KB 266.2 KB 256.6 KB
How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size?332.8 KB83.6 KB266.2 KB256.6 KB
User Avatar
Page: