3,849 views

2 Answers

Best answer
16 votes
16 votes
No of child process created by $n$ fork calls in series =$2^{n}-1$

With 3 three fork process =7

Option C is correct.
selected by
1 votes
1 votes
If a program has N series of fork call then total number of processes(including parent process) will be created = 2^N.

total number of child processes(New processes) = 2^N - 1

According to our Question, N=3

New processes = 2 ^3 - 1

                       = 7 processes
Answer:

Related questions

13 votes
13 votes
2 answers
1
go_editor asked Jun 19, 2016
10,092 views
Suppose a system contains $n$ processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited ready queue of the processst...
12 votes
12 votes
4 answers
2
go_editor asked Jun 17, 2016
3,851 views
In a lottery scheduler with 40 tickets, how we will distribute the tickets among 4 processes $P_1, P_2, P_3$ and $P_4$ such that each process gets 10%, 5%, 60% and 25% re...
6 votes
6 votes
2 answers
3
go_editor asked Jun 17, 2016
10,866 views
If there are 32 segments, each size 1 k bytes, then the logical address should have13 bits14 bits15 bits16 bits