I need help in solving the question highlighted in bold for C language. Given- struct tag { char ch; int i; }; struct bTag{ float f; double d; }; struct cTag{ struct aTag a; struct bTagb; int A[5]; }; typedef struct aTag aType; typedef struct bTag bType; typedef struct cTag cType; aType a, A[5]; bType b, B[5]; cType c, C[5]; aType *pa; bType *pb; cType *pc; 3a). Implement a function int Total2(cType c) which will return the sum of structure c's member array A. b). Implement a function int Total 3(type C[], int n) which will return the sum of *ALL* the elements of member array A for all structures. Note: the previous problem computes the sum from just one structure. This problem computes the sum of the member A for all elements of C. c). Implement a function int Minimum(cType c) which will return the index of the smallest value in c's member array A. d). Implement a function float fMinimum(bType BO, int n) which will return the index of the element in array B whose member f is the smallest. e). Implement a function double dMaximum(bType B[], int n) which will return the index of the element in array B whose member d is the largest.
I need help in solving the question highlighted in bold for C language.
Given-
struct tag {
char ch;
int i;
};
struct bTag{
float f;
double d;
};
struct cTag{
struct aTag a;
struct bTagb;
int A[5];
};
typedef struct aTag aType;
typedef struct bTag bType;
typedef struct cTag cType;
aType a, A[5];
bType b, B[5];
cType c, C[5];
aType *pa;
bType *pb;
cType *pc;
3a). Implement a function int Total2(cType c) which will return the sum of structure c's member array A.
b). Implement a function int Total 3(type C[], int n) which will return the sum of *ALL* the elements of member array A for all structures. Note: the previous problem computes the sum from just one structure. This problem computes the sum of the member A for all elements of C.
c). Implement a function int Minimum(cType c) which will return the index of the smallest value in c's member array A.
d). Implement a function float fMinimum(bType BO, int n) which will return the index of the element in array B whose member f is the smallest.
e). Implement a function double dMaximum(bType B[], int n) which will return the index of the element in array B whose member d is the largest.
Step by step
Solved in 2 steps with 1 images
