# GATE | GATE CS 2008 | Question 66

• Difficulty Level : Basic
• Last Updated : 05 Apr, 2019

A process executes the following code

`for (i = 0; i < n; i++) fork();`

The total number of child processes created is
(A) n
(B) 2n - 1
(C) 2n
(D) 2(n+1) - 1

Explanation:

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

```         F0       // There will be 1 child process created by first fork
/     \
F1      F1    // There will be 2 child processes created by second fork
/  \    /  \
F2   F2  F2   F2  // There will be 4 child processes created by third fork
/ \   / \ / \  / \
...............   // and so on```

If we sum all levels of above tree for i = 0 to n-1, we get 2n - 1. So there will be 2n – 1 child processes. On the other hand, the total number of process created are (number of child processes)+1.

Note:The maximum number of process is 2n and may vary due to fork failures.Also see this post for more details.

My Personal Notes arrow_drop_up