Week 21: January 30 - February 3

• Monday, January 30th
  • Hand back and go over quizzes.
  • Chapter 19 Section 1 - 2 Discussion.
  • Go over the Iterator demonstration on the marker board.
  • Get the SimpleIteratorTestor and StudentCollection program files from email.
  • Run the SimpleIteratorTester program and confirm the results from the board.
  • Complete the SimpleIterator Worksheet in class.
  • Modify the SimpleIteratorTester program to the code on the worksheet and prove your results that you hand executed.
  • Begin the StudentCollection program. Place a copy of your Student.java file from your ch13 package folder in your ch19 package folder.
  • Assignments:
    • Review the first 17 slides of the Chapter 19 Online Lecture in one of these two forms:
    • Complete the StudentCollection program by the first of our next class.

 

• Wednesday, February 1st
  • Complete coding the ListMerger Coding Quiz and email me the file.
  • Discuss Chapter 19 Section 3 ... slides 18 - 26 from the Chapter 19 Web Lecture about ListIterators.
  • Go over the ListIterator Board Example.
  • Run the ListIteratorTester program.
  • Begin work on the ListIterator program.
  • Assignments:
    • Complete coding the StudentCollection program and email me both the Student file and the StudentCollection file.
    • Review Chapter 19 Section 3 ... slides 18 - 26 from the Chapter 19 Web Lecture about ListIterators.
    • Run the ListIteratorTester program on the worksheet data.
    • Continue working on the ListIterator program.

 

• Thursday, February 2nd
  • Turn in all your back work.
  • Go over Question #12 of the Chapter 13 Multiple Choice Quiz.
  • Continue working on the ListIterator program.
  • Assignments:
    • Complete coding the ListIterator program by the first of class tomorrow.

• Friday, February 3rd
  • Download and complete the Mid-Year Course Evaluation. Print your eval anonymously and place it in the folder.
  • ListIterator Lecture Web Page.
  • Compare and Contrast the ArrayList and LinkedList Data Structures.
  • Discuss slides 27 - 32 of the Chapter 19 Web Lecture
  • ArrayList vs. LinkedList Diagram.
  • What is the Big O Running Time of your methods in the ListIterator program?
  • Complete the Chapter 19 Section 1 - 3 Review Questions on Big O Run Time.
  • Go back over List Iterator diagrams to clarify adding with an iterator.
  • Take 5 Point ListIterator Diagram Quiz.
  • Assignments:
    • Review slides 27 - 32 of the Chapter 19 Web Lecture

Week 22: February 6 - February 10

• Monday, February 6th
  • Discuss slides 1 - 10 of the Chapter 20 PowerPoint Lecture or Download the Chapter 20 PPT file as needed.
  • Assignments:
    • Review for the Chapter 19 Section 1 - 3 Quiz (42pts) on Wednesday. Review the following items:
      • know the Big-O run time of List methods for ArrayLists and LinkedLists and be able to explain them like the sample questions.
      • Be able to write the code for two methods ... one that uses a simple iterator and one that uses a list iterator. I will give you a list of methods for the List interface and both iterator interfaces.
    • Quiz format:
      • Part 1 of Quiz - 25 full points (50 raw points)
        • 1 multiple choice question ... 5 raw points
        • 15 Big O Running Time Questions ... 45 raw points
      • Part 2 of Quiz - 17 points
        • One coding question using a simple iterator (8 full points)
        • One coding question using a ListIterator (9 full points)

 

• Wednesday, February 8th
  • Chapter 19 Section 1 - 3 Quiz (42pts)
  • Assignments:
    • Review the Chapter 20 PowerPoint Lecture or Download the Chapter 20 PPT file.

 

• Thursday, February 9th
  • Go over Chapter 19 Section 1 - 3 Quiz.
  • Linked List Demonstration.
  • Begin coding the SinglyLinkedList class program. Get the files from email and complete the isEmpty(), size(), and add(obj) methods by the first of class tom orrow.
  • Assignments:
    • Complete coding the isEmpty(), size(), and add(obj) methods by the first of class

• Friday, February 10th
  • Continue coding the SinglyLinkedList program.
  • Try to complete the remove(obj) method by tomorrow and run and test your program by stopping to finish the first part of the SinglyLinkedListDriver file.
  • Continue coding the contains(obj), get(i), and set(i, obj) methods of the SinglyLinkedList program and test them as you go.
  • Continue coding the remainder of the SinglyLinkedList program methods. Due ??? at the first of class.
  • Assignments:
    • Continue coding the SinglyLinkedList program. Complete coding the SinglyLinkedListDriver switch statment and the two print methods and then work on the remove(obj) method.

---

Web Page Policy: You cannot display ANY pictures of people, animals, or symbols on your web page either as a background or simple inserted picture. Examples of symbols are pentagrams, peace symbols, or commercial logos. You may only have a solid color background or a background graphic that is a computer creation (I will show you examples) or a nature scene. Any graphic must allow the links on the page to stand out and be read easily. If you want to use a graphic, I need to approve it in advance of you using it. If I find any unacceptable graphics that you have not gotten my permission to use ... it will cost you 10pts each time I find them there.

Back to Top

---