Answer:
1035
Step-by-step explanation:
Pipelining is a technique used in carrying out several instructions at the same time. The pipeline is divided into stages, each of which is attached to the next to create a pipe-like structure.
The parallelizability is calculated by multiplying the number of different instances of a given operation by the number of pipeline stages through which the operation can be separated.
From the given information:
The no of instruction (n) to be executed on CPU = 1024
The no of stages in a pipeline K = 12
The total minimum number of cycles = k + n - 1
= 12 + 1024 - 1
= 1035