THIS IS THE PROGRAM FOR STEP 3: #include #include #include #include int main(int argc, char argv[]){ int row = 0; int column = 0; row = atoi(argv[1]); column = atoi(argv[2]); int A = (int ) malloc((row column) * sizeof(int)); int i, j; printf("Enter the matrix elements:\n"); for (i = 0; i < row; i++) { for (j = 0; j < column; j++) { printf("A[%d,%d] = ", i, j); scanf("%d", A + i * column + j);//matrix elements is stored in row-wise } printf("\n"); } int n = 0; printf("Enter a number:"); scanf("%d", &n); for(int i = 0; i < row; ++i){ pid_t pid = fork(); if (pid == -1){//not able to create child printf("parent PID %d => \n", getpid()); for (j = 0; j < column; j++) { (A + i column + j) = n * ((A + i column + j)); printf("%d * A[%d,%d] = %d\n", n, i, j, (A + i column + j)); } } else if (pid == 0) {//child printf("child%d PID: %d \n", i, getpid()); for (j = 0; j < column; j++) { (A + i column + j) = n * ((A + i column + j)); printf("%d * A[%d,%d] = %d\n", n, i, j, (A + i column + j)); } exit(0); } } wait(0); printf("Final matrix elements:\n"); for (i = 0; i < row; i++) { for (j = 0; j < column; j++) { printf("A[%d,%d] = %d\n", i, j, (A + i column + j)); } printf("\n"); } exit(0); }

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

THIS IS THE PROGRAM FOR STEP 3:

#include <stdio.h>
#include <stdlib.h>
#include <sys/wait.h>
#include <unistd.h>
int main(int argc, char *argv[]){
   int row = 0;
   int column = 0;
   row = atoi(argv[1]);
   column = atoi(argv[2]);

   int *A = (int *) malloc((row * column) * sizeof(int));
   int i, j;
   printf("Enter the matrix elements:\n");
   for (i = 0; i < row; i++) {
       for (j = 0; j < column; j++) {
           printf("A[%d,%d] = ", i, j);
           scanf("%d", A + i * column + j);//matrix elements is stored in row-wise
       }
       printf("\n");
   }

   int n = 0;
   printf("Enter a number:");
   scanf("%d", &n);

   for(int i = 0; i < row; ++i){
       pid_t pid = fork();
       if (pid == -1){//not able to create child
           printf("parent PID %d => \n", getpid());
           for (j = 0; j < column; j++) {
               *(A + i * column + j) = n * (*(A + i * column + j));
               printf("%d * A[%d,%d] = %d\n", n, i, j, *(A + i * column + j));
           }
       }
       else if (pid == 0) {//child
           printf("child%d PID: %d \n", i, getpid());
           for (j = 0; j < column; j++) {
               *(A + i * column + j) = n * (*(A + i * column + j));
               printf("%d * A[%d,%d] = %d\n", n, i, j, *(A + i * column + j));
           }
           exit(0);
       }
   }

   wait(0);
   printf("Final matrix elements:\n");
   for (i = 0; i < row; i++) {
       for (j = 0; j < column; j++) {
           printf("A[%d,%d] = %d\n", i, j, *(A + i * column + j));
       }
       printf("\n");
   }