Problem 2 – Coding Friends

This problem 2 is “Rainbow Write a GraphicsProgram subclass that draws a rainbow”, the basics of the problem are “Starting at the top, the six arcs are red, orange, yellow, green, blue, and magenta, respectively; cyan makes a lovely colour for the sky. The top of the arc should not be off the screen. Each of the arcs in the rainbow should get clipped along the sides of the window,and not along the bottom. Your rainbow should be symmetric and nicely drawn, regardless of window size.”

The way that I thought about this, is to basically use the GOval to create a circle that is placed in the centre width and slowly go down on the Y coordinates, the size of the GOval is going to be twice the size of the screen itself, thus will meet the problem above. I setup a array of colours, that will then go through within a for loop to draw the GOval(circles) on the screen as below

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);
}

Here is my output of my Rainbow to the solution of the problem

I have included the full source code in the zip file above., but here is the full source code for this problem.

/*
 * 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);
		}
	}
}

2 thoughts on “Problem 2”

 
/*
 * 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.program.*;
import acm.graphics.*;
import java.awt.*;
 
public class Rainbow extends GraphicsProgram {
	private static final int RAINBOW_DIAMETER = 1500;
 
	public void run() {
		drawSky();
		drawRainbow();		
	}
 
	private void drawSky() {
		int skyWidth = getWidth();
		int skyHeight = getHeight();
		GRect sky = new GRect(0, 0, skyWidth, skyHeight);
		sky.setColor(Color.CYAN);
		sky.setFillColor(Color.CYAN);
		sky.setFilled(true);
		add(sky);
	}
 
	private void drawRainbow() {
		Color bandColor = Color.RED;
		for (int i = 0; i &lt; 7; i++) {
			switch (i) {
				case 1: bandColor = Color.ORANGE; break;
				case 2: bandColor = Color.YELLOW; break;
				case 3: bandColor = Color.GREEN; break;
				case 4: bandColor = Color.BLUE; break;
				case 5: bandColor = Color.MAGENTA; break;
				case 6: bandColor = Color.CYAN; break;
			}
 
			int offset = 20 * i;
			int bandDiameter = RAINBOW_DIAMETER - (offset * 2);
			int bandX = (getWidth() - bandDiameter)/2;
			int bandY = getHeight()/10 + offset;
 
			GOval band = new GOval(bandX, bandY, bandDiameter, bandDiameter);
			band.setColor(bandColor);
			band.setFillColor(bandColor);
			band.setFilled(true);
			add(band);			
		}
	}
}

Completed as if a complete newbie to programming and knew only the methods/classes as shown in the videos and lecture notes. Don’t have the book, so I didn’t know if arrays were covered.

2 thoughts on “Problem 2”

Leave a Reply