What is the output of the following C code? Assume that the address of x is 2000 (in decimal) and an integer requires four bytes of memory.

int main () { 
unsigned int x[4][3] = 
          {{1,2,3},{4,5,6},{7,8,9},{10,11,12}}; 
          printf(“%u, %u, %u”, x+3, *(x+3), *(x+2)+3); 
}

Consider the following pseudo code, where x and y are positive integers.

begin 
    q := 0 
    r := x 
   while r ≥ y do 
      begin 
      r := r - y 
      q := q + 1 
    end 
end

The post condition that needs to be satisfied after the program terminates is

Match the following:

Consider the following C program segment.

while(first <= last) 
{ 
    if (array[middle] < search) 
        first = middle + 1; 
    else if (array[middle] == search) 
              found = TRUE; 
          else last = middle - 1; 
    middle = (first + last)/2; 
}
 if (first > last) notPresent = TRUE; 

The cyclomatic complexity of the program segment is ________.