Let m[0] ..m[4] be mutexes (binary semaphores) and P[0] ...P[4] be processes. Suppose each process P[i] executes the following:

wait (m[i]); wait (m(m[(i+1) mod 4]))0;
.......
release (m[i]); release (m[(i+1) mod 4]);

This could cause

The following C declarations

struct node{
  int i:
  float j;
};
struct node *s[10];

define s to be

The most appropriate matching for the following pairs

X: m=malloc(5); m= NULL;
Y: free(n); n->value = 5;
Z: char *p; *p='a';

1: using dangling
2: using uninitialized pointers
3. lost memory
is:

Consider the following C declaration

struct {
      short s[5];
      union {
      float y;
      long z;
      } u;
}t;

Assume that objects of the type short, float and long occupy 2 bytes, 4 bytes and 8 bytes, respectively. The memory requirement for variable t, ignoring alignment considerations, is