Question

Given a set of arrays as follows:

A[100] consists of random number in between 1 and 100

B[100] consists of random number in between 10 and 50

C[100] consists of random number in between 1 and 10

D[100] consists of random number in between 1 and 50

E[100] consists of random number in between 1 and 5

F[100] consists of random number in between 10 and 80

Perform calculation based on the following formula

Y=(A*B)+C+(D*E)+(F/2)

Based on the results calculated, find the minimum and maximum values. Display the overall calculation results, minimum and maximum values. The array size is set to 100.

Hint 1:

You can apply the decomposition based on the processes, threads, or assign multiple data per thread (e.g. 10 data per thread, 10 threads OR 25 data per thread, 4 threads).

Hint 2:

In generating the random number, you may apply the following codes:

srand(time(NULL));

a[i] = rand() % 100 + 1;

b[i] = rand() % 50 + 10;

c[i] = rand() % 10 + 1;

d[i] = rand() % 50 + 1;

e[i] = rand() % 5 + 1;

f[i] = rand() % 80 + 10;

Hint 3:

You may refer to the following serial program as a sample. But your answers must not be limited to this example.

Sample serial program

#include #define ARRAY_SIZE 100 int main(){        int i;        double a[ARRAY_SIZE], b[ARRAY_SIZE], c[ARRAY_SIZE], d[ARRAY_SIZE], e[ARRAY_SIZE], f[ARRAY_SIZE], y[ARRAY_SIZE];        double min, max;        int imin, imax;        /*A[100] consists of random number in between 1 and 100        B[100] consists of random number in between 10 and 50        C[100] consists of random number in between 1 and 10        D[100] consists of random number in between 1 and 50        E[100] consists of random number in between 1 and 5        F[100] consists of random number in between 10 and 80*/        srand(time(NULL));        for (i = 0; i < ARRAY_SIZE; i++) {               a[i] = rand() % 100 + 1;               b[i] = rand() % 50 + 10;               c[i] = rand() % 10 + 1;               d[i] = rand() % 50 + 1;               e[i] = rand() % 5 + 1;               f[i] = rand() % 80 +10;    }        //Y=(A*B)+C+(D*E)+(F/2)        for (i = 0; i < ARRAY_SIZE; i++) {               y[i] = (a[i] * b[i]) + c[i] + (d[i] * e[i]) + (f[i] + 2);               printf("y[%d]=%.2f\n", i,y[i]);        }        //min        for (i = 0; i < ARRAY_SIZE; i++) {               if (i == 0) {                      min = y[i];                      imin = i;               }               else {                      if (y[i] < min) {                            min = y[i];                            imin = i;                      }               }        }        //max        for (i = 0; i < ARRAY_SIZE; i++) {               if (i == 0) {                      max = y[i];                      imax = i;               }               else {                      if (y[i] > max) {                            max = y[i];                            imax = i;                      }               }        }        printf("min y[%d] = %.2f\nmax y[%d] = %.2f\n", imin, min, imax, max);        return 0; }

Question 1

Decompose the given problem to tasks. You may use any of the decomposition techniques discussed in Module 3. Explain the decomposition techniques applied and draw the decomposition diagram.

Question 2

Represent the decomposed problem in Question 1 to task dependency graph.

Question 3

Write a full program that consists of multithreading implements using Pthread in C language. Provide the source code in text (not screen capture), and the output in an image form. Attach the source code file (.c) in the submission too.