public class MyCalendar {
  public static String getName(int month) {
    switch (month) {
      case 1: return "January";
      case 2: return "February";
      case 3: return "March";
      case 4: return "April";
      case 5: return "May";
      case 6: return "June";
      case 7: return "July";
      case 8: return "August";
      case 9: return "Septmber";    // THIS IS NOT SPELLED CORRECTLY
      case 10: return "October";
      case 11: return "November";
      case 12: return "December";
      default: return "UNKNOWN";
    }
  }
}
import junit.framework.*;
public class MyCalendarTest extends TestCase {
  public MyCalendarTest(String s) {
    super(s);
  }
  public void testGetName() {
    String name  = MyCalendar.getName(9);
    assertEquals(name,"September");
  }
} 
import junit.framework.*;
import java.util.Vector;
public class VectorTest extends TestCase {
  private Vector v;
  public VectorTest(String s) { super(s); }
  protected void setUp() {
    v = new Vector();
    v.addElement(new Integer(1));
    v.addElement(new Integer(2));
    v.addElement(new Integer(3));
  }
  public void testSize() {
    int size = v.size();
    for (int i=0; i<100; i++) 
      v.addElement(new Integer(i));
    assertEquals(v.size(), size+100);
  }
  public void testElementAt() {
    Integer i= (Integer)v.elementAt(0);
    assertEquals(i.intValue(),1);
  }
}
public class MyMath {
  public static int pow(int n, int m) {
    int z, k;
    // PRE: n > 0 and m >= 0 
    z = 1;


    k = m;





    while ( k > 1 ) {


      z = z * n;





      k = k - 1;



    }






    //POST: z = n^m
    return z;
  }
}
import junit.framework.*;
public class MyMathTest extends TestCase {
  public MyMathTest(String s) { super(s); }
  public void testZero() {
  
  }
  public void testNonZero() {
  
  }
} 
public class Stack {
  public static final int STACK_SIZE  = 100;
  private static final int EMPTY_TOS   = -1;
  private int top = EMPTY_TOS;
  int stack_array[] = new int[STACK_SIZE];
  public Stack () { }
  public boolean isEmpty() {
    return(top == EMPTY_TOS);
  }
  public boolean isFull() {
    return(top == STACK_SIZE-1);
  }
  public void push(int i) {
    if (!isFull())
      stack_array[++top]= i;
  }
  public int pop() {
    if (isEmpty())
      return 0;
    else
      return(stack_array[top--]);
  }
}
import junit.framework.*;
public class StackTest extends TestCase {
  public StackTest(String s) { super(s); }
  public void testStack() {

  }
}