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
4442
possible vales of variables ?
User Avatar
0 votes
2 answers
4443
partitoning
User Avatar
2 votes
1 answer
4444
File system
User Avatar
0 votes
0 answers
4446
fork
User Avatar
3 votes
2 answers
4447
deadlock
It the Resource-Allocation Graph contains $'m'$ types of resource and $'n'$ processes, then the time complexity of the algorithm for deciding whether the system is safe or unsafe is $O(n^2 \times m)$ $O(n \times m)$ $O(n^2 \times m^2)$ $O(n \times m^2)$
It the Resource-Allocation Graph contains $'m'$ types of resource and $'n'$ processes, then the time complexity of the algorithm for deciding whether the system is safe o...
User Avatar
1 votes
2 answers
4450
counting semaphore related question
A binary semaphore ensures mutual exclusion. Does a counting semaphore ensure mutual exclusion too? Please justify your answers.
A binary semaphore ensures mutual exclusion. Does a counting semaphore ensure mutual exclusion too?Please justify your answers.
User Avatar
2 votes
1 answer
4453
Can somebody explain me internal and external fragmentation in detail?
I always get confused between internal and external fragmentation.Is there any relation between them?pls explain in detail
I always get confused between internal and external fragmentation.Is there any relation between them?pls explain in detail
User Avatar
2 votes
2 answers
4454
avg SJF calculation
Calculate the exponential avg for the SJF when t1=10, alpha=0.5...previous run as 8,7,4,16
Calculate the exponential avg for the SJF when t1=10, alpha=0.5...previous run as 8,7,4,16
User Avatar
2 votes
2 answers
4456
PAGING
A Program of size 64MB is stored on disk which supports an average seek time of 30ms and rotation time of 20ms.Page size is 4MB and track size is 32MB. if the pages of program are contiguosly placed on disk then what would be the total time required to load the program from disk?
A Program of size 64MB is stored on disk which supports an average seek time of 30ms and rotation time of 20ms.Page size is 4MB and track size is 32MB. if the pages of pr...
User Avatar
1 votes
1 answer
4457
what will be the average instruction time?
If a page fault occurs on an average every 1000 instructions and average instruction time is 100ns without page fault and 100ms with page fault. what is average instruction time?
If a page fault occurs on an average every 1000 instructions and average instruction time is 100ns without page fault and 100ms with page fault. what is average instructi...
User Avatar
1 votes
1 answer
4458
PAGING:
Which is true? a.page size increases,page fault rate also increases b.Disk block size increases,throughput decreases. c.page size decreases,fragmentation increases. d.page size increases,page table size decreases.
Which is true?a.page size increases,page fault rate also increasesb.Disk block size increases,throughput decreases.c.page size decreases,fragmentation increases.d.page si...
User Avatar
Page: