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
4522
DEADLOCK
in which system deadlock exists ?
in which system deadlock exists ?
User Avatar
0 votes
2 answers
4524
Let P0 And P1 are two processes,each accessing two binary semaphore s and q set to value 1:
P0 wait(s); wait(q); Signal (s); signal(q);... P1[ wait(q);wait(s);} signal(q);signal(s);.... whether progress is guarnteed or not ???
P0wait(s); wait(q);Signal (s); signal(q);...P1[wait(q);wait(s);}signal(q);signal(s);....whether progress is guarnteed or not ???
User Avatar
0 votes
1 answer
4525
Deadlock
Deadlock Prevention is not practically feasible because : 1) Applicable to only shared resources 2) It is only a therotical concept 3)Resource utilization is low 4)It is only applicable to OS Unix
Deadlock Prevention is not practically feasible because :1) Applicable to only shared resources2) It is only a therotical concept3)Resource utilization is low4)It is only...
User Avatar
0 votes
2 answers
4526
which address is this physical or logical?
User Avatar
0 votes
1 answer
4527
process synchronizatiom
Suppose there are 2 process p and q : P: while (1) { wait (mutex); print '1'; signal (mutex); } Q: { wait (mutex); print '0'; signal (mutex); } If process p exceute then only Q execute , then what pattern is obtained ? a) (01)*  b)(10)*  c)(1/0)* d) none of these 
Suppose there are 2 process p and q :P:while (1){wait (mutex);print '1';signal (mutex);}Q:{wait (mutex);print '0';signal (mutex);}If process p exceute then only Q execute...
User Avatar
0 votes
1 answer
4528
Process Synchronization
In a nCPU shared system , if Z is the probability that any CPU request the bus in a given cycle , the probability that only 1 CPU use teh bus is given by : a)nZ(1-n)(n-1)     b)Z(1-Z)(n-1)  c)n(1-Z)n              d)(n-1)(1-Z)n
In a nCPU shared system , if Z is the probability that any CPU request the bus in a given cycle , the probability that only 1 CPU use teh bus is given by :a)nZ(1-n)(n-1) ...
User Avatar
2 votes
2 answers
4530
Segmentation
In segmented paging, is the paging applied on segment table or on segments?
In segmented paging, is the paging applied on segment table or on segments?
User Avatar
0 votes
1 answer
4531
bit rate of video terminal unit
what is bit rate of video terminal unit with 80 character/line , 8 bits/character and horizontal sweep time of 100 micro sec?
what is bit rate of video terminal unit with 80 character/line , 8 bits/character and horizontal sweep time of 100 micro sec?
User Avatar
0 votes
1 answer
4532
MAX RESOLUTION SUPPORT
System having 8 MB of video memory for bit mapped graphics with 64 bit color what is max resolution can support
System having 8 MB of video memory for bit mapped graphics with 64 bit color what is max resolution can support
User Avatar
0 votes
1 answer
4533
Max number of files
A computer system uses a single level directory structure . The directory occupies 2 disk block . the disk block size is 2KB. directory entry size is 4 bytes . Then what is maximum number of File in File system ?
A computer system uses a single level directory structure . The directory occupies 2 disk block . the disk block size is 2KB. directory entry size is 4 bytes . Then what ...
User Avatar
1 votes
1 answer
4534
File system
Consider a file system where linked allocation strategy and contigous allocation strategy is used , The number of disk block to be accessed if the k block of file to be accessed respectively is ? a) 1,k b)k,1, c)klogk , k d) k , klogk
Consider a file system where linked allocation strategy and contigous allocation strategy is used , The number of disk block to be accessed if the k block of file to be a...
User Avatar
0 votes
1 answer
4535
File system
Which file is a sequence of bytes organized into blocks understandable by the system’s linker? a) object file b) source file c) executable file d) text file
Which file is a sequence of bytes organized into blocks understandable by the system’s linker?a) object fileb) source filec) executable filed) text file
User Avatar
6 votes
2 answers
4538
Scheduling algorithm
Which of the following Algorithm favour CPU bound Bound process ? 1) RR  2) FCFS  3) Multilevel feedback queue option are : a)  1 only b) 2 only c) 1 and 2 only d) 1 and 3 only
Which of the following Algorithm favour CPU bound Bound process ?1) RR  2) FCFS  3) Multilevel feedback queueoption are : a)  1 onlyb) 2 onlyc) 1 and 2 onlyd) 1 and 3 ...
User Avatar
1 votes
2 answers
4539
Will there be any starvation due to below synchronization mechanism ?
If a synchronization mechanism satisfies Bounded Waiting but no Progress and also it is a busy waiting solution so will there be any starvation ?
If a synchronization mechanism satisfies Bounded Waiting but no Progress and also it is a busy waiting solution so will there be any starvation ?
User Avatar
1 votes
1 answer
4540
Does Progress gurantee Bounded waiting ?
If a synchronization mechanism does not gurantee Progress then does it implicitly imply that it won't gurantee Bounded waiting as well
If a synchronization mechanism does not gurantee Progress then does it implicitly imply that it won't gurantee Bounded waiting as well
User Avatar
Page: