Wednesday, September 23, 2009

Presentations Chapter 7 through 10

Chapter 7



Chapter 8



Chapter 9



Chapter 10

Tell me the sum!

If we list all the natural numbers below 10 that are multiples of 3 or 5, * we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.

Wednesday, September 16, 2009

Today

Examined subString, length with Strings
Used for loops to count down
Used while loops to count up
Used do while loops to enter nonnegative numbers.
Entered three numbers and found the sum and product.
Entered three numbers and found the largest number.
Determined whether a number is a multiple of 3 or 7.
Asked user for seven numbers and stored them in an array (using a loop).
Make a String array and store 3 people's names in it. Output the results.
Use the Scanner to enter the names from the console and store them in an ArrayList.
Make a ProgrammingStudent class that stores Name, programming ability, and ID.

Wednesday, August 26, 2009

Code for method

public void determineReorder(){
if(numToys <= 3)
{
System.out.println("Reorder the toy now");
}
else
{
System.out.println("The toy is in stock with " + numToys + " left!");
}
}

Monday, August 24, 2009

Before next class...

  1. Install Netbeans and Java on your home computer.
  2. Read this tutorial about objects: http://java.sun.com/docs/books/tutorial/java/concepts/object.html
  3. Download Thinking in Java:
    http://www.odioworks.com/download/TIJ-3rd-edition4.0.zip
  4. Try to purchase the class text. It is useful.
  5. Send me an email with the following information:

    What do you hope to gain from this class?
    What experience do you have with computers?
    What is your major?
    Any pertinent information you think is necessary.

    david.freer@gmail.com

Welcome to class!

Welcome to "Introduction to Java."

My name is David Freer.

Monday, July 27, 2009

Go to betterprogrammer.com

Try this fun test. Put on your blog how you do.

Write your impressions of the site on your blog and your score if available.