IBCS2 - 1213 - September

From WLCS

Friday - Tuesday (9/28/12 - 10/2/12)

Warmup:

  1. Repeatedly comparing adjacent elements and swapping them so that they are in the correct order. Which sort am I?
  2. Repeatedly look for the smallest thing currently in the collection and putting it aside. Which sort am I?

Agenda:

  • Insertion Sort
    • From the very beginning...insert the value into the correct spot (there may need to be some shifting around)
  • Quick Sort
    1. Start with a partition (will be the entire list in the beginning)
    2. Pick an element at random. It will be the pivot value.
    3. Go through the list and values less than the pivot are put before it and values greater than the pivot will come after.
    4. The pivot also partitions the list into two sublists. Repeat steps 1-4 for each of the sub-lists.
  • Sorting Animations
  • Quicksort
  • Sorting Quiz on Tuesday (10/2/12)
    • Be able to explain the steps of each of the sorts
  • Introduction to Abstract Data Type (ADT)
  • Introduction to Data Structures
  • Stacks
  • Stack Practice
    1. After studying the stack code, you will attempt to re-create the Stack.java code
    2. Create a new Java project called StackPractice
    3. Download Media:EmptyStack.java
    4. Rename EmptyStack.java to Stack.java AND add it to your StackPractice project
    5. Download Media:StackMain.java and add it to your StackPractice project
    6. Fill in the code for all the empty stack methods
    7. Test your own stack code with StackMain.java

Homework:

  • Sorting Quiz on Tuesday (10/2/12)
  • Analyzing the Problem due Thursday (10/4/11)

Wednesday (9/26/12)

Warmup:

  • Assume you have the following code:
a = 3
b = 5

System.out.println("a = " + a);
System.out.println("b = " + b);

//INSERT YOUR CODE HERE
//swap the values in the variables here


System.out.println("a = " + a);
System.out.println("b = " + b);

Agenda:

  • Introduction to the Program Dossier
  • Demo SelectionSort.java
  • Introduction to Bubble Sort
  1. Initialize the front to be the top or beginning of the array
  2. Now go to the bottom/end of the array
  3. Compare the two adjacent elements to see if they are in proper sequential order
    1. Swap the elements if they are out of order (bigger number to the left of smaller number)
  4. Move to the next pair of adjacent elements/numbers
  5. Repeat steps 3 and 4 until the smallest number has "floated" to the top/front
  6. After you traverse the entire array
    1. Move the front so that the sorted numbers are ignored
    2. Go back to the end of the array
    3. Repeat steps 2 through 6 for the unsorted part of the array

Monday (9/24/12)

  • 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

Thursday (9/20/12)

Agenda:

Friday - Tuesday (9/14/12 - 9/18/12)

Warmup:

Agenda:

Homework:

Wednesday (9/12/12)

Agenda:

  • Demo Media:CombatSimulation.java
  • Review Arrays
  • Array practice activities. Create a new Java class named ArrayPractice
    1. 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 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 an array of 10 integers. Using a for loop, calculate the sum and average.
    4. Demo ArrayPractice
  • AddressBook beginning walk-through
  • AddressBook class lab assignment

Monday (9/10/12)

Warmup:

  1. Bring up NetBeans
  2. Import your summer assignment
  3. Demo using Media:CombatSimulation.java

Agenda:

Thursday (9/6/12)

Tuesday (9/4/12)

  • Introductions
  • Name cards
  • Lab setup/config
    • Login username is your first initial and lastname (e.g. pbui)
    • Your password is your student ID number
    • Go to Apple (upper left) -> System Preferences -> Accounts -> Change Password
    • Acceptable-use policies apply in this lab!
  • Complete the Student Surveys
Retrieved from "https://www.paulbui.net/wiki/index.php?title=IBCS2_-_1213_-_September&oldid=9383"