IBCS2 - 0910 - October

From WLCS

Thursday (10/29/09)

  • 1st Quarter Exam

Tuesday (10/27/09)

Warmup:

  • Pass in your Prototype Solution to Mr. Bui
  • Given the following code, draw the memory diagram:

<source lang="Java"> Node fun = new Node(42); Node general = new Node (11); Node a, b, c;

a = general; b = a; fun.next = b; c = fun; </source>

Agenda:

  • Pass back Stacks quiz
  • Prototype Solution peer review
  • 1st Quarter Exam Review
    • Java programming
    • class construction
    • methods
      • components of the method header
    • Stacks
      • how they work
      • operations: push(), pop(), top(), isEmpty()
      • why we use them
      • example uses
    • Queues
      • how they work
      • operations: add(), remove(), head(), tail(), isEmpty()
      • why we use them
      • example uses
    • Nodes and reference variables
      • Memory diagram and tracing code

Friday (10/23/09)

Agenda:

Homework:

  • Dossier - Prototype Solution rough draft due Tuesday (10/27/09)

Wednesday (10/21/09)

Warmup:

  • Give 2 specific examples of when a queue should be used
  • Identify the following parts in each of the method declarations: access type, return type, method name, parameters
    • public int getSize()
    • private String whatNot(String whatFor)
    • public void print(int size, String stuff)

Agenda:

Homework:

  • Dossier - Prototype Solution rough draft due Tuesday (10/27/09)

Monday (10/19/09)

Warmup:

  • What does LIFO stand for?
  • What does LIFO describe?
  • When would you want a LIFO?

Agenda:

Homework:

  • Dossier - Criteria for Success rough draft due Wednesday (10/21/09)
  • Turn in late assignments! Examples: AddressBook sorting, Problem Analysis, etc.

Thursday (10/15/09)

Warmup:

  • Demo any missing work
  • Finish adding bubble sort and selection sort to your AddressBook
    • Hint1: You cannot simply compare Contacts, but you can compare their last names
    • Hint2: You cannot sort the ENTIRE Contact array, you can only sort the ones that you have added
    • Hint3: You should test our the sorting methods by adding a (s)ort option to your AddressBookMain

Agenda:

Homework:

  • Stacks quiz on Monday (10/19/09)
  • Dossier - Criteria for Success rough draft due Wednesday (10/21/09)
  • Turn in late assignments! Examples: AddressBook sorting, Problem Analysis, etc.

Tuesday (10/13/09)

Warmup:

  • Please complete this password request form
  • What are the advantages and disadvantages of the binary search algorithm?

Agenda:

  • Dossier peer review - Analysis of the Problem
  • Demo any missing work
  • Sorting & Searching Review
    • Selection Sort
    • Bubble Sort
    • Linear Search
    • Binary Search
  • Examples of using the String.compareTo() method
  • Fix Media:StringBinarySearch.java such that it uses binary search to find a String. Hint: You will be using the compareTo()
  • Demo StringBinarySearch to Mr. Bui by the end of today.
  • You should then add selectionSort() to your AddressBook class. It sorts your AddressBook Contact array by last name using the selection sort algorithm. You may assume that everybody will have a different last name.
  • You should then add bubbleSort() to your AddressBook class. It sorts your AddressBook Contact array by last name using the bubble sort algorithm. You may assume that everybody will have a different last name.
  • Demo the two sorting methods to Mr. Bui before Thursday.
  • Read through Media:CriterionA2_criteriaforSuccess.doc
  • Begin working on your Criteria for Success. It will be due next Wednesday (10/21/09).

Thursday (10/8/09)

Warmup:

  • Given the array of integers: 3, 6, 2, 7, 9, 5, 2, 3
  • Illustrate the bubble sort algorithm to sort the numbers

Agenda:

  • Introduction to Linear Search
  • Download Media:LinearSearch.java
  • Fill in the commented parts of LinearSearch.java and demo a working linear search to Mr. Bui
  • Linear Search performance evaluation
  1. What is the best case scenario? i.e. What is the minimum # of comparisons?
  2. What is the worst case scenario? i.e. What is the maximum # of comparisons?
  3. What is the average # of comparisons?
  4. Can we do better than a linear search?
  • Introduction to Binary Search
  1. Assume sorted list
  2. Go to the middle point
  3. If the middle element matches the key, then the search is over
  4. If the key is less than middle element, go to the left (down), else go to the right (up)
  5. Repeat steps 2-4 until the key is found or when the left and right bounds pass each other
  1. What is the best case scenario? i.e. What is the minimum # of comparisons?
  2. What is the worst case scenario? i.e. What is the maximum # of comparisons?
  3. What is the average # of comparisons?
  • Binary Search Advantages & Disadvantages

Homework:

  • 1st rough draft of Analysis of the Problem due Tuesday (10/13/08)
  • Any missing assignments (e.g. AddressBook, SelectionSort, BubbleSort)

Tuesday (10/6/09)

Warmup:

  • Upload AddressBook.java and AddressBookMain.java to SchoolWebLockers
  • Demo SelectionSort.java to Mr. Bui
  • Turn in your Dossier idea sentence

Agenda:

  • 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
  • Bubble Sort Animation
  • Download Media:BubbleSort.java
    • Fill in the commented parts of the BubbleSort.java file. Where there is a comment, you need to write code.
    • Demo to Mr. Bui at the end of class or at the beginning of class tomorrow
  • Introduction to Program Dossier

Friday (10/2/09)

Warmup:

  • Swapping elements warmup

Agenda:

Homework:

Archives