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}}}$$

Recent questions in Operating System

#3381
1.2k
views
1 answers
0 votes
#3382
383
views
1 answers
0 votes
For n=0 : P1 :signal(n);wait(n);CS;signal(n);P2 : wait(n)CSsignal(n);For n=1;P1 :wait(n);CS;signal(n);P2:wait(n);CS;signal(n);Where i am wrong ?
#3383
434
views
0 answers
0 votes
#3384
1.0k
views
1 answers
0 votes
#3385
2.1k
views
6 answers
1 votes
My answer is 202given 232
#3386
348
views
2 answers
0 votes
#3387
169
views
0 answers
0 votes
In optimal non preemptive scheduling algorithm.-----------------------------------------------------------My approach --Process the requests according to minimal burst time of all pocess.is it correct???
#3388
315
views
0 answers
0 votes
Calculate the exponential averaging for the SJF with τ1=30, α=0.5 and previous runs as 2,4,6,8. Find the value T3
#3389
299
views
1 answers
1 votes
#3390
340
views
1 answers
0 votes
https://gradeup.co/synchronization-i-aa88478c-bb42-11e5-a5c3-3a0910926b62here in this artical the algorithm 2 which is flag solution for Critical solution problem ... i have searched they are saying progress only. please help to identify
#3392
463
views
0 answers
0 votes
Which of the following statement is correct?a. while a process is blocked on a semaphore's queue. it can be called as busy waiting.b. Circular ... not employ condition for deadlock, but not a sufficient condition. answer with example.
#3393
277
views
1 answers
1 votes
In a particular Unix Os, each data block is 256 bits, each node has 4 direct data block address and 3 additional addresses: one for single indirect block, one for ... bits ) is _________. what is k bits here? what will the exact answer??
#3394
1.2k
views
2 answers
6 votes
Consider the following piece of code which multiplies two matrices:int a[1024][1024], b[1024][1024], c[1024][1024]; multiply() { unsigned i, j, k; for ... size is 4096 and the TLB has 8 entries with a replacement policy consisting of LRU.
#3395
662
views
1 answers
1 votes
getting A) given D)
#3396
1.1k
views
0 answers
3 votes
A computer system has a 36-bit virtual address space with a page size of 8K, and 4 bytes per page table entry.What is the maximum size of ... system?doubt- How to determine physical memory when only logical address space is given?
#3397
397
views
1 answers
0 votes
what excectly the difference between these two questions?https://gateoverflow.in/1256/gate2007-58https://gateoverflow.in/8405/gate2015-3_10?show=8405#q8405
#3398
3.4k
views
2 answers
9 votes
In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bit8-bit6-bit8 bitWe use a 3-level page table, such that the ... address 0?How to solve such questions?? please someone answer it with proper explanation
#3399
438
views
1 answers
1 votes
Why option C is correct?
#3400
478
views
0 answers
2 votes
How long does it take to load a 64Kbytes Program from a disk whose Average Seek time is 30 ms Rotation time is 20 ms, Track Size is 32 Kbytes, Page Size is ... will be the % saving in time if 50% of the Pages of the program are Contiguous?