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

1 votes
1 answer
4581
Why is the overhead in paging equal to average overhead caused by page size which is P/2, P is the size of Page ?
Why is the overhead in paging equal to average overhead caused by page size which is P/2, P is the size of Page ?
User Avatar
1 votes
3 answers
4583
How to calculate virtual address space in below question ?
If we are given PAGE SIZE=4KB, PAGE TABLE ENTRY SIZE=4B OUTER PAGE TABLE SIZE=4KB and levels of Paging=3 ,so how to go about calculating the virtual address space .
If we are given PAGE SIZE=4KB, PAGE TABLE ENTRY SIZE=4B OUTER PAGE TABLE SIZE=4KB and levels of Paging=3 ,so how to go about calculating the virtual address space .
User Avatar
1 votes
1 answer
4585
Context Switch
User Avatar
1 votes
1 answer
4587
threads
is it easy to port threaded code ? a) true b) false
is it easy to port threaded code ?a) trueb) false
User Avatar
1 votes
1 answer
4589
Threads
Which of the following should be allowed in kernel mode ? 1) Changing mapping from virtual address to physical address 2) mask and unmask Interrupts 3) disabling interrupts 4) reading status of a procesor 5) Reading timeof day which one is correct ? a) 1 2 3    b ) 1245 c) all of these d ) 235
Which of the following should be allowed in kernel mode ?1) Changing mapping from virtual address to physical address2) mask and unmask Interrupts3) disabling interrupts4...
User Avatar
1 votes
2 answers
4591
What is counting method for free space management ?
How to solve the above ques ?
How to solve the above ques ?
User Avatar
1 votes
1 answer
4592
process
If a process on the system could issue an I/O request then the process will be placed on which of the following ? a)Ready State b) Running state c) ready queue d) I/o queue
If a process on the system could issue an I/O request then the process will be placed on which of the following ?a)Ready Stateb) Running statec) ready queued) I/o queue
User Avatar
1 votes
2 answers
4593
System call
for (int i = 0; i<4; i++) { fork(); } What is no of child nodes at each level ?
for (int i = 0; i<4; i++) { fork(); }What is no of child nodes at each level ?
User Avatar
1 votes
1 answer
4594
System call
main( ) { if (fork( ) == 0) { /* Child */ while (1) { for (i=0; i
main( ){ if (fork( ) == 0){ /* Child */while (1){ for (i=0; i
User Avatar
1 votes
1 answer
4595
Which one of the following is allowed only in kernel mode?
Which one of the following is allowed only in kernel mode? A) Read the time of day clock B) Save the status of process C) change the PC content. D) non of these
Which one of the following is allowed only in kernel mode?A) Read the time of day clockB) Save the status of processC) change the PC content.D) non of these
User Avatar
6 votes
1 answer
4596
Virtual Memory
If i have a Reference string with S  and page fault as N . then what is number of page fault when we take reverse of string sr ? 1)FIFO 2)LRU 3)MRU 4)OPTIMAL  // i was given this question for 1 algorithm , but the i tried to find for all page replacement algorithm .      
If i have a Reference string with S  and page fault as N . then what is number of page fault when we take reverse of string sr ?1)FIFO2)LRU3)MRU4)OPTIMAL // i was given...
User Avatar
1 votes
2 answers
4597
Memory Management
Which of the following are true about of paging ? 1) It divide the memory into units of equal size 2)It permits implementation  of  virtual memory 3)It suffers from Internal Fragmentation option a) 1 b ) 2 c) 3 d) 1,2,3
Which of the following are true about of paging ?1) It divide the memory into units of equal size2)It permits implementation  of  virtual memory3)It suffers from Intern...
User Avatar
1 votes
2 answers
4598
If the available no of resources are unable to meet the future need of any of the processes then what is the state ?
Just wanted to know that if none of the needs of a process is met so can we directly say that it is unsafe state as well as will lead to deadlock since none of the needs ...
User Avatar
Page: