Recent questions tagged precedence-graph / GATE Overflow for GATE CSE

2 votes

2 answers

1

Virtual Gate Test Series: Operating System - Fork-Join Concurrency Structure
Consider the code fragment: count = 3; S1; Fork L1; L1: S3; S2; goto L3; S4; Fork L2; L2: S6; goto L3; S5; L3: join count S7 Which one of the following represents correct precedence graph of the above code fragment? the answer is given but I’m getting where am I wrong?

Consider the code fragment: count = 3;S1;Fork L1; L1: S3; S2; goto L3;S4;Fork L2; L2: S6; goto L3;S5; L3: join countS7...

aditi19

3.9k views

aditi19 asked Jun 12, 2019

0 votes

0 answers

2

MadeEasy Workbook: Operating System - Precedence Graph
How to solve this question?

How to solve this question?

Jyoti Kumari97

651 views

Jyoti Kumari97 asked Jan 11, 2019

1 votes

0 answers

3

Precedence graph
Consider 2 schedules S1 and S2 with same set of transactions and precedence graph of S1 is same as precedence graph of S2. Which of the following statement is True? (a) Both S1 and S2 are conflict equal and conflict serializable schedule (b) Both S1 and S2 ... and S2 are conflict equal but may not equal schedules (d) Both S1 and S2 are conflict equal and but may not view equivalent

Consider 2 schedules S1 and S2 with same set of transactions and precedence graph of S1 issame as precedence graph of S2. Which of the following statement is True?(a) Bot...

hacker16

1.2k views

hacker16 asked Jan 18, 2018

6 votes

1 answer

4

GATE CSE 1989 | Question: 11b
Consider the following precedence graph $(\text{Fig}.6)$ of processes where a node denotes a process and a directed edge from node $P_{i}$ to node $P_{j}$ implies; that $P_{i}$ must complete before $P_{j}$ commences. Implement the graph using FORK and JOIN constructs. The actual computation done by a process may be indicated by a comment line.

Consider the following precedence graph $(\text{Fig}.6)$ of processes where a node denotes a process and a directed edge from node $P_{i}$ to node $P_{j}$ implies; that $...

makhdoom ghaya

2.5k views

makhdoom ghaya asked Dec 9, 2016

10 votes

2 answers

5

GATE CSE 1992 | Question: 12-a
Draw the precedence graph for the concurrent program given below S1 parbegin begin S2:S4 end; begin S3; parbegin S5; begin S6:S8 end parend end; S7 parend; S9

Draw the precedence graph for the concurrent program given belowS1 parbegin begin S2:S4 end; begin S3; parbegin S5; begin S6:S8 end parend end; S7 parend; S9

Kathleen

3.5k views

Kathleen asked Sep 13, 2014

16 votes

1 answer

6

GATE CSE 1991 | Question: 01-xii
A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______

A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______

Kathleen

3.3k views

Kathleen asked Sep 12, 2014

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