search
Log In

Recent questions tagged operating-system

1 vote
4 answers
2
2 votes
3 answers
3
1 vote
2 answers
4
The seek time of a disk is $30$ ms. It rotates at the rate of $30$ rotations/second. The capacity of each track is $300$ words. The access time is (approximately) $62$ ms $60$ ms $50$ ms $47$ ms
asked Apr 2 in Operating System Lakshman Patel RJIT 100 views
1 vote
2 answers
5
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 as follows. What is the number of Page Faults? $0100,0200,0430,0499,0510,0530,0560,0120,0220,0240,0260,0320,0370.$ $15,4$ $6,4$ $7,2$ $4,6$
asked Apr 1 in Operating System Lakshman Patel RJIT 149 views
2 votes
2 answers
7
Consider a system having $’m’$ resources of the same type. These resources are shared by $3$ processes $A,B,C;$ which have peak time demands of $3,4,6$ respectively. The minimum value of $’m’$ that ensures that deadlock will never occur is $11$ $12$ $13$ $14$
asked Apr 1 in Operating System Lakshman Patel RJIT 133 views
0 votes
1 answer
8
1 vote
1 answer
9
0 votes
1 answer
10
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 as follows. What is the number of Page Faults? $0100,0200,0430,0510,0530,0560,0120,0220,0240,0260,0320,0370.$ $15,4$ $6,4$ $7,2$ $4,6$
asked Apr 1 in Operating System Lakshman Patel RJIT 73 views
0 votes
1 answer
11
Disk request come to a disk driver for cylinders in the order $10,22,20,2,40,6$ and $38,$ at a time when the disk drive is reading from cylinder $20$. The total seek time, if the disk arm scheduling algorithm is first-come-first-served is $900$ ms $850$ ms $360$ ms $876$ ms
asked Apr 1 in Operating System Lakshman Patel RJIT 97 views
1 vote
3 answers
12
If file size is large and if it is to be accessed randomly then which of the following allocation strategy should be best to use in a system? Linked allocation Indexed allocation Contiguous allocation None of the options
asked Mar 31 in Operating System Lakshman Patel RJIT 169 views
1 vote
2 answers
14
1 vote
1 answer
15
1 vote
1 answer
16
Process is in a ready state _______ . when process is scheduled to run after some execution when process is unable to run until some task has been completed when process is using the $CPU$ none of the options
asked Mar 31 in Operating System Lakshman Patel RJIT 163 views
0 votes
2 answers
17
1 vote
1 answer
19
1 vote
2 answers
20
In a particular system it is observed that, the cache performance gets improved as a result of increasing the block size of the cache. The primary reason behind this is : Programs exhibits temporal locality Programs have small working set Read operation is frequently required rather than write operation Programs exhibits spatial locality
asked Mar 31 in Operating System Lakshman Patel RJIT 166 views
1 vote
2 answers
21
Starvation can be avoided by which of the following statements: By using shortest job first resource allocation policy . By using first come first serve resources allocation policy. (i) only (i) and (ii) only (ii) only None of the options
asked Mar 31 in Operating System Lakshman Patel RJIT 137 views
1 vote
1 answer
22
Page fault frequency in an operating system is reduced when the : Process tend to be I/O bound Locality of reference is applicable to the process Size of pages is reduced Processes tend to be CPU bound
asked Mar 31 in Operating System Lakshman Patel RJIT 112 views
0 votes
2 answers
23
When we move from the outermost track to the innermost track in a magnetic disk, then density(bits per linear inch) increases. decreases. remains the same. either remains constant or decreases.
asked Mar 31 in Operating System Lakshman Patel RJIT 224 views
0 votes
1 answer
24
0 votes
0 answers
25
What is the elapsed time of $P$ if records of $F$ are organized using a blocking factor of $2$(i.e. each block on $D$ contains two records of $F$) and $P$ uses one buffer? $12$ sec. $14$ sec. $17$ sec. $21$ sec.
asked Mar 31 in Operating System Lakshman Patel RJIT 145 views
0 votes
0 answers
26
A long-term monitor should show any immediate performance problems should show I/O, paging and processor activity need show only the I/O and processor activity usually reports only on terminal displays
asked Mar 31 in Operating System Lakshman Patel RJIT 162 views
0 votes
1 answer
27
Determine the number of page faults when references to pages occur in the following order: $1,2,4,5,2,1,2,4$. Assume that the main memory can accommodate $3$ pages and the main memory already has the pages $1$ and $2$, with page $1$ having been brought earlier than page $2$.(LRU algorithm is used). $3$ $5$ $4$ None of these.
asked Mar 31 in Operating System Lakshman Patel RJIT 146 views
0 votes
1 answer
28
Working set$(t,k)$ at an instant of time, $t$,is The set of $k$ future references that the operating system will make The set of future references that the operating system will make in the next $'k'$ time units The set of $k$ references with high frequency The set of pages that have been referenced in the last $k$ time units
asked Mar 31 in Operating System Lakshman Patel RJIT 116 views
1 vote
1 answer
30
Which of the following statements about semaphores is true? $P$ and $V$ operations should be indivisible operations. A semaphore implementation should guarantee that threads do not suffer indefinite postponement. If several threads attempt a $P(S)$ operation simultaneously, only one thread should be allowed to proceed. All of the above.
asked Mar 31 in Operating System Lakshman Patel RJIT 196 views
...