# Recent questions tagged operating-system

1
The file manager is responsible for naming files saving files deleting files all of these
1 vote
2
In real-time operating systems, which of the following is the most suitable scheduling scheme? round-robin first-come-first-served preemptive random scheduling
3
If there are $32$ segments, each of size $1$ K byte, then the logical address should have $13 \text{ bits}$ $14 \text{ bits}$ $15 \text{ bits}$ $16 \text{ bits}$
1 vote
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
1 vote
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$
1 vote
6
Which of the following scheduling algorithms could result in starvation? Priority Round Robin FCFS None of the above
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$
8
Which two are valid constructions for Thread? Thread(Runnable r, String name) Thread() Thread(int priority) Thread(Runnable r, ThreadGroup g) Thread(Runnable r, int priority) $1$ and $3$ $2$ and $4$ $1$ and $2$ $2$ and $5$
1 vote
9
If a processor has $32$-bit virtual address, $28$-bit physical address, $2$ kb pages. How many bits are required for the virtual, physical page number? $17,21$ $21,17$ $6,10$ None
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$
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
1 vote
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
13
Operating System maintains the page table for : each process each thread each instruction each address
1 vote
14
Non-contiguous memory allocation splits program into blocks of memory called ________ that can be loaded in non-adjacent holes in main memory. Pages Frames Partition Segments
1 vote
15
What is Compaction ? a technique for overcoming internal fragmentation a paging technique a technique for overcoming external fragmentation a technique for overcoming fatal error
1 vote
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
17
How many times the word "PROCESS" will be printed when executing the following program ? main(){ printf("PROCESS"); fflush(); fork(); fork(); } $8$ $4$ $6$ $7$
1 vote
18
The open file table has a/an __________ associated with each file. file content file permission open count close count
1 vote
19
The process of loading the operating system into memory is called : Booting Spooling Thrashing Formatting
1 vote
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
1 vote
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
1 vote
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
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.
24
The file structure that redefines its first record at a base of zero uses the term relative organization. key fielding. dynamic reallocation. all of these.
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.
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
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.
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
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.