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{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 2 &4&2&2&2&3&2&2&1&1&1&2.1&4
\\\hline\textbf{2 Marks Count} & 4 &1&3&4&4&3&2&2&4&3&1&3&4
\\\hline\textbf{Total Marks} & 10 &6&8&10&10&9&6&6&9&7&\bf{6}&\bf{8.1}&\bf{10}\\\hline
\end{array}}}$$

Filter

Recent questions in Operating System

2 votes
1 answer
3932
UGC NET CSE | December 2015 | Part 2 | Question: 28
Consider a disk with 16384 bytes per track having a rotation time of 16 msec and average seek time of 40 msec. What is the time in msec to read a block of 1024 bytes from this disk? 57 msec 49 msec 48 msec 17 msec
Consider a disk with 16384 bytes per track having a rotation time of 16 msec and average seek time of 40 msec. What is the time in msec to read a block of 1024 bytes from...
User Avatar
6 votes
1 answer
3934
UGC NET CSE | December 2015 | Part 2 | Question: 26
A virtual memory has a page size of $\textsf{1K}$ ... ? $1024, 3072, 4096, 6144$ $1234, 4012, 5000, 6200$ $1020, 3012, 6120, 8100$ $2021, 4050, 5112, 7100$
A virtual memory has a page size of $\textsf{1K}$ words. There are eight pages and four blocks. The associative memory page table contains the following entries :$\begin{...
User Avatar
1 votes
1 answer
3935
arihant gate tutor 2016
which one is correst #round robin scheduling is essentially the preemptive version of 1) FIFO 2) shortest job first 3) shortest remaining time first 4) longest time first
which one is correst #round robin scheduling is essentially the preemptive version of 1) FIFO 2) shortest job first 3) shortest remaining time first 4) longest time first...
User Avatar
0 votes
1 answer
3936
Identify the result of code
main() { if(fork()>0) sleep(100); } The given code results in the creation of: I) an orphan process II) a zombie process III) a process that executes forever IV) None of these What is the answer and why it happened?? Please explain...
main(){if(fork()>0)sleep(100);}The given code results in the creation of:I) an orphan processII) a zombie processIII) a process that executes foreverIV) None of these Wh...
User Avatar
3 votes
1 answer
3938
Processes
The mapping of addresses above KERNBASE in a process’s virtual space does not change over time True False
The mapping of addresses above KERNBASE in a process’s virtual space does not change over timeTrueFalse
User Avatar
5 votes
2 answers
3939
Page fault
Page fault may occur in which of following cases? i)When requested address is not in RAM ii)When write is issued on a read-only page iii)When read to the page is restricted with the current permissions i only i and ii only i and iii only i,ii and iii
Page fault may occur in which of following cases?i)When requested address is not in RAMii)When write is issued on a read-only page iii)When read to the page is restricted...
User Avatar
4 votes
1 answer
3940
Process and Thread
If a process has multiple threads and it calls a fork() then will the child process be multi-threaded also or it will have only one thread?
If a process has multiple threads and it calls a fork() then will the child process be multi-threaded also or it will have only one thread?
User Avatar
2 votes
1 answer
3941
UGC NET CSE | December 2014 | Part 3 | Question: 73
Which of the following versions of Windows O.S. contain built-in partition manager which allows us to shrink and expand pre-defined drives ? Windows Vista Windows $2000$ Windows NT Windows $98$
Which of the following versions of Windows O.S. contain built-in partition manager which allows us to shrink and expand pre-defined drives ?Windows Vista Windows $2000$Wi...
User Avatar
3 votes
1 answer
3943
UGC NET CSE | Junet 2015 | Part 3 | Question: 73
Match the following for UNIX system calls : ... $\text{(a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)}$
Match the following for UNIX system calls :$\begin{array}{clcl} &\textbf{List-I} && \textbf{List-II} \\ \text{(a)} & \text{exec} & \text{(i)} & \text{Creates new process...
User Avatar
2 votes
1 answer
3945
UGC NET CSE | Junet 2015 | Part 3 | Question: 54
A unix file may be of the type Regular file Directory file Device file Any one of the above
A unix file may be of the typeRegular fileDirectory fileDevice fileAny one of the above
User Avatar
4 votes
2 answers
3946
UGC NET CSE | Junet 2015 | Part 3 | Question: 53
In _____ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy Index Linked Contiguous Bit Map
In _____ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easyIndexLinkedContiguousBit Map
User Avatar
2 votes
2 answers
3947
UGC NET CSE | Junet 2015 | Part 3 | Question: 52
Dining Philosopher's problem is a Producer - consumer problem Classical IPC problem Starvation problem Synchronization primitive
Dining Philosopher's problem is aProducer - consumer problemClassical IPC problemStarvation problemSynchronization primitive
User Avatar
2 votes
1 answer
3950
UGC NET CSE | Junet 2015 | Part 3 | Question: 49
Match the following for operating system techniques with the most appropriate advantage : ... $\text{(a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)}$
Match the following for operating system techniques with the most appropriate advantage :$\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II}\\ \text{(a)} & \text{...
User Avatar
Page: