This problem is similar, except that your record will contain: two shorts (say a and b);...

Transcribed Image Text:

This problem is similar, except that your record will contain: two shorts (say a and b); three longs (m, n, and p); an array (2) of three ints; space for a string of up to 10 characters (s), including a null terminator (i.e., up to nine non-null characters). a. Again, give a declaration of the struct, placing the fields in an order that minimizes the size of the structure. b. How many bytes will an array of 100 of these structures require? c. Give the offset of each field from the start of the structure. This problem is similar, except that your record will contain: two shorts (say a and b); three longs (m, n, and p); an array (2) of three ints; space for a string of up to 10 characters (s), including a null terminator (i.e., up to nine non-null characters). a. Again, give a declaration of the struct, placing the fields in an order that minimizes the size of the structure. b. How many bytes will an array of 100 of these structures require? c. Give the offset of each field from the start of the structure.

Answer rating: 100% (QA)

a Heres the declaration of the struct with fields ordered to minimiz... View the full answer