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|c|c|c|c|c|c|}\hline \textbf{Year}& \textbf{2026 - 1}& \textbf{2026 - 2}& \textbf{2025 - 1}& \textbf{2025 - 2}& \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&1&2&1&2&2&3&2&4&2&1&2.1&4\\\hline \textbf{2 Marks Count}&2&3&3&3&4&4&3&4&1&3&1&3&4\\\hline \textbf{Total Marks}&6&7&8&7&10&10&9&10&6&8&\bf{6}&\bf{8.1}&\bf{10}\\\hline \end{array}}}$$

Questions without answers in Operating System

1 1 vote
0 0 answers
56
56 views
Consider a Unix file system containing a file:$\texttt{/a/b/c}$Assume:all inodes are already cached in main memoryevery directory occupies exactly one data blockno direct...
1 1 vote
0 0 answers
59
59 views
Two processors $CPU_0$ and $CPU_1$ share a variable.$CPU_0$ disables its local interrupts and enters a critical section without acquiring any shared hardware lock.At the ...
1 1 vote
0 0 answers
60
60 views
The atomic operation $\texttt{compare_and_swap(x, old, new)}$ changes $x$ to $\texttt{new}$ only if its current value equals $\texttt{old}$.Initially,$x=5$The following o...
1 1 vote
0 0 answers
82
82 views
Which of the following statements about disabling interrupts are correct?On a uniprocessor system, disabling interrupts can prevent the running process from being preempt...
0 0 votes
0 0 answers
83
83 views
I have a doubt in Virtual memory paging concept - When page fault occur,there is one memory access of page table then OS does page fault service if we take non dirty rea...
1 1 vote
0 0 answers
91
91 views
Which of the following is correct about Real time operating system.It permits creation of multiple processes within an application.It does not permit priorities to be ass...
1 1 vote
0 0 answers
249
249 views
Q1-Consider the details of a paging system given below to answer the questions that follow.Page size 256 bytes, virtual memory address space of 2^14 bytes, physical memor...
1 1 vote
0 0 answers
417
417 views
A system uses paging with the following parameters:TLB reach $= 1\ \text{MB}$Physical memory size $= 1\ \text{GB}$Virtual address space size $=64\ \text{GB}$Page size $= ...
0 0 votes
0 0 answers
83
83 views
will there be the contest switching over head at the beginning of the gannt chart . some people saying to load ther register we need one context swithcing and some people...
0 0 votes
0 0 answers
282
282 views
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows:void enter_CS(x) { while (test-a...
0 0 votes
0 0 answers
280
280 views
I want to understand how will priority scheduling + round robin for ties will prevent indefinite blocking?
0 0 votes
0 0 answers
87
87 views
Is this Statement correct or not :- LTS does not select one of the process from new State and place it in ready state ?
0 0 votes
0 0 answers
196
196 views
Given six memory partitions of 300 KB, 600 KB, 350 KB, 200 KB, 750 KB, and 125 KB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes ...
0 0 votes
0 0 answers
187
187 views
Consider the page table for a system with 16-bit virtual and physical addresses and 4,096-byte pages.The reference bit for a page is set to 1 when the page has been ref- ...
0 0 votes
0 0 answers
190
190 views
Consider a system consisting of processes P1, P2, ..., Pn, each of which has a unique priority number. Write a monitor that allocates three identical printers to these pr...
0 0 votes
0 0 answers
267
267 views
Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue an I/O operation once for every millisecond of CPU computing a...
0 0 votes
0 0 answers
179
179 views
If synchronisation problem solution does not satisfied bounded waiting then there must be starvation for waiting processes ? 
0 0 votes
0 0 answers
286
286 views
Consider a multilevel paging scheme where the page tables are not page aligned, suppose there are 3 levels annd if from L1 to address L2 page table we need 25 bits, then ...
1 1 vote
0 0 answers
319
319 views
In a 32-bit machine we subdivide the virtual address into 4 pieces as follows:8-bit 4-bit 8-bit 12-bitWe use a 3-level page table, such that the first 8 bits are...
0 0 votes
0 0 answers
263
263 views
Can anyone please give suggest some resource for studying1. System calls2. User mode and Kernel mode3. Threads.The system calls part of galvin is only 4 pages long and I ...
1 1 vote
0 0 answers
387
387 views
why are they assuming 1 Byte extra ? If suppose options are given as 3MB , 4MB and its a mcq ques then ? @Sachin Mittal 1 @Deepak Poonia @goku4199 @ASUR Ref: https://ww...
0 0 votes
0 0 answers
184
184 views
I HAVE ACTIVITY IN COLLEGE OPERATING SYSTEM SUBJECT GATE QUETSION I WANT FROM YEAR 2000-2015 
1 1 vote
0 0 answers
264
264 views
Which of the followings shows the correct hierarchy of a layered file system in an operating systemLogical File SystemFile Organization ModuleBasic File SystemI/O Control...
0 0 votes
0 0 answers
473
473 views
Identify the correct statement(s) from the followings with respect to Spinlock SemaphoresThe name refers to busy waiting semaphores.They are not useful when the locks are...
0 0 votes
0 0 answers
316
316 views
Consider the following Graph of disk scheduling and identify the disk scheduling algorithm representing by this graph.Queue $84, 125, 11, 36, 170, 20, 172, 45$$\text{SSTF...
1 1 vote
0 0 answers
206
206 views
Consider the following set of processes with the arrival time and length of CPU Burst time given in milli-seconds ( $\mathrm{ms}$):$\begin{array}{|c|c|c|} \hline \textbf{...
0 0 votes
0 0 answers
201
201 views
Consider the following set of processes with the arrival time and length of CPU Burst time given in milli-seconds ($\mathrm{ms}$):$\begin{array}{|c|c|c|} \hline \textbf{P...
0 0 votes
0 0 answers
228
228 views
Consider the following set of processes with the arrival time and length of CPU Burst time given in milli-seconds ($\mathrm{ms}$):$\begin{array}{|c|c|c|} \hline \textbf{P...
0 0 votes
0 0 answers
281
281 views
Consider the following set of processes with the arrival time and length of CPU Burst time given in milli-seconds ($\mathrm{ms}$):$\begin{array}{|c|c|c|} \hline \textbf{P...
To see more, click for the full list of questions or popular tags.