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

#2901
355
views
1 answers
0 votes
Memory management
If pages have 2000 words and the paging device ia a drum that rotates at 6000 rpm and transfers 2 million words per second.What does it mean exactly?
User Avatar
#2902
213
views
0 answers
1 votes
process management
main(){int i,n;for(i=1;i<=n;++i){print("*");fork();}}the output for the following program?
User Avatar
#2903
1.2k
views
1 answers
1 votes
UGC NET CSE | June 2009 | Part 2 | Question: 10
Assume $N$ segments in memory and a page size of $P$ bytes. The wastage on account of internal fragmentation is :$NP/2$ bytes $P/2$ bytes $N/2$ bytes $NP$ bytes
User Avatar
#2904
464
views
0 answers
1 votes
Memory management
Suppose a process has only the following pages in its virtual address space,two contiguous code pages starting at virtual address 0x00000000 , two contiguous data ... of memory required for storing the page tables of this process is ___?
User Avatar
#2905
856
views
1 answers
1 votes
Memory management
The address sequence generated by tracing a particular program executing in a pure demand paging system with 100 records per page with 1 free main memory frame is recorded ... number of page faults ?780,450,456,520,599,098,108,109,754,555
User Avatar
#2906
435
views
1 answers
1 votes
Memory management
The page fault service time is 10 ms in a computer with average memory access time being 20 ns.If one page fault is generated for every 106 ... 35 nsI am confused with the conversions.Could anybody answer this with proper explanation.
User Avatar
#2907
412
views
1 answers
0 votes
#input - output device
User Avatar
#2908
136
views
0 answers
0 votes
# booting
User Avatar
#2909
289
views
0 answers
0 votes
can any one explain me the following thing...
let m[0] ...m[4] be mutexes (binary semaphores) and p[0] and p[4] be processes ...suppose each process p[i] executes the followingwait(m[i]);wait(m[i+1]mode 4 ... ......release(m[i];release(m[(i+1)mod4]);what is meaning of all these things?
User Avatar
#2910
420
views
1 answers
1 votes
mutual exclusion
Initial values of S1 ansd S2 are random assignedMethod by P1do{flag[i] = true;S1 = S2;while( flag[j]=true and S1 == S2);critical ... );criticals ectionflag[j]=false;remainder section}while(1);Does this gurantee mutual exclusion?
User Avatar
#2911
2.4k
views
1 answers
2 votes
address translation table
a) What is address translation table??b) is it converting virtual adress to physical address??c) if so Then for a system having no virtual memory , will not have aaddress translation table??
User Avatar
#2912
213
views
0 answers
0 votes
SElf doubt
Virtual memory leads to increase or decrease in context switching overhead?or doesnt it make any difference
User Avatar
#2913
301
views
0 answers
0 votes
Self doubt
Incase i get a equation like this 1234 p2 + 459p +657 =0 and i have to find Pif value of P is given in choices then i can substitute one by one by findbut if nochoices given then any easy way to solve these large numbered equations?
User Avatar
#2914
529
views
1 answers
1 votes
Deadlock
Suppose 10 processes p1 to p10 share 7 identical resource units and release on at a time then max resource req of a process pi is Sp where Sp is ... max value of summmation of Sp for all process that ensures deadlock doesnt occur is
User Avatar
#2915
773
views
1 answers
2 votes
Fixed partition
Consider a scenario having fixed partition allocation scheme where each partition is of size 100KB , 500KB , 200Kb , 300KB and 600KB.In these ... How may partitions will remain unallocated after placing the proceses by firstbit approach
User Avatar
#2916
526
views
1 answers
1 votes
Security
Suppose a source code has bigger overflow vulnerabilities. Which of the following can cause buffer overflow vulnerabilities a. Scanf("%s",...) b. Strcpy(destination, source) ... Options are1. Only a2. b and c3. a and b4. All of the above
User Avatar
#2917
1.2k
views
1 answers
0 votes
threads
Multi-threaded application cannot take advantage of multiprocessing.What does this mean?
User Avatar
#2918
837
views
0 answers
0 votes
True/False ?
TLB hit indicates 'No page fault'.
User Avatar
#2919
523
views
1 answers
0 votes
Interprocess Synchronization
which of the following statements is correct for two processes executing this code?A) Given program provide mutual exclusion.B) Given program does not provide ... D) Given program provide mutual exclusion but does not prevent of starvation.
User Avatar
#2920
1.8k
views
1 answers
0 votes
PROCESS CONCEPT
User Avatar
Page: