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

0 votes
1 answer
282
Self-doubt
We know vfork() shares parents memory.. Does vfork() shares parents resources also??. What about the clone()??
We know vfork() shares parents memory..Does vfork() shares parents resources also??.What about the clone()??
User Avatar
0 votes
1 answer
284
Gate Applied Test Series
Question→ Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___ Answer Given is: 1
Question→ Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will ...
User Avatar
0 votes
2 answers
285
#self doubt
In round-robin if one process finishes its time quantum and at the same time another process enters the system so which one will enter the ready queue first?
In round-robin if one process finishes its time quantum and at the same time another process enters the system so which one will enter the ready queue first?
User Avatar
0 votes
0 answers
288
#CSPC 2019 #OS 3rd edition
Given 1GB USB pen drive which is now formatted using i-node, assuming 32-bit addressing with 1Kbytes blocks with 4 bytes per block pointer. What is maximum file size the file system can store on the disk?
Given 1GB USB pen drive which is now formatted using i-node, assuming 32-bit addressing with 1Kbytes blocks with 4 bytes per block pointer. What is maximum file size the ...
User Avatar
0 votes
1 answer
289
Applied Test Series
Consider an indexed file allocation using index nodes (inodes). An inode contains among other things, 7 indexes, one indirect index, one double index, and one triple index. If the disk sector is 512 bytes, which is the closest option for maximum file size in this allocation scheme?
Consider an indexed file allocation using index nodes (inodes). An inode contains among other things, 7 indexes, one indirect index, one double index, and one triple inde...
User Avatar
1 votes
1 answer
290
#Self Doubt OS CPU scheduling?
Does non preemptive CPU scheduling needs hardware support. kindly explain.
Does non preemptive CPU scheduling needs hardware support.kindly explain.
User Avatar
0 votes
0 answers
292
Multi-level Paging
In paging , giving more bits to the innermost table as compared to the outermost page table results in using less physical memory space. Is this statement true always?
In paging , giving more bits to the innermost table as compared to the outermost page table results in using less physical memory space. Is this statement true always?
User Avatar
0 votes
0 answers
295
#unversity exam
If there are ‘n’ processes in a system, with the time-quanta less than the CPU burst times of all these processes in a given round, then the number of preemptions is at least: (A) 2n (B) n (C) 2n–1 (D) n–1
If there are ‘n’ processes in a system, with the time-quanta less than the CPU burst times of allthese processes in a given round, then the number of preemptions is a...
User Avatar
0 votes
1 answer
296
Applied Gate Test Series Question
Consider the following code segments, the total number of processes (including the initial process) is ______.
Consider the following code segments, the total number of processes (including the initial process) is ______.
User Avatar
0 votes
0 answers
300
self-doubt operating-system semaphore
given solution is wait(P) , wait(Q), wait(p) , wait(Q) for s1,s2,s3,s4 respectively I know this implementation is deadlock free just want to ask if it will follow bounded waiting and progress and how both of them are different?
given solution is wait(P) , wait(Q), wait(p) , wait(Q) for s1,s2,s3,s4 respectivelyI know this implementation is deadlock free just want to ask if it will follow bounded ...
User Avatar
Page: