# Recent questions tagged operating-system

1
Consider a hypothetical machine with $3$ pages of physical memory, $5$ pages of virtual memory, and $<A, B, C, D, A, B, E, A, B, C, D, E, B, A, B>$ as the stream of page reference by an application. If $P$ and $Q$ are the number of page faults that the application ... respectively, then $(P,Q)=$ _______(Assuming enough space for storing $3$ page frames) $(11,10)$ $(12,11)$ $(10,11)$ $(11,12)$
2
Consider a disk system having $60$ cylinders. Disk requests are received by a disk drive for cylinders $10,22,20,2,40,6$ and $38$, in that order. Assuming the disk head is currently at cylinder $20$, what is the time taken to satisfy all the ... cylinder to adjacent one and Shortest Seek Time First (SSTF) algorithm is used? $240$ milliseconds $96$ milliseconds $120$ milliseconds $112$ milliseconds
3
Suppose you have a Linux file system where the block size is $2K$ bytes, a disk address is $32$ bits, and an $i-$node contains the disk addresses of the first $12$ direct blocks of file, a single indirect block and a double indirect block. Approximately, what is the largest file that can be represented by an $i-$node? $513$ Kbytes $513$ MBytes $537$ Mbytes $537$ KBytes
1 vote
4
Consider a single-level page table system, with the page table stored in the memory. If the hit rate to TLB is $80\%$, and it takes $15$ nanoseconds to search the $TLB$, and $150$ nanoseconds to access the main memory, then what is the effective memory access time, in nanoseconds? $185$ $195$ $205$ $175$
5
Match $\text{List I}$ with $\text{List II}$ ... C-III, D-IVA-II, B-IV, C-III, D-IA-II, B-IV, C-I, D-IIIA-IV, B-III, C-II, D-I$Match$
1 vote
6
Assuming that the system call $\text{fork}()$ never fails, consider the following C program $P1$ and $P2$ ... Both Statement $I$ and Statement $II$ are false Statement $I$ is correct but Statement $II$ is false Statement $I$ is incorrect but Statement $II$ is true
7
Comprehension: For the question given below: concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. If $T$ is the capacity of a track in bytes, and $S$ is the capacity of each surface in ... $(T,S)=$ _______ $(50 K, 50000 K)$ $(25 K, 25000 K)$ $(25 K, 50000 K)$ $(40 K, 36000 K)$
8
Comprehension: For the question given below: concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. What is the capacity of the disk, in bytes? $25,000 K$ $500,000 K$ $250,000 K$ $50,000 K$
9
Comprehension: For the question given below: concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. Given below are two statements: Statement $I$: The ... $II$ are false Statement $I$ is correct but Statement $II$ is false Statement $I$ is incorrect but Statement $II$ is true
10
Comprehension: For the question given below, concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. If the disk platters rotate at $5400$ rpm ( ... minute), then approximately what is the maximum rotational delay? $0.011$ seconds $0.11$ seconds $0.0011$ seconds $1.1$ seconds
11
For the question given below, concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. If one track of data can be transferred per revolution, then what is the data transfer rate? $2,850$ KBytes/second $4,500$ KBytes/second $5,700$ KBytes/second $2,250$ KBytes/second
12
The file manager is responsible for naming files saving files deleting files all of these
13
In real-time operating systems, which of the following is the most suitable scheduling scheme? round-robin first-come-first-served preemptive random scheduling
14
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
15
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
16
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$
17
Which of the following scheduling algorithms could result in starvation? Priority Round Robin FCFS None of the above
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$
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$
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