495 views

1 Answer

7 votes
7 votes
3rd precedence graph is correct.

What I think, we can solve it by checking the flow of the execution. First, after S1 , fork is done and new process's address S3. so two arrows from S1 (i.e S3;new process address , S2;normal execution) . Similarly proceed with other forks. At DEF we can see S5,S4,S2 can reach. So, these processes are combined.

Please correct me if it's wrong.

Related questions

298
views
0 answers
0 votes
7.4k
views
1 answers
0 votes
focus _GATE asked Jun 7, 2015
7,449 views
Consider the following code:for (i=0; i <20; i++) for ( j= 0; j< 10; j++) a[i] = a[i]* j ;a. Give one example of the spatial locality in the code.b. Give one example of t...
358
views
2 answers
2 votes
Isha Karn asked Dec 9, 2014
358 views
main() { int x, y= 100; float *P; P=&y; x=*P; printf("%d", x); }what is output?a) 100b) 1c) 0d) none
540
views
1 answers
0 votes
Isha Karn asked Dec 9, 2014
540 views
void main() { int x=10, y=5; swap(x,y); print(x,y); } void swap(int a, int b) { int c, x=0; c=a; a=b; b=c; }what is output using call by text?a) 5 0b) 5 10c) 10 0d) ...