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

#2961
593
views
1 answers
2 votes
Shortest job next
Why sjf is not a practical implementation ?
User Avatar
#2962
933
views
1 answers
1 votes
dynamic partitioning scheme :OS
Consider a dynamic partitioning scheme.Show that on an avg. memory contains half as many holes as segments??i am not able to understand the concept of relation bw holes and segments in context to this question..
User Avatar
#2963
261
views
1 answers
1 votes
self doubt
what is the meaning of "interrupts are asynchronous">
User Avatar
#2964
1.3k
views
1 answers
2 votes
demand paging
In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is ... maximum acceptable page-fault rate for an effective access time of no more than 200nanoseconds?
User Avatar
#2965
568
views
0 answers
0 votes
2004 gate
A process executes following segment of code:for(i = 1; i <= n; n++)fork();The number of new process created is 1. n2. ((n(n+1))/2)3. (2^n)-14. (3^n)-1
User Avatar
#2966
7.6k
views
0 answers
0 votes
Paging and segmentation
Why paging suffer from internal fragmentation and why segmentation suffer from external fragmentation
User Avatar
#2967
229
views
0 answers
0 votes
Semaphore OS
var occupied, var blocked;Entry section:{ if(occupied) { blocked = blocked + 1; sleep(); } else ... .Please elaborate the correct working of this, for all the possible initial values of occupied and blocked.
User Avatar
#2968
1.4k
views
2 answers
2 votes
OS:- Synchronzation
1. Progress Satisfied => Deadlock free2. Starvation free => Deadlock free3.Starvation freedom => Bounded waitPlease explain these implications if valid or invalid
User Avatar
#2969
464
views
2 answers
1 votes
# threads
Is user-level threads transparent to the kernel?
User Avatar
#2970
769
views
0 answers
1 votes
galvin excercise
12.8 Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. Thedrive is currently serving a request at cylinder 143, and the previousrequest was at ... disk-scheduling algorithms?a. FCFSb. SSTFc. SCANd. LOOKe. C-SCANf. C-LOOK
User Avatar
#2971
4.7k
views
6 answers
8 votes
OS:- Round Robin scheduling
If we have only one process in ready queue with burst time "m", then how many context switching will happen using round robing scheduling with time quantum ... that dispatching the process first time is not counted as a context switch.
User Avatar
#2972
341
views
0 answers
2 votes
Self Doubt in Mode Switch
Mode SwitchValidate the following statements:1. Kernel To User Mode Switch can be done by a Non Privileged Instruction. eg Return From Interrupt. True2. ... as exception. TruePlease validate these and help me understand if I am wrong.
User Avatar
#2973
4.7k
views
1 answers
3 votes
OS:- UNIX I node
Consider the organization of a UNIX file as represented by the inodeAssume that there are 12 direct block pointers, and a singly, doubly, and triply indirectpointer ... disk accesses are required to access the byte in position 13,423,956?
User Avatar
#2974
422
views
1 answers
0 votes
LRU replacement
" In the case of LRU, ( and particularly the stack implementation thereof ), the top N pages of the stack will be the same for all frame set ... ?Please refer : https://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/9_VirtualMemory.html
User Avatar
#2975
741
views
1 answers
0 votes
Operation System -> Process Synchronisation -> Counting Semaphores
Struct Semaphore{ int value; Queue type L;} Down (Semaphore S){ S.value = S.value -1 ... please correct me. I referred Tanenbaum and Galvin but didn't find any such explanation for Counting Semaphores)
User Avatar
#2976
871
views
1 answers
0 votes
NPTEL
Which of the following does not interrupt a running process?1. A device2. Timer3. Power Failure4. None of the above
User Avatar
#2977
426
views
0 answers
0 votes
Nptel
What does the the system call sys_uptime() return?1. Time the when system call is invoked.2. Time since the start of the process3. The number of ... have occurred since the start.4. Maximum time the interrupt taken to complete execution.
User Avatar
#2978
726
views
1 answers
2 votes
NPTEL
Let the number of bits for Interrupt gate descriptor be 48, ie 32:16 (segment selector:offset). Each entry in the interrupt descriptor table is 5 Bytes. What will the total size of the IDT in bytes ?1. 12562. 10243. 10204. 1280
User Avatar
#2979
2.7k
views
1 answers
0 votes
[OS] Compile time vs load time address binding
Why logical address and physical address are same in case of compile and load time binding ?In complie time as i have read compiler will generate absoute address ... Logical address can be anything?Why it has ti be same as physical address?
User Avatar
#2980
1.5k
views
1 answers
2 votes
Disk scheduling problem
disk requests come to disk driver for cylinder 10,22,20,2,40,6,X in that order at a time when the disk drive is reading from cylinder 20 the seek time ... total seek time 876ms under fcfs scheduling algorithum then what is the value of x??
User Avatar
Page: