bit operations (moving)
    page number from address

ntohl and htonl and endianness
return ((x >> 24) & 0xFF) + ((x >> 8) & 0xFF00) + ((x << 8) & 0xFF0000) + ((x << 24) & 0xFF000000);

x = 0x12345678

      0x00000012
      0x00003400
      0x00560000
   +  0x78000000
   -------------
      0x78563412


page tables
    page number from address
memory segments

    char *a = "test";
    void f() {
        char *p = a;
    }

realloc count
undefined behavior

    unitialized
    (numerical overflow)


char *p = malloc(435);
int *q = (int *)p;
for(int i=0; i<435; i+=1) p[i] = 0;
printf("%08x\n", q[2]);

char *p = malloc(435);
int *q = (int *)p;
for(int i=0; i<435; i+=1) q[i] = 0;
printf("%08x\n", q[2]);



safe memory access



will I ask about past MPs?
    no
references to use in test
    yes, the same as on the practice
coding partial credit
    yes

Practice midterm compile cc




c++ f(int& x) -- not ok in C

firstTenPrimes(&x)