Test by Bikram | Operating Systems | Test 2 | Question: 1

Question

Assume that a certain process executes the following code segment.

for (i =0, i <=8, i++ )
fork() ;

The number of new processes created is _______

Answer 1

Here fork is called 9 times, hence number of child process created is (2^9 - 1) = 512 -1= 511

Comments

@bad

use this formula here 2ⁿ - 1

and subtract 1 for root node. think it like a full binary tree. 

read https://www.quora.com/If-fork-system-call-is-called-n-times-then-how-many-childs-are-created

---

I meant the question doesn't say child process it says new process so why root node(parent node) is not inlcuded???

---

new process means child process , if not stated. It is taken this way only.