Search results for operating-system+gate1997 / GATE Overflow for GATE CSE

51 votes

14 answers

1

GATE CSE 1997 | Question: 6.8
Each Process $P_i, i = 1\ldots 9$ is coded as follows repeat P(mutex) {Critical section} V(mutex) forever The code for $P_{10}$ is identical except it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment? $1$ $2$ $3$ None

Each Process $P_i, i = 1\ldots 9$ is coded as followsrepeat P(mutex) {Critical section} V(mutex) foreverThe code for $P_{10}$ is identical except it uses V(mutex) in plac...

Kathleen

25.1k views

Kathleen asked Sep 29, 2014

32 votes

2 answers

2

GATE CSE 1997 | Question: 3.7
I/O redirection implies changing the name of a file can be employed to use an existing file as input file for a program implies connecting $2$ programs through a pipe None of the above

I/O redirectionimplies changing the name of a filecan be employed to use an existing file as input file for a programimplies connecting $2$ programs through a pipeNone of...

Kathleen

8.6k views

Kathleen asked Sep 29, 2014

34 votes

3 answers

3

GATE CSE 1997 | Question: 3.10, ISRO2008-57, ISRO2015-64
Dirty bit for a page in a page table helps avoid unnecessary writes on a paging device helps maintain LRU information allows only read on a page None of the above

Dirty bit for a page in a page tablehelps avoid unnecessary writes on a paging devicehelps maintain LRU informationallows only read on a pageNone of the above

Kathleen

11.1k views

Kathleen asked Sep 29, 2014

25 votes

6 answers

4

GATE CSE 1997 | Question: 6.7
An operating system contains $3$ user processes each requiring $2$ units of resource $R$. The minimum number of units of $R$ such that no deadlocks will ever arise is $3$ $5$ $4$ $6$

An operating system contains $3$ user processes each requiring $2$ units of resource $R$. The minimum number of units of $R$ such that no deadlocks will ever arise is$3$$...

Kathleen

17.6k views

Kathleen asked Sep 29, 2014

32 votes

4 answers

5

GATE CSE 1997 | Question: 3.9
Thrashing reduces page I/O decreases the degree of multiprogramming implies excessive page I/O improve the system performance

Thrashingreduces page I/Odecreases the degree of multiprogrammingimplies excessive page I/Oimprove the system performance

Kathleen

13.3k views

Kathleen asked Sep 29, 2014

48 votes

4 answers

6

GATE CSE 1997 | Question: 3.8
When an interrupt occurs, an operating system ignores the interrupt always changes state of interrupted process after processing the interrupt always resumes execution of interrupted process after processing the interrupt may change state of interrupted process to ‘blocked’ and schedule another process.

When an interrupt occurs, an operating systemignores the interruptalways changes state of interrupted process after processing the interruptalways resumes execution of in...

Kathleen

13.9k views

Kathleen asked Sep 29, 2014

33 votes

2 answers

7

GATE CSE 1997 | Question: 74
A program $P$ reads and processes $1000$ consecutive records from a sequential file $F$ stored on device $D$ without using any file system facilities. Given the following Size of each record $= 3200$ bytes Access time of $D = 10$ ... a blocking factor of $2$ (i.e., each block on $D$ contains two records of $F$) and $P$ uses one buffer?

A program $P$ reads and processes $1000$ consecutive records from a sequential file $F$ stored on device $D$ without using any file system facilities. Given the following...

go_editor

7.6k views

go_editor asked Oct 14, 2015

41 votes

4 answers

8

GATE CSE 1997 | Question: 75
An operating system handles requests to resources as follows. A process (which asks for some resources, uses them for some time and then exits the system) is assigned a unique timestamp are when it starts. The timestamps are monotonically increasing with time. Let us denote ... , show how. If not prove it. Can a process P ever starve? If yes, show how. If not prove it.

An operating system handles requests to resources as follows.A process (which asks for some resources, uses them for some time and then exits the system) is assigned a un...

go_editor

7.6k views

go_editor asked Oct 14, 2015

24 votes

3 answers

9

GATE CSE 1997 | Question: 3.6
The correct matching for the following pairs is: ... $\text{A-4 B-3 C-2 D-1}$ $\text{A-2 B-4 C-1 D-3}$ $\text{A-3 B-4 C-3 D-2}$

The correct matching for the following pairs is:$$\small \begin{array}{cl|cl}\hline \text{(A)} &\text{Disk Scheduling} & \text{(1)} &\text{Round robin} \\\hline \text{...

Kathleen

5.7k views

Kathleen asked Sep 29, 2014

7 votes

3 answers

10

GATE CSE 1997 | Question: 73
A concurrent system consists of $3$ processes using a shared resource $R$ in a non-preemptible and mutually exclusive manner. The processes have unique priorities in the range $1 \dots 3$, $3$ being the highest priority. It is required to synchronize ... =true; else begin V(proceed [priority]); busy:=true; end V(mutex) Give the pseudo code for the procedure release_R.

A concurrent system consists of $3$ processes using a shared resource $R$ in a non-preemptible and mutually exclusive manner. The processes have unique priorities in the ...

go_editor

1.9k views

go_editor asked Oct 14, 2015

25 votes

2 answers

11

GATE CSE 1997 | Question: 3.5
Locality of reference implies that the page reference being made by a process will always be to the page used in the previous page reference is likely to be to one of the pages used in the last few page references will always be to one of the pages existing in memory will always lead to a page fault

Locality of reference implies that the page reference being made by a processwill always be to the page used in the previous page referenceis likely to be to one of the p...

Kathleen

9.5k views

Kathleen asked Sep 29, 2014

1 votes

3 answers

12

Deadlock
A computer has six tape drivers, with n processes competing for them. Each process may need two drivers. What is the maximum value of n for the system to be deadlock free? a] 6 b] 5 c] 4 d] 3

A computer has six tape drivers, with n processes competing for them. Each process may need two drivers. What is the maximum value of n for the system to be deadlock free...

Cruise Device

769 views

Cruise Device asked Jan 16, 2016

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true