Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Operating System
Recent questions tagged operating-system
4
votes
2
answers
2941
ISRO-2013-59
A starvation free job scheduling policy guarantees that no job indefinitely waits for a service. Which of the following job scheduling policies is starvation free? Priority queing Shortest job first Youngest job first Round robin
A starvation free job scheduling policy guarantees that no job indefinitely waits for a service. Which of the following job scheduling policies is starvation free?Priorit...
makhdoom ghaya
4.1k
views
makhdoom ghaya
asked
May 2, 2016
Operating System
isro2013
operating-system
process-scheduling
+
–
9
votes
7
answers
2942
ISRO-2013-58
Consider the following process and resource requirement of each process. Predict the state of this system, assuming that there are a total of $5$ instances of resource type $1$ and $4$ instances of resource type $2$. Can go to safe or unsafe state based on sequence Safe state Unsafe state Deadlock state
Consider the following process and resource requirement of each process.Predict the state of this system, assuming that there are a total of $5$ instances of resource typ...
makhdoom ghaya
7.7k
views
makhdoom ghaya
asked
May 2, 2016
Operating System
isro2013
operating-system
resource-allocation
+
–
6
votes
4
answers
2943
ISRO-2013-57
Which of the following is not a necessary condition for deadlock? Mutual exclusion Reentrancy Hold and wait No pre-emption
Which of the following is not a necessary condition for deadlock?Mutual exclusionReentrancyHold and waitNo pre-emption
makhdoom ghaya
3.2k
views
makhdoom ghaya
asked
May 2, 2016
Operating System
isro2013
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
+
–
6
votes
2
answers
2944
ISRO-2013-56
In a $64$- bit machine, with $2$ GB RAM, and $8$ KB page size, how many entries will be there in the page table if its is inverted? $2^{18}$ $2^{20}$ $2^{33}$ $2^{51}$
In a $64$- bit machine, with $2$ GB RAM, and $8$ KB page size, how many entries will be there in the page table if its is inverted?$2^{18}$$2^{20}$$2^{33}$$2^{51}$
makhdoom ghaya
6.0k
views
makhdoom ghaya
asked
May 2, 2016
Operating System
isro2013
operating-system
memory-management
paging
+
–
5
votes
2
answers
2945
ISRO2013-55
Consider a logical address space of $8$ pages of $1024$ words each, mapped onto a physical memory of $32$ frames. How many bits are there in the physical address and logical address respectively? $5, 3$ $10, 10$ $15, 13$ $15, 15$
Consider a logical address space of $8$ pages of $1024$ words each, mapped onto a physical memory of $32$ frames. How many bits are there in the physical address and logi...
makhdoom ghaya
33.4k
views
makhdoom ghaya
asked
May 2, 2016
Operating System
isro2013
operating-system
memory-management
+
–
4
votes
6
answers
2946
ISRO-2013-54
Which of the following are the likely causes of thrashing? Page size was very small. There are too many users connected to the system. Least recently used policy is used for page replacement. First in First out policy is used for page replacement.
Which of the following are the likely causes of thrashing?Page size was very small.There are too many users connected to the system.Least recently used policy is used for...
makhdoom ghaya
8.0k
views
makhdoom ghaya
asked
May 2, 2016
Operating System
isro2013
operating-system
memory-management
thrashing
+
–
3
votes
4
answers
2947
ISRO-2013-52
Suppose we have variable logical records of lengths of $5$ bytes, $10$ bytes and $25$ bytes while the physical block size in disk is $15$ bytes. What is the maximum and minimum fragmentation seen in bytes? $25$ and $5$ $15$ and $5$ $15$ and $0$ $10$ and $5$
Suppose we have variable logical records of lengths of $5$ bytes, $10$ bytes and $25$ bytes while the physical block size in disk is $15$ bytes. What is the maximum and m...
makhdoom ghaya
7.8k
views
makhdoom ghaya
asked
May 2, 2016
Operating System
isro2013
operating-system
io-handling
disk
+
–
5
votes
2
answers
2948
total address space
For a computer address,if we reduce the no of bits by 2 and if we double the addressability then total address space will be 1) Doubled 2) halved 3) Remain Same 4) None What is meant by Addressablity???
For a computer address,if we reduce the no of bits by 2 and if we double the addressability then total address space will be1) Doubled 2) halved 3) Remain Same 4) NoneWh...
bad_engineer
1.1k
views
bad_engineer
asked
May 1, 2016
Operating System
computer-networks
memory-management
operating-system
address
+
–
0
votes
3
answers
2949
Calculation of context switch overhead - ISI KOL -2014 Qstn 6(a)
Consider three processes, P1, P2, and P3. Their start times and execution times are given below Let x be the amount of time taken by the kernel to complete a context switch from any process Pi to Pj . For what ... P1, P2, P3 be reduced by choosing a Shortest Remaining Time First scheduling policy over a Shortest Job First policy?
Consider three processes, P1, P2, and P3. Their start times and executiontimes are given belowLet x be the amount of time taken by the kernel to complete a contextswitch ...
vix28
850
views
vix28
asked
Apr 26, 2016
Operating System
operating-system
+
–
41
votes
6
answers
2950
GATE CSE 1992 | Question: 12-b
Let the page reference and the working set window be $c\ c\ d\ b\ c\ e\ c\ e\ a\ d\ $ and $4$, respectively. The initial working set at time $t=0$ contains the pages $\{a,d,e\}$, where $a$ ... at time $t=-2$. Determine the total number of page faults and the average number of page frames used by computing the working set at each reference.
Let the page reference and the working set window be $c\ c\ d\ b\ c\ e\ c\ e\ a\ d\ $ and $4$, respectively. The initial working set at time $t=0$ contains the pages $\{a...
go_editor
11.3k
views
go_editor
asked
Apr 24, 2016
Operating System
gate1992
operating-system
memory-management
normal
descriptive
+
–
83
votes
6
answers
2951
GATE CSE 2003 | Question: 79
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, ... tables of this process is $\text{8 KB}$ $\text{12 KB}$ $\text{16 KB}$ $\text{20 KB}$
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical...
go_editor
24.0k
views
go_editor
asked
Apr 24, 2016
Operating System
gatecse-2003
operating-system
normal
virtual-memory
+
–
55
votes
7
answers
2952
GATE CSE 2003 | Question: 81
Suppose we want to synchronize two concurrent processes $P$ and $Q$ using binary semaphores $S$ and $T$. The code for the processes $P$ and $Q$ ... $1$ $V(S)$ at $W, V(T)$ at $X, P(S)$ at $Y, P(T)$ at $Z, S$ and $T$ initially $1$
Suppose we want to synchronize two concurrent processes $P$ and $Q$ using binary semaphores $S$ and $T$. The code for the processes $P$ and $Q$ is shown below.$$\begin{ar...
go_editor
15.2k
views
go_editor
asked
Apr 24, 2016
Operating System
gatecse-2003
operating-system
process-synchronization
normal
+
–
42
votes
4
answers
2953
GATE CSE 2006 | Question: 79
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arrive and then all processes leave the barrier. Let the number of processes ... at the beginning of the barrier and re-enabled at the end. The variable process_left is made private instead of shared
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arr...
go_editor
8.4k
views
go_editor
asked
Apr 24, 2016
Operating System
gatecse-2006
operating-system
process-synchronization
normal
+
–
16
votes
4
answers
2954
GATE CSE 2007 | Question: 83
A process, has been allocated $3$ ... above reference string, how many more page faults occur with LRU than with the optimal page replacement policy? $0$ $1$ $2$ $3$
A process, has been allocated $3$ page frames. Assume that none of the pages of the process are available in the memory initially. The process makes the following sequenc...
go_editor
6.7k
views
go_editor
asked
Apr 23, 2016
Operating System
gatecse-2007
normal
operating-system
page-replacement
+
–
33
votes
5
answers
2955
GATE CSE 2009 | Question: 52
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s \rangle$, where $c$ is the cylinder number, $h$ is the surface number and $s$ is the sector ... $\langle 0, 16, 30 \rangle$ $\langle 0, 16, 31 \rangle$ $\langle 0, 17, 31 \rangle$
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s...
go_editor
10.5k
views
go_editor
asked
Apr 23, 2016
Operating System
gatecse-2009
operating-system
disk
normal
+
–
58
votes
4
answers
2956
GATE CSE 2013 | Question: 53
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $\text{(T1)},$ which occupies exactly one ... to guarantee that no two synonyms map to different sets in the processor cache of this computer? $2$ $4$ $8$ $16$
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three–level paged page table organization. The page table base register stores ...
go_editor
30.3k
views
go_editor
asked
Apr 21, 2016
Operating System
gatecse-2013
normal
operating-system
virtual-memory
+
–
8
votes
2
answers
2957
GATE CSE 1991 | Question: 11,b
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$. Pi; repeat flag[i] := true; while flag [j] or flag[k] do case turn of j: if flag [j] then begin flag ... in which a waiting process can never enter the critical section? If so, explain and suggest modifications to the code to solve this problem
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$.Pi;repeat flag[i] := true; while flag [j] or fl...
go_editor
2.1k
views
go_editor
asked
Apr 18, 2016
Operating System
gate1991
process-synchronization
normal
operating-system
descriptive
+
–
0
votes
0
answers
2958
process schdeuling
The IO wait percentage w of a process is the percentage of time the process wait for an IO to completion when executed in a monoprogramming enviorment . on a system using round robin with n process ,all having same IO . what percentage of time cpu will be idle in term of (w) ?
The IO wait percentage w of a process is the percentage of time the process wait for an IO to completion when executed in a monoprogramming enviorment . on a system using...
priti
537
views
priti
asked
Mar 18, 2016
Operating System
process-scheduling
operating-system
+
–
1
votes
1
answer
2959
process scheduling
Consider the progarm to be run on a computer using Round robin scheduling . The program size is 100K . hard disk transfer rate is 1mbps .Average latency is 8ms . assuming no head seek , what could be the acceptable time quantum for cpu utlization 1) 11oms 2) 180ms 3)210ms d)none
Consider the progarm to be run on a computer using Round robin scheduling . The program size is 100K . hard disk transfer rate is 1mbps .Average latency is 8ms . assuming...
priti
558
views
priti
asked
Mar 16, 2016
Operating System
process-scheduling
operating-system
+
–
0
votes
1
answer
2960
MadeEasy Test Series: Operating System - Disk Scheduling
Consider the following disk request sequence for a disk with 100 tracks. 98, 183, 37, 122, 14, 124, 65, 67 Head pointer starting at 53 (current position of R/W heads).Find the number of head movements in cylinders using SSTF scheduling.
Consider the following disk request sequence for a disk with 100 tracks.98, 183, 37, 122, 14, 124, 65, 67Head pointer starting at 53 (current position of R/W heads).Find ...
Jitendra Verma
3.4k
views
Jitendra Verma
asked
Mar 16, 2016
Operating System
made-easy-test-series
operating-system
disk-scheduling
+
–
0
votes
2
answers
2961
MadeEasy Test Series: Operating System - Disk Scheduling
Consider the following disk request sequence for a disk with 100 tracks. 98, 183, 37, 122, 14, 124, 65, 65, 67 Head pointer starting at 53 (current position of R/W heads) and moving in left direction.Find the number of head movements in cylinders using SCAN scheduling.
Consider the following disk request sequence for a disk with 100 tracks.98, 183, 37, 122, 14, 124, 65, 65, 67Head pointer starting at 53 (current position of R/W heads) a...
Jitendra Verma
2.3k
views
Jitendra Verma
asked
Mar 16, 2016
Operating System
made-easy-test-series
operating-system
disk-scheduling
+
–
0
votes
1
answer
2962
Process scheduling
Determine True/ False for the following statement ? 1. prefetching is a method of overlapping the I/o of a job with that jon own computation 2.With spooling scheme , where the CPU overlaps the input of one job with the computation and output of other jobs 3.Spooling is handled transparently by system 4.Spooling is much more effective way of overlapping I/O and CPu operation
Determine True/ False for the following statement ?1. prefetching is a method of overlapping the I/o of a job with that jon own computation 2.With spooling scheme , where...
priti
597
views
priti
asked
Mar 15, 2016
Operating System
process-scheduling
operating-system
+
–
5
votes
2
answers
2963
Process scheduling
Consider the following preemptive priority-scheduling algorithm based on dynamically changing priorities. Larger priority numbers imply higher priority. When a process is waiting for the CPU (in the ready queue but not running), its priority changes at a rate X when it is ... is the algorithm that results from Y>X>0? a. LIFO b. FCFS c. Round Robin d. None of the above
Consider the following preemptive priority-scheduling algorithm based on dynamically changing priorities. Larger priority numbers imply higher priority. When a process is...
priti
7.9k
views
priti
asked
Mar 15, 2016
Operating System
process-scheduling
operating-system
+
–
2
votes
2
answers
2964
MadeEasy Test Series: Operating System - Process Synchronization
Description of Peterson's Algorithm & also for which problem it is used to solve (1) deadlock (2) mutual exclusion (3) Thrashing (4) Paging.
Description of Peterson's Algorithm & also for which problem it is used to solve(1) deadlock(2) mutual exclusion(3) Thrashing(4) Paging.
Jitendra Verma
3.1k
views
Jitendra Verma
asked
Mar 11, 2016
Operating System
made-easy-test-series
operating-system
process-synchronization
+
–
6
votes
5
answers
2965
GATE CSE 1998 | Question: 25b
Consider a disk with $c$ cylinders, $t$ tracks per cylinder, $s$ sectors per track and a sector length $s_l$. A logical file $d_l$ with fixed record length $r_l$ is stored continuously on this disk starting at location $(c_L, t_L, s_L)$, where ... the formula to calculate the disk address (i.e. cylinder, track and sector) of a logical record n assuming that $r_l=s_l$.
Consider a disk with $c$ cylinders, $t$ tracks per cylinder, $s$ sectors per track and a sector length $s_l$. A logical file $d_l$ with fixed record length $r_l$ is stor...
Arjun
3.0k
views
Arjun
asked
Mar 6, 2016
Operating System
gate1998
operating-system
disk
descriptive
+
–
112
votes
7
answers
2966
GATE CSE 2016 Set 1 | Question: 50
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ ... in the critical section at any time The bounded wait condition is satisfied The progress condition is satisfied It cannot cause a deadlock
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ returns an inte...
Sandeep Singh
47.7k
views
Sandeep Singh
asked
Feb 12, 2016
Operating System
gatecse-2016-set1
operating-system
process-synchronization
difficult
ambiguous
+
–
45
votes
5
answers
2967
GATE CSE 2016 Set 1 | Question: 48
Cylinder a disk queue with requests for $I/O$ to blocks on cylinders $47, 38, 121, 191, 87, 11, 92, 10.$ The C-LOOK scheduling algorithm is used. The head is initially at cylinder number $63$, moving towards larger cylinder ... are numbered from $0$ to $199$. The total head movement (in number of cylinders) incurred while servicing these requests is__________.
Cylinder a disk queue with requests for $I/O$ to blocks on cylinders $47, 38, 121, 191, 87, 11, 92, 10.$ The C-LOOK scheduling algorithm is used. The head is initially at...
Sandeep Singh
19.7k
views
Sandeep Singh
asked
Feb 12, 2016
Operating System
gatecse-2016-set1
operating-system
disk-scheduling
normal
numerical-answers
+
–
69
votes
10
answers
2968
GATE CSE 2016 Set 1 | Question: 49
Consider a computer system with ten physical page frames. The system is provided with an access sequence $(a_{1}, a_{2},....,a_{20}, a_{1}, a_{2},...a_{20})$, where each $a_{i}$ is a distinct virtual page number. The difference in the number of page faults between the last-in-first-out page replacement policy and the optimal page replacement policy is_________.
Consider a computer system with ten physical page frames. The system is provided with an access sequence $(a_{1}, a_{2},....,a_{20}, a_{1}, a_{2},...a_{20})$, where each ...
Sandeep Singh
19.1k
views
Sandeep Singh
asked
Feb 12, 2016
Operating System
gatecse-2016-set1
operating-system
page-replacement
normal
numerical-answers
+
–
32
votes
3
answers
2969
GATE CSE 2016 Set 1 | Question: 47
Consider a computer system with $40$-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per process and each page table entry requires $48$ bits, then the size of the per-process page table is __________ megabytes.
Consider a computer system with $40$-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per process and each pag...
Sandeep Singh
13.7k
views
Sandeep Singh
asked
Feb 12, 2016
Operating System
gatecse-2016-set1
operating-system
virtual-memory
easy
numerical-answers
+
–
52
votes
5
answers
2970
GATE CSE 2016 Set 1 | Question: 20
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ... quantum less than the shortest CPU burst Uniform random Highest priority first with priority proportional to CPU burst length
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process schedu...
Sandeep Singh
14.3k
views
Sandeep Singh
asked
Feb 12, 2016
Operating System
gatecse-2016-set1
operating-system
process-scheduling
normal
+
–
Page:
« prev
1
...
94
95
96
97
98
99
100
101
102
103
104
...
114
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register