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

#3141
5.7k
views
2 answers
4 votes
ISRO2017-52
Given reference to the following pages by a program0,9,0,1,8,1,8,7,8,7,1,2,8,2,7,8,2,3,8,3How many page faults will occur if the program has three page frames available to it and uses an optimal replacement?789None of the above
User Avatar
#3142
9.1k
views
5 answers
15 votes
ISRO2017-51
Wha is the output of the following program?main() { int a = 10; if(fork()) == 0)) a++; printf("%d\n",a); }10 and 11101111 and 11
User Avatar
#3143
5.8k
views
2 answers
8 votes
ISRO2017-48
What problem is solved by Dijikstra banker' algorithm?Mutual exclusionDeadlock recoveryDeadlock avoidanceCache coherence
User Avatar
#3144
13.7k
views
2 answers
5 votes
ISRO2017-71
At a particular time the value of counting semaphore is 10. It will become 7 after:3 V operations3 P operations5 V operations and 2 P operations2 V operations and 5 P operations
User Avatar
#3145
4.0k
views
2 answers
2 votes
cpu scheduling -SRTF with I/O example
Pno. AT BT1 I/O BT21 0 3 2 22 0 2 4 13 ... 2 2 1 We are using SRTF scheduling algorithm with I/O. Please give me the gantt chart.
User Avatar
#3146
493
views
0 answers
1 votes
GradeUp - ISRO Test
Please check once , i think they consider priority only for same arrival time
User Avatar
#3147
224
views
0 answers
0 votes
galvin os
difference between load time dynamic linking and run time dynamic linking?
User Avatar
#3148
997
views
1 answers
1 votes
galvin os
explain answer c and e.
User Avatar
#3149
317
views
1 answers
0 votes
operating system
Above solution GUARANTEES : ProgressDOESNOT GUARANTEE : Mutual Exclusion,Bounded waiting,starvationIs this correct ???
User Avatar
#3150
364
views
1 answers
0 votes
operating system
Can somebody please show atleast one example where a synchromnisation mechanism " DOESNOT GUARANTEE BOUNDED WAITING BUT STILL IT GUARANTEES STARVATION FREEDOM "I ... I am wrong in understanding of definitions of Bounded waiting,starvation.
User Avatar
#3151
386
views
0 answers
0 votes
operating system
The above solution is STARVATION-FREE right ??? Because both the processes will eventually get into the Critical-section and there is no indefinite waiting time for any process ... ... semi-colon...(i.e) while(turn!=1); not while(turn!=1)
User Avatar
#3152
281
views
1 answers
0 votes
operating systems
A total of 1000 processes (with all having different burst time) are already in the ready queue and it is already known that no upcoming processes will ... processes to execute.Then the systemA) is starvation free B) suffers from starvation
User Avatar
#3153
504
views
1 answers
0 votes
Paging Concept OS - Cold Misses
What is the meaning of cold misses in context of paging ?PS: HOW WAS THE QUESTION FRAMED ?Just for sake of understanding Suppose the reference strings are 1,2,3,4 ... size of 3 . Then find the no. of page faults along with cold misses.
User Avatar
#3154
411
views
1 answers
0 votes
galvin
which other method should be used to resolve the problem of peterson's method/solution for critical section problem ?
User Avatar
#3155
15.7k
views
1 answers
6 votes
Demand Paging
Assume we have a demand-paged memory. The page table is held in registers. It takes 8 ms to service a page fault if an empty page is available or the replaced page is not modified , ... 6b) 7.3 * 10 ^ - 6c) 3.4 * 10 ^ - 4d) None of these
User Avatar
#3156
304
views
2 answers
0 votes
self doubt
What is protection in term of - "when multiple processes are waiting in the ready queue then one process should not affect the data of another process ... leads to the concept of providing protection between processes in ready queue. " ?
User Avatar
#3157
392
views
2 answers
0 votes
operating system
Which of the following statements is TRUE ?S1) If Bounded waiting is guaranteed for a synchronization mechanism,then definitely that solution will be starvation-free.S2) ... same ...?? If different please explain what is the difference ...
User Avatar
#3158
374
views
1 answers
0 votes
General question
Difference between logical address and physical address.M getting so confused between this two. Sometimes it is mentioned that logical address is what viewd by ... generated by the CPU.Explain in simple language not bookies words. Thanks.
User Avatar
#3159
737
views
0 answers
0 votes
operating system
Does this solution guarantee A) mutual exclusion, B) progress, C) bounded waiting, D) starvation-freedom, E) deadlock-freedom
User Avatar
#3160
2.5k
views
1 answers
1 votes
Effective memory access time with TLB, Main memory and secondary memory
TLB hit rate=90%TLB access time=1nsMain memory access time=100nspage fault rate=20%Page fault service time=20 ms2 level paging is usedFind out the effective memory access ... know which answer is correct.If my idea is wrong why it is wrong?
User Avatar
Page: