Register
Webpage for Operating System

Recent questions tagged operating-system

1 votes
1 answer
1921
Deadlock progress
Deadlock --> no progress Does progress ---> no deadlock...?
Deadlock no progressDoes progress - no deadlock...?
User Avatar
2 votes
0 answers
1922
Can any one explain below condition : OS
Let m[0]....m[4] be mutexes (binary semaphores) and P[0].......P[4] be processes. Suppose each process P[i] executes the following: wait (m[i]; wait (m(i+1) mode 4]); ........... release (m[i]); release (m(i+1) mod 4]);
Let m[0]....m[4] be mutexes (binary semaphores) and P[0].......P[4] be processes. Suppose each process P[i] executes the following:wait (m[i]; wait (m(i+1) mode 4]); .......
User Avatar
1 votes
0 answers
1923
Previous Year Question : Operating System
Reference to this question can we assume that &i gives logical address space ? https://gateoverflow.in/765/gate2005-72
Reference to this question can we assume that &i gives logical address space ?https://gateoverflow.in/765/gate2005-72
User Avatar
1 votes
0 answers
1924
How to draw conclusion from given statements?
What is the conclusion that can be drawn from the following statements, 1) CPU utilization = 15%. 2) Hard Disk utilization = 95%. 3) Other I/O devices = 5%.
What is the conclusion that can be drawn from the following statements,1) CPU utilization = 15%.2) Hard Disk utilization = 95%.3) Other I/O devices = 5%.
User Avatar
2 votes
1 answer
1925
Use of multi paging
1) Why multi-level paging is used and what are its advantages? 2) Why paging is used in segmentation?
1) Why multi-level paging is used and what are its advantages?2) Why paging is used in segmentation?
User Avatar
2 votes
0 answers
1926
Question
Suppose in a system, processes arrive at an average rate of 6 per minute.On average each process takes 8 seconds of service time. Estimate the % of time CPU is idle in a single processor system is ______
Suppose in a system, processes arrive at an average rate of 6 per minute.On average each process takes 8 seconds of service time. Estimate the % of time CPU is idle in a ...
User Avatar
1 votes
1 answer
1930
MADE EASY Basic Full Length 3
Consider a page size of 1 KB and that each page table entry takes 4 B. If every page table fits into a single page and 3 level paging are used then size of virtual memory is ________(in bits).
Consider a page size of 1 KB and that each page table entry takes 4 B. If every page table fits into a single page and 3 level paging are used then size of virtual memory...
User Avatar
0 votes
1 answer
1933
Doubts new
Solve the problem please
Solve the problem please
User Avatar
2 votes
2 answers
1934
Paging- Memory Management
A system support 32 bit virtual address with a page size of power of 2. Page table entries 32 bit wide. The page size in KB of the system should be ____ in order to make sure that the page table fits exactly in one frame of memory.
A system support 32 bit virtual address with a page size of power of 2. Page table entries 32 bit wide. The page size in KB of the system should be ____ in order to make ...
User Avatar
0 votes
2 answers
1935
Gateforum Test series
Suppose 2 process P1 and P2 are as follows:
Suppose 2 process P1 and P2 are as follows:
User Avatar
1 votes
0 answers
1936
Personal doubt
(i) What is Load/Store? (ii) Explain fetch-and-set. is there any relation between these two or any basis of comparision?
(i) What is Load/Store?(ii) Explain fetch-and-set.is there any relation between these two or any basis of comparision?
User Avatar
1 votes
1 answer
1938
operating system
User Avatar
1 votes
0 answers
1940
Deadlock
Caption
Caption
User Avatar
2 votes
1 answer
1941
operating system
if file size is large and is to be accessed randomly then which allocation strategy is best? A. linked B. indexed c. contigous
if file size is large and is to be accessed randomly then which allocation strategy is best?A. linkedB. indexedc. contigous
User Avatar
1 votes
0 answers
1942
Process
Ans is given Page table but in Galvin it is mentioned that it does contain it .... Kindly explain.. even I get that their addresses are stored but we can't rule out the option if it is given in book.. Isn't so?
Ans is given Page table but in Galvin it is mentioned that it does contain it .... Kindly explain.. even I get that their addresses are stored but we can't rule out the o...
User Avatar
2 votes
0 answers
1943
Process_Scheduling
Consider this table : Using SRTF policy what is the avg waiting time? given options : $2 \ 3 \ 4 \ 5$ I am getting $\Large {\frac{5}{3}} $\approx 1.67$
Consider this table : Using SRTF policy what is the avg waiting time?given options :$2 \ 3 \ 4 \ 5$I am getting $\Large {\frac{5}{3}} $$\approx 1.67$
User Avatar
1 votes
2 answers
1946
Peterson's solution
Which of the following statement is/are True? i)Bounded waiting is satisfied in Strict alternation mechanism. ii)Bounded waiting satisfied in Peterson's solution. iii)Progress in Strict alternation mechanism. iv)Progress in Peterson's Solution
Which of the following statement is/are True?i)Bounded waiting is satisfied in Strict alternation mechanism.ii)Bounded waiting satisfied in Peterson's solution.iii)Progre...
User Avatar
1 votes
0 answers
1947
VIRTUAL MEMORY
Computer has 16 active applications, each with a 32 bit address space(4GB). What does system actually have? A) two 2GB memory module B) four 4GB memory module C) eight 8GB memory module D) one 16GB memory module
Computer has 16 active applications, each with a 32 bit address space(4GB).What does system actually have?A) two 2GB memory moduleB) four 4GB memory moduleC) eight 8GB me...
User Avatar
0 votes
1 answer
1949
Operating System Basic Question
why we do indexing and tagging in cache ??
why we do indexing and tagging in cache ??
User Avatar
Page: