Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for operating-system+gate1998
47
votes
9
answers
1
GATE CSE 1998 | Question: 2.18, UGCNET-June2012-III: 48
If an instruction takes $i$ microseconds and a page fault takes an additional $j$ microseconds, the effective instruction time if on the average a page fault occurs every $k$ instruction is: $i + \dfrac{j}{k}$ $i +(j\times k)$ $\dfrac{i+j}{k}$ $({i+j})\times {k}$
If an instruction takes $i$ microseconds and a page fault takes an additional $j$ microseconds, the effective instruction time if on the average a page fault occurs every...
Kathleen
19.2k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
virtual-memory
easy
ugcnetcse-june2012-paper3
+
–
89
votes
5
answers
2
GATE CSE 1998 | Question: 2.17, UGCNET-Dec2012-III: 43
Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the overhead resulting from process switching is minimized but at the same time each process is guaranteed to get ... $q \leq \frac{t-ns}{n+1}$ $q \geq \frac{t-ns}{n+1}$
Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the over...
Kathleen
21.7k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
process-scheduling
normal
ugcnetcse-dec2012-paper3
+
–
47
votes
5
answers
3
GATE CSE 1998 | Question: 7-b
In a computer system where the best-fit' algorithm is used for allocating jobs' to memory partitions', the following situation was encountered:$\begin{array}{|l|l|} \hline \textbf{Partitions size in $KB$} & \textbf{$ ... $} \\\hline \end{array}$When will the $20K$ job complete?
In a computer system where the ‘best-fit’ algorithm is used for allocating ‘jobs’ to ‘memory partitions’, the following situation was encountered:$$\begin{arr...
Arjun
12.7k
views
Arjun
asked
Jul 10, 2015
Operating System
gate1998
operating-system
process-scheduling
normal
+
–
29
votes
4
answers
4
GATE CSE 1998 | Question: 1.32
A computer has six tape drives, with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock free? $6$ $5$ $4$ $3$
A computer has six tape drives, with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock fr...
Kathleen
14.0k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
resource-allocation
normal
+
–
28
votes
4
answers
5
GATE CSE 1998 | Question: 1.18
Which of the following devices should get higher priority in assigning interrupts? Hard disk Printer Keyboard Floppy disk
Which of the following devices should get higher priority in assigning interrupts?Hard diskPrinterKeyboardFloppy disk
Kathleen
12.2k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
interrupts
normal
+
–
19
votes
4
answers
6
GATE CSE 1998 | Question: 1.31
A counting semaphore was initialized to $10$. Then $6 P$ (wait) operations and $4V$ (signal) operations were completed on this semaphore. The resulting value of the semaphore is $0$ $8$ $10$ $12$
A counting semaphore was initialized to $10$. Then $6 P$ (wait) operations and $4V$ (signal) operations were completed on this semaphore. The resulting value of the semap...
Kathleen
13.9k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
process-synchronization
semaphore
easy
+
–
45
votes
4
answers
7
GATE CSE 1998 | Question: 24
Four jobs are waiting to be run. Their expected run times are $6, 3, 5$ and $x.$ In what order should they be run to minimize the average response time? Write a concurrent program using $\text{par begin-par end}$ to represent the precedence graph shown below.
Four jobs are waiting to be run. Their expected run times are $6, 3, 5$ and $x.$ In what order should they be run to minimize the average response time?Write a concurrent...
Kathleen
12.0k
views
Kathleen
asked
Sep 26, 2014
Operating System
gate1998
operating-system
process-scheduling
descriptive
+
–
32
votes
3
answers
8
GATE CSE 1998 | Question: 1.30
When the result of a computation depends on the speed of the processes involved, there is said to be cycle stealing race condition a time lock a deadlock
When the result of a computation depends on the speed of the processes involved, there is said to becycle stealingrace conditiona time locka deadlock
Kathleen
10.0k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
easy
process-synchronization
+
–
6
votes
5
answers
9
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
2.9k
views
Arjun
asked
Mar 6, 2016
Operating System
gate1998
operating-system
disk
descriptive
+
–
18
votes
4
answers
10
GATE CSE 1998 | Question: 1.29
Which of the following is an example of a spooled device? The terminal used to enter the input data for the C program being executed An output device used to print the output of a number of jobs The secondary memory device in a virtual storage system The swapping area on a disk used by the swapper
Which of the following is an example of a spooled device?The terminal used to enter the input data for the C program being executedAn output device used to print the outp...
Kathleen
4.7k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
io-handling
easy
+
–
26
votes
3
answers
11
GATE CSE 1998 | Question: 25-a
Free disk space can be used to keep track of using a free list or a bit map. Disk addresses require $d$ bits. For a disk with $B$ blocks, $F$ of which are free, state the condition under which the free list uses less space than the bit map.
Free disk space can be used to keep track of using a free list or a bit map. Disk addresses require $d$ bits. For a disk with $B$ blocks, $F$ of which are free, state the...
Kathleen
5.2k
views
Kathleen
asked
Sep 26, 2014
Operating System
gate1998
operating-system
disk
descriptive
+
–
26
votes
4
answers
12
GATE CSE 1998 | Question: 2.16
The overlay tree for a program is as shown below: What will be the size of the partition (in physical memory) required to load (and run) this program? $\text{12 KB}$ $\text{14 KB}$ $\text{10 KB}$ $\text{8 KB}$
The overlay tree for a program is as shown below:What will be the size of the partition (in physical memory) required to load (and run) this program?$\text{12 KB}$$\text{...
Kathleen
8.2k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
normal
memory-management
+
–
3
votes
2
answers
13
GATE CSE 1998 | Question: 17
Calculate the total time required to read 35 sectors on a 2-sided floppy disk. Assume that each track has 8 sectors and the track-to-track step time is 8 milliseconds. The first sector to be read is sector 3 on track 10. Assume that the diskette ... sectored and the controller has a 1-sector buffer. The diskette spins at 300 RPM and initially, the head is on track 10.
Calculate the total time required to read 35 sectors on a 2-sided floppy disk. Assume that each track has 8 sectors and the track-to-track step time is 8 milliseconds. Th...
Kathleen
2.9k
views
Kathleen
asked
Sep 26, 2014
Operating System
gate1998
operating-system
disk
normal
numerical-answers
out-of-syllabus-now
+
–
22
votes
3
answers
14
GATE CSE 1998 | Question: 2-9
Formatting for a floppy disk refers to arranging the data on the disk in contiguous fashion writing the directory erasing the system data writing identification information on all tracks and sectors
Formatting for a floppy disk refers toarranging the data on the disk in contiguous fashionwriting the directoryerasing the system datawriting identification information o...
Kathleen
7.3k
views
Kathleen
asked
Sep 25, 2014
Operating System
gate1998
operating-system
disk
normal
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register