Month: May 2010

/*
 * File: GraphicsHierarchy.java
 * ----------------------------
 * This program is a stub for the GraphicsHierarchy problem, which
 * draws a partial diagram of the acm.graphics hierarchy.
 */
 
import acm.graphics.*;
import acm.program.*;
 
public class GraphicsHierarchy extends GraphicsProgram {
 
	private void createBox(int X, int Y, String name)
	{
		GRect gObjectBox = new GRect(X, Y, boxWidth, boxHeight);
		GLabel text = new GLabel(name);
 
		// replace the X,Y with the new cords to place the text into the middle of the box
		X += (boxWidth / 2) - (text.getWidth()/2);
		Y += (boxHeight / 2) + (text.getAscent()/2);
		text.setLocation(X, Y);
 
		add(gObjectBox);
		add(text);
	}
 
	public void run() {
		// You fill this in
		// find the centre, to then build around it
		int centreX = getWidth() / 2;
		int centreY = (getHeight() / 2)-boxHeight;
 
		String names[] = new String[5];
		names[0] = "GObject";
		names[1] = "GLabel";
		names[2] = "GLine";
		names[3] = "GOval";
		names[4] = "GRect";
 
		createBox(centreX - (boxWidth / 2), centreY - (rowDistances / 2),names[0]);
 
		int placeX = centreX - ((belowBoxs * boxWidth)/2) - ((belowBoxs * boxDistances)/2);
		for (int i =0; i < belowBoxs; i++)
		{
			createBox(placeX, centreY + (rowDistances / 2), names[i+1]);
			GLine joiningLine = new GLine(centreX, centreY - ((rowDistances / 2)-boxHeight),
										placeX + (boxWidth/2), centreY + (rowDistances/2));
			add(joiningLine);
			placeX += (boxWidth + boxDistances);
		}
	}
 
	private static final int belowBoxs = 4;
	private static final int boxWidth = 100;
	private static final int boxHeight = 50;
	private static final int boxDistances = 20;
	private static final int rowDistances = 150;
}

Color colours[] = new Color[7];
colours[0] = Color.RED;
colours[1] = Color.ORANGE;
colours[2] = Color.YELLOW;
colours[3] = Color.GREEN;
colours[4] = Color.BLUE;
colours[5] = Color.MAGENTA;
colours[6] = Color.CYAN;
 
for (int i =0; i < 7; i++)
{
	GOval newCircle = new GOval(-getWidth()/2,10+(i*10), getWidth()*2, getHeight()*2);
	newCircle.setColor(colours[i]);
	newCircle.setFillColor(colours[i]);
	newCircle.setFilled(true);
	add(newCircle);
}

/*
 * File: Rainbow.java
 * ------------------
 * This program is a stub for the Rainbow problem, which displays
 * a rainbow by adding consecutively smaller circles to the canvas.
 */
 
import acm.graphics.*;
import acm.program.*;
import java.awt.*;
 
public class Rainbow extends GraphicsProgram {
 
	public void run() {
		Color colours[] = new Color[7];
		colours[0] = Color.RED;
		colours[1] = Color.ORANGE;
		colours[2] = Color.YELLOW;
		colours[3] = Color.GREEN;
		colours[4] = Color.BLUE;
		colours[5] = Color.MAGENTA;
		colours[6] = Color.CYAN;
 
		GRect background = new GRect(0,0,getWidth(), getHeight());
		background.setColor(Color.CYAN);
		background.setFillColor(Color.CYAN);
		background.setFilled(true);
		add(background);
 
		for (int i =0; i < 7; i++)
		{
			GOval newCircle = new GOval(-getWidth()/2,10+(i*10), getWidth()*2, getHeight()*2);
			newCircle.setColor(colours[i]);
			newCircle.setFillColor(colours[i]);
			newCircle.setFilled(true);
			add(newCircle);
		}
	}
}

/*
 * File: MidpointFindingKarel.java
 * -------------------------------
 * When you finish writing it, the MidpointFindingKarel class should
 * leave a beeper on the corner closest to the center of 1st Street
 * (or either of the two central corners if 1st Street has an even
 * number of corners).  Karel can put down additional beepers as it
 * looks for the midpoint, but must pick them up again before it
 * stops.  The world may be of any size, but you are allowed to
 * assume that it is at least as tall as it is wide.
 */
 
import stanford.karel.*;
 
public class MidpointFindingKarel extends SuperKarel {
 
	private int middleI =0;
 
	// find the middle by move across until hitting the end
	private void findTheMiddle()
	{
		while (!frontIsBlocked())
		{
			move();
			middleI++;
		}
 
	}
 
	// move half the way back, and place the beeper
	private void placeBeeperInTheMiddle()
	{
		for (int i=0; i < (middleI /2); i++)
			move();
		putBeeper();
	}
 
	// You fill in this part
	public void run()
	{
		findTheMiddle();
		turnAround();
		placeBeeperInTheMiddle();
	}
}

/*
 * File: CheckerboardKarel.java
 * ----------------------------
 * When you finish writing it, the CheckerboardKarel class should draw
 * a checkerboard using beepers, as described in Assignment 1.  You
 * should make sure that your program works for all of the sample
 * worlds supplied in the starter folder.
 */
 
import stanford.karel.*;
 
public class CheckerboardKarel extends SuperKarel {
 
	private boolean putBeeper = true;
 
	private void placeBeeperAndMove()
	{
		while (true)
		{
			if (putBeeper) {
				putBeeper();
				putBeeper = false;
			} else
				putBeeper = true;
 
			if (frontIsBlocked()) break;
			move();
		}
	}
 
	private void goUpAndDown()
	{
		boolean turnLeft = true;
 
		while (true)
		{
			if (turnLeft) 
				turnLeft();
			else 
				turnRight();
			placeBeeperAndMove();
			turnLeft = (turnLeft == true ? false : true);
			if (turnLeft)
				turnLeft();
			else
				turnRight();
			if (frontIsBlocked()) break;
			move();
		}
	}
 
	public void goLeftAndRight()
	{
		boolean turnLeft = true;
 
		while (true)
		{
			placeBeeperAndMove();
			if (turnLeft) 
				turnLeft();
			else 
				turnRight();
			if (frontIsBlocked()) break;
			move();
			if (turnLeft)
				turnLeft();
			else
				turnRight();
			turnLeft = (turnLeft == true ? false : true);
		}
	}
 
	// You fill in this part
	public void run()
	{
		// go up and down 
		//goUpAndDown();
		// go left and right
		goLeftAndRight();
	}
}