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

#2881
342
views
1 answers
1 votes
Let P1 and P2 are two processes , the Context Switch happens from P1 to P2 .Meaning : Now what happens is CPU saves the state of P1 and loads the state of ... where CPU can find all these information ? Is it available in PCB or in Stack?
#2882
4.2k
views
1 answers
6 votes
A computer system has a page size of 1,024 bytes and maintains the page table for each process in main memory. The overhead required for doing a ... hit-rate is required to ensure an average virtual address translation time of 200ns?
#2883
2.4k
views
1 answers
0 votes
If the executing program size is greater than the existing $RAM$ of a computer, it is still possible to execute the program if the $OS$ supports :multitasking virtual memory paging system none of the above
#2884
1.4k
views
1 answers
0 votes
In which of the following, ready to execute processes must be present in $RAM$ ?multiprocessing multiprogramming multitasking all of the above
#2885
2.1k
views
1 answers
1 votes
Which of the following $OS$ treats hardware as a file system?$UNIX$ $DOS$ $Windows$ $NT$ None of the above
#2886
647
views
1 answers
0 votes
Assume N segments in memory and a page size of P bytes. The wastage on account of internal fragmentation is:
#2887
2.2k
views
1 answers
0 votes
#2888
1.8k
views
0 answers
1 votes
An example of a non pre-emptive scheduling algorithm is :Round Robin Priority SchedulingShortest job first 2 level scheduling
#2889
808
views
2 answers
1 votes
If holes are half as large as processes, the fraction of memory wasted in holes is :$2/3$ $1/2$ $1/3$ $1/5$
#2890
1.9k
views
2 answers
0 votes
N processes are waiting for $I/O$. A process spends a fraction $p$ of its time in $I/O$ wait state. The $CPU$ utilization is given by :1-p-N 1-pN pN p-N
#2891
209
views
0 answers
0 votes
Can any one describe from starting following thingsIs CPU generate virtual bits and cache bits ?How virtual bits are used to get mapping of cache bits & vice versa?
#2892
1.2k
views
1 answers
0 votes
Four jobs J1, J2, J3 and J4 are waiting to be run. Their expected run times are 9, 6, 3 and 5 respectively. In order to minimize average response time, the jobs should be run in the ... J2 J1(C) J3 J4 J1 J2 (D) J3 J4 J2 J1
#2893
136
views
0 answers
0 votes
#2894
192
views
0 answers
0 votes
#2896
1.2k
views
1 answers
2 votes
1.Does starvation-freedom imply deadlock-freedom? 2. Does starvation-freedom imply bounded-waiting?3. Does bounded-waiting imply starvation-freedom?4. ... deadlock-freedom imply starvation-freedom?5.does no bounded waiting imply starvation?
#2897
428
views
1 answers
0 votes
Without the TLB, in the paging every data/instruction access requires two memory accessesOne for the page table and one for the data / instruction .Can any one explain it with diagram (if possible)?
#2898
350
views
0 answers
0 votes
statepage tablefiles openprocess id ..?
#2899
1.9k
views
0 answers
0 votes
Variable partition memory management technique with compaction results in :Reduction of fragmentation Minimal wastage Segment sharing None of the above
#2900
1.9k
views
2 answers
0 votes
what is meant by disk block address ??