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

Most answered questions in Operating System

4 votes
4 answers
242
UGC NET CSE | June 2012 | Part 2 | Question: 29
Pre-emptive scheduling is the strategy of temporarily suspending a running process before the CPU time slice expires to allow starving processes to run when it requires I/O to avoid collision
Pre-emptive scheduling is the strategy of temporarily suspending a running processbefore the CPU time slice expiresto allow starving processes to runwhen it requires I/Ot...
User Avatar
4 votes
4 answers
243
ISRO2014-70
Dirty bit is used to indicate which of the following? A page fault has occurred A page has corrupted data A page has been modified after being loaded into cache An illegal access of page
Dirty bit is used to indicate which of the following?A page fault has occurredA page has corrupted dataA page has been modified after being loaded into cacheAn illegal ac...
User Avatar
7 votes
4 answers
245
ISRO2011-49
Consider a 32-bit machine where four-level paging scheme is used. If the hit ratio to TLB is 98%, and it takes 20 nanosecond to search the TLB and 100 nanoseconds to access the main memory what is effective memory access time in nanoseconds? 126 128 122 120
Consider a 32-bit machine where four-level paging scheme is used. If the hit ratio to TLB is 98%, and it takes 20 nanosecond to search the TLB and 100 nanoseconds to acce...
User Avatar
12 votes
4 answers
246
ISRO2015-32
In a lottery scheduler with 40 tickets, how we will distribute the tickets among 4 processes $P_1, P_2, P_3$ and $P_4$ such that each process gets 10%, 5%, 60% and 25% respectively? $P_1$ $P_2$ $P_3$ $P_4$ A 12 4 70 30 B 7 5 20 10 C 4 2 24 10 D 8 5 30 40
In a lottery scheduler with 40 tickets, how we will distribute the tickets among 4 processes $P_1, P_2, P_3$ and $P_4$ such that each process gets 10%, 5%, 60% and 25% re...
User Avatar
3 votes
4 answers
247
ISRO2009-11
A page fault Occurs when a program accesses an available page on memory is an error in a specific page is a reference to a page belonging to another program occurs when a program accesses a page not currently in memory
A page faultOccurs when a program accesses an available page on memoryis an error in a specific pageis a reference to a page belonging to another programoccurs when a pro...
User Avatar
0 votes
4 answers
248
Finding hit ratio
Cache access time Tc = 100 ns Memory access time Tm = 500 ns If the effective access time is 10% greater than the cache access time, what is the hit ratio H? (A) 89% (B) 91% (C) 98% (D) 95%
Cache access time Tc = 100 nsMemory access time Tm = 500 nsIf the effective access time is 10% greater than the cache access time, what is the hit ratio H?(A) 89%(B) 91%(...
User Avatar
8 votes
4 answers
249
ISRO2011-24
If the page size in a 32-bit machine is 4K bytes then the size of page table is 1 M bytes 2 M bytes 4 M bytes 4 K bytes
If the page size in a 32-bit machine is 4K bytes then the size of page table is1 M bytes2 M bytes4 M bytes4 K bytes
User Avatar
6 votes
4 answers
250
UGC NET CSE | June 2012 | Part 2 | Question: 30
In round robin CPU scheduling as time quantum is increased the average turn around time increases decreases remains constant varies irregularly
In round robin CPU scheduling as time quantum is increased the average turn around timeincreasesdecreasesremains constantvaries irregularly
User Avatar
0 votes
4 answers
251
operating systems
system call is a)hardware interrupts b)software interrupt c)exception d)none o these i feel all a,b,c :(
system call isa)hardware interruptsb)software interruptc)exceptiond)none o thesei feel all a,b,c :(
User Avatar
0 votes
4 answers
252
operating systems
a system has 6 processes sharing 7 resourses if each process needs maximum 3 units then a) deadlock can never occur b)deadlock may occur c)starvation will occur d)none of these
a system has 6 processes sharing 7 resourses if each process needs maximum 3 units thena) deadlock can never occurb)deadlock may occurc)starvation will occurd)none of the...
User Avatar
6 votes
4 answers
253
ISRO-2013-57
Which of the following is not a necessary condition for deadlock? Mutual exclusion Reentrancy Hold and wait No pre-emption
Which of the following is not a necessary condition for deadlock?Mutual exclusionReentrancyHold and waitNo pre-emption
User Avatar
3 votes
4 answers
254
ISRO-2013-52
Suppose we have variable logical records of lengths of $5$ bytes, $10$ bytes and $25$ bytes while the physical block size in disk is $15$ bytes. What is the maximum and minimum fragmentation seen in bytes? $25$ and $5$ $15$ and $5$ $15$ and $0$ $10$ and $5$
Suppose we have variable logical records of lengths of $5$ bytes, $10$ bytes and $25$ bytes while the physical block size in disk is $15$ bytes. What is the maximum and m...
User Avatar
16 votes
4 answers
256
GATE CSE 2007 | Question: 83
A process, has been allocated $3$ ... above reference string, how many more page faults occur with LRU than with the optimal page replacement policy? $0$ $1$ $2$ $3$
A process, has been allocated $3$ page frames. Assume that none of the pages of the process are available in the memory initially. The process makes the following sequenc...
User Avatar
1 votes
4 answers
259
Which of the following is not a necessary condition for a deadlock among processes?
Which of the following is not a necessary condition for a deadlock among processes? (a) Shared Resources (b) No Preemption (c) Acyclic condition among processes (d) None of the above
Which of the following is not a necessary condition for a deadlock among processes?(a) Shared Resources(b) No Preemption(c) Acyclic condition among processes(d) None of t...
User Avatar
0 votes
4 answers
260
What is the meaning of wake up() operation in the up() binary operation, Definition is mentioned below.
Up(Semaphore S) { if (Suspended list() is empty) S.value=1; else { Select a process from the suspended list and WakeUp() } }
User Avatar
Page: