Sunday, November 26, 2006

ForEachExample.java



      public class ForEachExample
{
 public static void main(String[] args)
 {
  int[] list = {1,2,3,4,5};
  
  for(int num: list)
   System.out.println(num);
 }
}

ArrayListLoops.java



      import java.util.*;

public class ArrayListLoops
{
    public static void main(String[] args)
    {
        ArrayList list = new ArrayList();

        list.add("Washington");
        list.add("Adams");
        list.add("Jefferson");
        list.add("Madison");

  System.out.println("version 1");
        for (int i = 0; i < list.size(); i++)
            System.out.println(list.get(i));
  
  System.out.println("version 2");
        ListIterator it = list.listIterator();

        while (it.hasNext())
        {
            System.out.println(it.next());
        }
        
  System.out.println("version 3");
  for(Object president: list)
   System.out.println((String)president);
    }
}

Thursday, November 02, 2006

DogTest.java



      public class DogTest{
 public static void main(String[] args)
 {
  Dog d1 = new Dog("Buddy");
  d1.setBreed("mutt");
  d1.bark();
  System.out.println(d1);
  System.out.println(d1.getName());
 }
}
class Dog
{
 private String name, breed;
 
 public Dog()
 {
 }
 
 public Dog(String name)
 {
  this.name = name;
 }
 
 public void setName(String name)
 {
  this.name = name;
 }
 
 public String getName()
 {
  return name;
 }
 
 public void setBreed(String breed)
 {
  this.breed = breed;
 }
 
 public String getBreed()
 {
  return breed;
 }
 public String toString()
 {
  return name;
 }
 
 public void bark()
 {
  System.out.println("bow wow");
 }
}

MethodsReview



      public static boolean isEven(int n) { return n % 2 == 0; }
public static boolean isOdd(int n)	{ return n % 2 == 1; }
public static boolean isPositive(int n)	{ return n > 0; }
public static boolean isPrime(int n) {
	boolean isPrime = true;
	for(int i = 2; i < n; i++)
		if (n % i == 0)
			isPrime = false;
	return isPrime;
}
public static boolean isATriangle(int numSides) { return numSides == 3; }
public static boolean isEquilateral(int side1, int side2, int side3)
{ return side1 == side2 && side2 == side3; }
public static boolean isRightTriangle(int angle1, int angle2, int angle3)
{ return angle1 == 90 || angle2 == 90 || angle3 == 90; }
public static boolean isVowel(char c) // precondition:  c is lowercase
{	return c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u'; }
public static int countVowels(String s) // use isVowel(char c)
{
	int count = 0;
	for(int i = 0; i < s.length() i++)
		if(isVowel(c))	count++;
	return count;
}	
public static boolean isAlphabetic(char c)
{	return ( c >= 'a' & c <= 'z') || ( c >= 'A' & c <= 'Z') ;
public static boolean isConsonant(char c) // Use above methods
{	return isAlphabetic(c) && ! isVowel(c); }
public static double areaSquare(double side1, double side2)
{	return side1 * side2; }
public static double areaCircle(double radius)
{	return Math.PI * Math.pow(radius,2);  }
public static boolean isInRange(int num, int bottom, int top)
{	return n >= bottom && num <= top;  }
public static int sumRange(int bottom, int top) // inclusive
{
	int sum = 0;
	for (int i = bottom; i <= top; i++)
		sum += i;
	return sum;
}
public static int averageRange(int bottom, int top) // inclusive
{
	int count = top - bottom + 1;
	return sumRange(top, bottom) / count;
}
public static int min(int num1, int num2)
{
	if(num1 < num2)
		return num1;
		else
		return num2;
}
public static int max(int num1, int num2)
{
	if(num1 > num2)
		return num1;
		else
		return num2;
}