# UGC-NET | UGC NET CS 2015 Jun – II | Question 46

• Last Updated : 19 Nov, 2018

In the case of parallelization, Amdahl’s law states that if P is the proportion of a program that can be made parallel and (1 – P) is the proportion that cannot be parallelized, then the maximum speed-up that can be achieved by using N processors is:
(A) $\frac{1}{(1-P)&space;+&space;N.P}$
(B) $\frac{1}{(N&space;-&space;1)P&space;+&space;P}$
(C) $\frac{1}{(1&space;-&space;P)&space;+&space;\frac{P}{N}}$
(D) $\frac{1}{(&space;P)&space;+&space;\frac{(1&space;-&space;P)}{N}}$

$\frac{1}{(1&space;-&space;P)&space;+&space;\frac{P}{N}}$