Recent questions tagged operating-system

1 votes
2 answers
2852
Match the following $:$$\begin{array}{clcl} \text{} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Contiguous allocation} & \text{i.} & \text{This s...
2 votes
2 answers
2854
Match the following $:$$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a}. & \text{Multilevel feedback queue} & \text{i.} & \text{Time-slicin...
0 votes
0 answers
2856
What is the page size taken if page size is less than frame size?Take an example page size =4kb and frame size = 8kb ,Then for calculating virtual address space , which p...
6 votes
1 answer
2857
In a system using single processor, a new process arrives at the rate of six processes per minute and each such process requires seven seconds of service time. What is th...
7 votes
4 answers
2860
5 votes
5 answers
2861
0 votes
2 answers
2862
0 votes
1 answer
2863
7 votes
2 answers
2867
Consider the following program.main() { fork(); fork(); fork(); }How many new processes will be created?8675
13 votes
2 answers
2868
Suppose a system contains $n$ processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited ready queue of the processst...
3 votes
7 answers
2869
There are three processes in the ready queue. When the currently running process requests for I/O how many process switches take place?1234
12 votes
4 answers
2871
6 votes
2 answers
2872
If there are 32 segments, each size 1 k bytes, then the logical address should have13 bits14 bits15 bits16 bits
3 votes
3 answers
2873
2 votes
2 answers
2875
In which of the following scheduling policies does context switching never takeplace?A) Round-robinB) Shortest job firstC) Pre-emptiveD) All of the above
3 votes
3 answers
2876
Process isA program in high level language kept on diskContents of main memoryA program in executionA job in secondary memory
3 votes
4 answers
2878
A page faultOccurs when a program accesses an available page on memoryis an error in a specific pageis a reference to a page belonging to another programoccurs when a pro...
5 votes
3 answers
2879
The correct matching of the following pairs is$\begin{array}{|l|l|l|l|} \hline \text{A.} & \text{Disk check} & \text{i.} & \text{Round robin} \\\hline \text{B.}& \text{B...
1 votes
1 answer
2880
The page replacement algorithm which gives the lowest page fault rate isLRUFIFOOptimal page replacementSecond chance algorithm