Final answer:
The expressions are rewritten to take advantage of concurrent processing with five processors, using COBEGIN and COEND to structure calculations in parallel. Each operation within the expressions is assigned to different processors to optimize the computation time. Simplification and reasonability checks are important steps to ensure correct results.
Step-by-step explanation:
The question asks for rewriting arithmetic expressions to take advantage of a concurrent processing system with five processors. Using COBEGIN and COEND statements, we can structure the expressions to be calculated in parallel. Here are the pseudocode examples for each given expression:
- For expression (B*R) + (Y*Z) - (N*M) + C^2, we can calculate B*R, Y*Z, and N*M in parallel, after which we'll combine the results with C^2:
COBEGIN
P1: BR = B * R
P2: YZ = Y * Z
P3: NM = N * M
COEND
RESULT = BR + YZ - NM + C^2
- For expression B*(R+Y)*(Z-N)*M + C^2, we can compute B*(R+Y) and (Z-N)*M in parallel:
COBEGIN
P1: BY = B * (R + Y)
P2: ZNM = (Z - N) * M
COEND
RESULT = BY * ZNM + C^2
- For expression (A*(B*C)*(D*E) + F + G - H), each multiplication can occur in parallel:
COBEGIN
P1: ABC = A * (B * C)
P2: DE = D * E
COEND
RESULT = ABC * DE + F + G - H
- For expression ((J + K*L*M*N)*I), K*L*M*N can be processed in parallel with the addition of J:
COBEGIN
P1: KLMN = K * L * M * N
COEND
RESULT = (J + KLMN) * I
It is essential to eliminate terms wherever possible to simplify the algebra and to check if the result is reasonable. This demonstrates the power of concurrent processing where calculations are distributed amongst multiple processors, reducing the overall computation time.