## MAGMA Interview Question for Software Engineer / Developers

Comment hidden because of low score. Click to expand.
0
of 0 vote

i = 0 ;
while (i < n )
{
fork();
printf("\n SIVA");
i++;
}

1) if n > 0, 2^n + 2^n-1 + .... 2^1

i = 0 ;
while (i < n )
{
printf("\n SIVA");
fork();
i++;
}

2) if n > 0, 2^n-1 + 2^n-2 + ... + 2^0

Comment hidden because of low score. Click to expand.
0
of 0 vote

I guess you could write like a recurrence solution (T(n) would be the answer for n iterations) and then solve it.

Like in the first case, it will be T(n)=2+2T(n-1) and T(1) = 2.

in the second case, it would be T(n)=1+2T(n-1) and T(1) = 1.

Solve for T(n).

Comment hidden because of low score. Click to expand.
0
of 0 vote

Few interview questions on fork()
How many processes are created in this snippet?
Main()
{
Fork();
Fork() && fork () || fork ();
Fork ();
}
anandtechblog.blogspot.com/2011/07/process-flow.html

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

### Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.