COP-3530, Data Structures Lectures

• Jan 6: Administrivia
• Jan 6, 8, 13: Java Review
  • Jan 6 CODE: Assign1.java Set.java BogusSet.java
  • Jan 8 CODE: Assign1.java Set.java BogusSet.java
  • Jan 13 CODE: Assign1.java Set.java BogusSet.java
  • Read Chapters 1 - 4, Sections 7.1 to 7.3, and the Appendix, most of which is review material.
  • Packages, interfaces, iterators
  • Dynamically expanding arrays and ArrayList (Section 2.4)
  • StringBuffers
  • Function Objects (Section 4.7)
  • Nested, local, and anonymous classes (Section 4.7)
  • Inner Classes (Section 6.2, 15.1, 15.2)
• Jan 15, 20: The Collections API
  • CODE FROM JAN 20
  • Read Chapter 6
  • The Collections API
  • Linked list review
  • Sets
  • Maps
  • Iterators
  • Assignment #2 discussion
• Jan 22, 27, 29: Algorithm Analysis
  • Read Chapter 5
  • Big-Oh
  • Maximum subsequence sum examples
• Feb 3, 5: Recursion
  • Recursion review
  • Divide and conquer (Section 7.5)
  • More recursion examples Recursion.java and MoreRecursion.java
  • Discussion of Assignment #3
• Feb 10, 12: More Algorithm Analysis
  • Single-operation costs
  • Singly, and doubly linked lists
  • Day11.java: linked list code from class.
  • Logarithms
  • Binary search
  • Mergesort (Section 8.5)
  • Divide-and-conquer analysis
• Feb 17 Review
• Feb 19: Midterm
• Feb 24, 26: Binary search trees
  • Day13.java source code from class.
  • Insertion, find, deletion
  • size, height, toString
  • Implementation of contains and add
• Mar 3: AVL Trees
• Mar 5, 10, and 12: Shortest Paths
  • Read Section 14.3
  • Discussion of Assignment #5
• Mar 17 and 19: SPRING BREAK NO CLASSES
• Mar 24 and 26: Priority Queues
  • Read Chapter 21
• Mar 31, Apr 2, 7: Sorting
• Read Chapter 8
• Heapsort
• Quicksort
• Lower bounds for sorting
• Apr 9, 14: Hash Tables
  • Chapter 20 and 6.7.2.
  • Discussion of Java 1.2 Collections API: HashSet, HashMap, equals, and hashcode
  • Apr09.java sample code
• Apr 16: TBA
• TUESDAY APRIL 21 12:00 PM - 2:00 PM: Final Exam