Lectures

Mon Tue Wed Thu Fri
  • folder 01-08

    Section 1: ArrayList


  • folder 01-15

    Section 3: Style and efficiency


  • folder 01-17

    Section 4: stacks and queues

    HW1 due


  • folder 01-21

    NO CLASS (MLK holiday)

    (IPL also closed)


  • folder 01-22

    Section 5: linked nodes


  • folder 01-24

    Section 6: linked lists

    HW2 due


  • folder 01-29

    Section 7: recursion tracing


  • folder 01-31

    Section 8: recursive programming

    HW3 due


  • folder 02-05

    Section 9: sets and maps


  • folder 02-07

    Section 10: Comparable

    HW4 due


  • folder 02-12

    Section 11: 2D Arrays, TA's choice


  • folder 02-14

    Section 12: midterm review


  • folder 02-15

    MIDTERM EXAM, in class

    (bring your Husky ID!)


  • folder 02-18

    NO CLASS (Presidents Day holiday)

    (IPL also closed)


  • folder 02-19

    Section 13: recursive backtracking


  • folder 02-21

    Section 14: recursive backtracking

    HW5 due


  • folder 02-26

    Section 15: binary trees


  • folder 02-28

    Section 16: binary trees

    HW6 due


  • folder 03-05

    Section 17: linked list review


  • folder 03-07

    Section 18: Sudoku solver

    HW7 due


  • folder 03-12

    Section 19: polymorphism


  • folder 03-14

    Section 20: final exam review

    HW8 due