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

Most viewed questions in Operating System

31 votes
5 answers
103
GATE CSE 2002 | Question: 1.22
Which of the following scheduling algorithms is non-preemptive? Round Robin First-In First-Out Multilevel Queue Scheduling Multilevel Queue Scheduling with Feedback
Which of the following scheduling algorithms is non-preemptive?Round RobinFirst-In First-OutMultilevel Queue SchedulingMultilevel Queue Scheduling with Feedback
User Avatar
25 votes
6 answers
108
GATE CSE 1997 | Question: 6.7
An operating system contains $3$ user processes each requiring $2$ units of resource $R$. The minimum number of units of $R$ such that no deadlocks will ever arise is $3$ $5$ $4$ $6$
An operating system contains $3$ user processes each requiring $2$ units of resource $R$. The minimum number of units of $R$ such that no deadlocks will ever arise is$3$$...
User Avatar
24 votes
8 answers
109
GATE CSE 2019 | Question: 17
The following C program is executed on a Unix/Linux system : #include<unistd.h> int main() { int i; for(i=0; i<10; i++) if(i%2 == 0) fork(); return 0; } The total number of child processes created is ________________ .
The following C program is executed on a Unix/Linux system :#include<unistd.h int main() { int i; for(i=0; i<10; i++) if(i%2 == 0) fork(); return 0; }The total number of ...
User Avatar
2 votes
4 answers
110
NIELIT 2017 DEC Scientific Assistant A - Section B: 9
Operating System maintains the page table for : each process each thread each instruction each address
Operating System maintains the page table for :each processeach threadeach instructioneach address
User Avatar
29 votes
3 answers
114
GATE CSE 2008 | Question: 66
A process executes the following code for(i=0; i<n; i++) fork(); The total number of child processes created is $n$ $2^n-1$ $2^n$ $2^{n+1} - 1$
A process executes the following codefor(i=0; i<n; i++) fork();The total number of child processes created is$n$$2^n-1$$2^n$$2^{n+1} - 1$
User Avatar
48 votes
7 answers
115
GATE CSE 2017 Set 1 | Question: 18
Threads of a process share global variables but not heap heap but not global variables neither global variables nor heap both heap and global variables
Threads of a process shareglobal variables but not heapheap but not global variablesneither global variables nor heapboth heap and global variables
User Avatar
47 votes
5 answers
120
GATE CSE 1995 | Question: 2.6
The sequence __________ is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for ________ unit(s) of time. ... $\{2, 1, 3\}, 0$ $\{3, 2, 1\}, 0$ $\{1, 2, 3\}, 5$
The sequence __________ is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for ________ unit(s) of time.$$\small \begin{arr...
User Avatar
Page: