Difference between revisions of "IB Computer Science 2"

From WLCS
Line 1: Line 1:
 +
== Thursday (9/22/11) ==
 +
'''Warmup:'''
 +
# Pair up with a partner
 +
# Receive several playing cards from Mr. Bui
 +
# Shuffle the cards
 +
# Sort them in numerical order by repeatedly finding the smallest card and separating it
 +
 +
'''Agenda:'''
 +
* Introduction to Selection Sort
 +
# Find the smallest element
 +
# Move to the front of the array (swap with front)
 +
# Repeat Steps 1&2, but ignoring the sorted front
 +
* [http://www.cs.oswego.edu/~mohammad/classes/csc241/samples/sort/Sort2-E.html Selection Sort Animation]
 +
* [http://www.cs.ust.hk/faculty/tcpong/cs102/summer96/aids/select.html Another Selection Sort Animation]
 +
* [http://math.hws.edu/TMCM/java/xSortLab/ Sorting Animations]
 +
* Download [[Media:SelectionSort.java]]
 +
** Fill in the commented parts of the SelectionSort.java file. Where there is a comment, you need to write code.
 +
* Demo SelectionSort
 +
* Add a (s)ort option to your AddressBook
 +
** In order to compare Strings:
 +
<source lang="Java">
 +
if (str1.compareTo(str2) < 0)
 +
{
 +
  System.out.println(str1 + " goes before " + str2);
 +
}
 +
</source>
 +
* So inside your AddressBook, you'd have something like this:
 +
<source lang="Java">
 +
if (myContacts[i].getLastName().compareTo(myContacts[j].getLastName()) < 0)
 +
</source>
 +
 
== Friday - Tuesday (9/16/11 - 9/20/11) ==
 
== Friday - Tuesday (9/16/11 - 9/20/11) ==
 
'''Warmup:'''
 
'''Warmup:'''
Line 9: Line 40:
 
** Corrections for 1/2 partial credit (Turn in corrections by the end of the week)
 
** Corrections for 1/2 partial credit (Turn in corrections by the end of the week)
 
* Complete [[AddressBook class lab assignment]] by the end of class
 
* Complete [[AddressBook class lab assignment]] by the end of class
−
*
 
  
 
== Wednesday (9/14/11) ==
 
== Wednesday (9/14/11) ==

Revision as of 13:18, 22 September 2011

Thursday (9/22/11)

Warmup:

  1. Pair up with a partner
  2. Receive several playing cards from Mr. Bui
  3. Shuffle the cards
  4. Sort them in numerical order by repeatedly finding the smallest card and separating it

Agenda:

  • Introduction to Selection Sort
  1. Find the smallest element
  2. Move to the front of the array (swap with front)
  3. Repeat Steps 1&2, but ignoring the sorted front
if (str1.compareTo(str2) < 0)
{
  System.out.println(str1 + " goes before " + str2);
}
  • So inside your AddressBook, you'd have something like this:
if (myContacts[i].getLastName().compareTo(myContacts[j].getLastName()) < 0)

Friday - Tuesday (9/16/11 - 9/20/11)

Warmup:

Agenda:

  • Return Software Development Quizzes
    • Corrections for 1/2 partial credit (Turn in corrections by the end of the week)
  • Complete AddressBook class lab assignment by the end of class

Wednesday (9/14/11)

Warmup:

Agenda:

  • Java Review?
    • How does it all work?
    1. Create Java Classes (object blueprints)
    2. Create a separate main class with a main method. The main method can use other objects defined in classes.
  • Review Arrays
  • Array practice activities
    1. Create a new Java class named ArrayPractice1. Create an array of 10 Strings (Use names of students in the room). Using a for loop, print out all the Strings in the array.
    2. Create a new Java class named ArrayPractice2. Create an array of 10 integers (make a bunch of numbers up). Using a for loop and an if statement, print print out only numbers greater than 10.
    3. Create a new Java class named ArrayPractice3. Create an array of 10 integers. Using a for loop, calculate the sum and average.
  • AddressBook beginning walk-through
  • AddressBook class lab assignment

Homework:

  • Install the Java JDK on your computer (be sure to choose your corresponding operator system)
  • Install Eclipse Classic on your computer (be sure to choose your corresponding operator system on the right)
  • Test it out, and let Mr. Bui know if you run into problems

Monday - Wednesday (9/12/11 - 9/14/11)

Warmup:

  • Redo the Comfort Zone Survey
  • Be prepared to demo Contact
  • Cram for quiz (Hint: There is a question on almost every slide...lol!)

Agenda:

Homework:

  • Install the Java JDK on your computer (be sure to choose your corresponding operator system)
  • Install Eclipse Classic on your computer (be sure to choose your corresponding operator system on the right)
  • Test it out, and let Mr. Bui know if you run into problems


Tuesday - Thursday (9/6/11 - 9/8/11)

Warmup:

Agenda:

Homework:

Summer

Retrieved from "https://www.paulbui.net/wiki/index.php?title=IB_Computer_Science_2&oldid=7991"