1. (12 points)

/* check if entry is already present */    [3 points for this part]
for (int i = 0; i < valList[place].length; i++) {
   if (valList[place][i] == val) {   
      return false;
   }
}

/* create new row */  [5 points total for this part]
double[] newRow = new double[valList[place].length + 1]; 
for (int i = 0; i < valList[place].length; i++) {         
    newRow[i] = valLIst[place][i];
}

/* add the new element into the new array */ [2 points for this part]
newRow[newRow.length-1] = val;

/* replace row in the array */   [2 points for this part]
valList[place] = newRow;  


2. (8 points -- 1 point each part)

  a. FALSE
  b. TRUE
  c. FALSE
  d. FALSE
  e. FALSE
  f. TRUE
  g. TRUE
  h. FALSE