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

#3081
2.6k
views
0 answers
1 votes
relocatable address & absolute address
What are relocatable addresses ? Is it the entire source code which is relocatable before loading phase or only addresses used by control statements like goto, switch etc?
User Avatar
#3082
655
views
0 answers
1 votes
Process scheduling in Operating system
Process IDArrival TimeBurst Time132246368417551623Above table shows the processes to be scheduled in a single CPU system and some non pre-emptive scheduling algorithm used(no ... for process P3.4. Calculate the minimum values for 1,2,3
User Avatar
#3083
522
views
1 answers
1 votes
Operating system concepts
Multi processing OS is an OS with more than one processor it it right?? if its is it implies that throughput is better is these os ans more no. of process can be excecuted per unit time.
User Avatar
#3084
795
views
2 answers
1 votes
gate questions
Context switching is the part ofA. BufferingB. Process execution stateC. Interrupt handlingD. Ready state
User Avatar
#3085
4.1k
views
3 answers
2 votes
MIN Resource requirement for deadlock
A system is having 3 user process , each requiring 2 units of resource R . WHAT IS the minimum and maximum no. of units of R required such that no deadlock will occur ?
User Avatar
#3086
2.5k
views
1 answers
3 votes
precedence graph
please explain the concept of precedence graph in operating system concurrent processes.
User Avatar
#3087
9.8k
views
4 answers
11 votes
fork system call
Consider the following code snippet: if(fork()&& fork()) { fork(); } if(fork()||fork()) { fork(); fork(); } printf("GATE 2017");How many times GATE $2017$ printed?How to solve this using tree diagram?
User Avatar
#3088
7.9k
views
1 answers
1 votes
fork system call
How many process are created by the program? int main(){ int i; for(i=0;i<4;i++) fork(); return 0; }Can I write like this ?fork();fork();fork();fork();
User Avatar
#3089
11.7k
views
2 answers
2 votes
working of fork() system call
How many times "hello" gets printed?main() { fork(); fork(); printf("hello"); }
User Avatar
#3090
751
views
1 answers
1 votes
mutual exclusion in operating system
Mutual exclusion is "not sharing a resource" but what if there are more than one instances of a resource and different processes using these instances concurrently, is it still holding mutual exclusion in reference to this resource ?
User Avatar
#3091
13.7k
views
4 answers
15 votes
#OS #MULTILEVEL FEEDBACK QUEUE
Consider a system which has a CPU bound process,which require the burst time of 40 seconds.The multilevel Feed Back Queue scheduling algorithm is used and the queue time quantum '2' seconds and ... ?(a) 5,4 (b) 4,5 (c) 3,4 (d) 4,3
User Avatar
#3092
1.4k
views
1 answers
1 votes
About TLB
State whether following statement is TRUE OR FALSE :.If TLB hit occur then page fault will never be occur. Explain your Answer.
User Avatar
#3093
854
views
1 answers
2 votes
is this gantt chart for round robin is correct ?
User Avatar
#3094
557
views
0 answers
1 votes
Tanenbaum os book
User Avatar
#3095
2.6k
views
1 answers
1 votes
Made easy work book question
Five jobs are waiting to run. Their expected run times are 9,6,3,5,10....which job scheduling technique will result in minimum avg response time. 1) SJF2) FCFS3)PRIORITY4) ROUND ROBIN
User Avatar
#3096
1.1k
views
1 answers
2 votes
Scheduling
Consider 3 processes A, B, C to be scheduled as per srtf.... Process A is scheduled first and when A is running for 7 units of time, C has arrived... And C ... of time.... Then what could be the minimum burst time of the process A and C.
User Avatar
#3097
443
views
0 answers
0 votes
Paging
Who determines the size of the page table (or to be precise size of virtual address space) for any process?is it operating system or ISA or something else?
User Avatar
#3098
1.5k
views
0 answers
4 votes
which of the following requires a device driver ?
a - has not been used for the longest time in the pastb- will not be used for the longest time in the future.c-has been used least number of timesd-has been used most number of times.
User Avatar
#3099
1.2k
views
1 answers
1 votes
doubt about privileged or non privileged instruction.
Talk about the correctness of following claims.1) The instruction to switch to kernel mode is an example of a privileged instruction.2) The instruction ... user mode is an example of a privileged instruction.Detailed explanation is needed.
User Avatar
#3100
2.4k
views
2 answers
1 votes
Which Scheduler work while moving a process from Running state to Wait State ?
Which Scheduler work while moving a process from Running state to Wait State ?
User Avatar
Page: