Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 39 (Page No. 177)

Question

Consider the following piece of C code:
 

void main( ) {

      fork( );
      fork( ); 
      exit( ); 

} 

How many child processes are created upon execution of this program?

Answer 1

Total child process = 2^n -1  , where n is number of time fork will call

 

2^2-1 =3

Answer 2

here fork() fnction is executing twice and n=2.

we the nos of child processes are  (2^n)-1= (2^2)-1=4-1=3

Answer 3

Generally when a fork is called for n times then total number of child processes that is generated is 2^(n)-1

In the above problem it is called 2 times so it generates 2^(2)-1 =3 number of child processes will be generated.

Answer 4

No of child processes created is 2^n-1.

Here n is the number of times fork is called.