Parallel Programming: Amdahl's Law

I Consider the following code segments that will be executed in a modern computer. Will these codes produce the same results? Which code segment will execute faster and why? ** double A[MAX][MAX]; double aSum=0; //code related to initialize array A for(i = 0; i