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

Recent questions in Operating System

#3221
4.1k
views
1 answers
0 votes
Test Series
Consider a system with logical address space of 4GB and page size is 8KB, physical address space is 256MB. How many bits required to access an entry in single level page ... page table respectively? A. 19, 15B. 15, 15C. 15, 19D. 19, 19
User Avatar
#3222
564
views
1 answers
0 votes
GB Gatebook_Mocktest2(OS)
Which of the following statements is FALSE?(A) Each thread has own stack(B) Starvation implies deadlock(C) Smaller page size increases the page table size(D) User level process can not modify its own page table entries
User Avatar
#3223
3.0k
views
1 answers
1 votes
frame size != page size
Consider a system with 2 level paging applicable the page table is divided into 8K pages each of size 16KB. The memory is byte addressable if the physical address ... inner and outer page table.How can frame size and page size be unequal?
User Avatar
#3224
2.7k
views
1 answers
0 votes
which of the following is true..??
Consider the following statements:S1 : Increasing the number of page frames allocated to a process sometime increase the page fault rate in FIFO page replacement policy ... trueC) Both S1 and S2 are trueD) Neither S1 and S2 are true
User Avatar
#3225
1.1k
views
4 answers
3 votes
Gatebook_Mocktest2(Operating Systems)
Process executes the following codefor (i=0;i<5,i++) for (j=0;j<5,j++) fork(); The no of child processes created is ?
User Avatar
#3226
213
views
0 answers
0 votes
Scheduling
User Avatar
#3227
1.8k
views
2 answers
2 votes
Maximum File Size
I am getting 282. Answer given is 256..??
User Avatar
#3228
468
views
1 answers
0 votes
How large of a disk can this file system support
User Avatar
#3229
509
views
0 answers
0 votes
ACE test
How can this be true...? I guess answer is b
User Avatar
#3230
1.8k
views
0 answers
0 votes
Semaphore
Let S be the binary semaphore variable S = 0 initially. Assume that no blocked processes exist in the system. The following signal (V), wait (P) operations are performed. The number of blocked ... 4 P, 6 V, 9 P, 13 V, 14 P
User Avatar
#3231
4.1k
views
2 answers
0 votes
Self Doubt (Semaphores)
struct Semaphore { enum value(0,1); Queue type L; } Down (Semaphore S) { if(S.value==1) { S.value=0; } else { put process(PCB) in S.L; sleep(); } } Up( ... part of Up and wakes P1 up. Now how will P1 enter the CS, since S.value is still 0?
User Avatar
#3232
815
views
1 answers
1 votes
demand paging
User Avatar
#3233
716
views
2 answers
2 votes
Memory management
(a) P3, Ps, P3, P2 (b)P2, P5, P3, 426k waits (c)P3, Ps, P2, 426k waits (d)P4, P2, P5, P3
User Avatar
#3234
585
views
2 answers
1 votes
Memory Management
Reply with solution as soon as possible...
User Avatar
#3235
1.5k
views
1 answers
1 votes
starvation
I'm looking for an explanation for thisSince no bounded waiting means a process waits while others can enter the system hence that process is starving and ... waitingI think I might be missing something so can you please highlight that
User Avatar
#3236
1.2k
views
1 answers
0 votes
memory allocation best fit..
User Avatar
#3237
644
views
2 answers
0 votes
Gate Practice
Q.1 VAS = 46 bit , Page size = 4KB , Page table entry = 4B ,3 level paging used ,1st level =12bits, 2nd level = 12bits,3rd level=10 bits(from right to left)Page ... level paging 1st = 12 bit ,2nd = 12 bit , 3rd = 10 bit Page table size.??
User Avatar
#3238
485
views
1 answers
2 votes
CPU Utilization
What are the factors to improve CPU Utilization? List Them.
User Avatar
#3239
518
views
1 answers
0 votes
NPTEL-Operating System-Week1-Quiz-2-Q14
State True or False . Please explain in 2 or 3 sentencesTemporal locality states if a page is accessed, then there is a high chance that the nearby pages will be accessed.
User Avatar
#3240
1.1k
views
1 answers
0 votes
NPTEL-Design and Analysis of Algorithms-Week1-Quiz-2-Q12
State true or false. When a user encounters a page fault, 1) The user application informs the OS, 2) User uses API calls to the hardware Memory Management ... unit brings the page from hard disk to main memory. Is Statement 2 correct ?
User Avatar
Page: