Sections

• The sections will be held via web conference. To access the live section meetings, go to the course’s site on Canvas, click on the Zoom link in the left-hand navigation bar, then click on the Join button for the appropriate event.

• The 7-8 pm sections will be recorded and made available within 24 hours. To access the recordings, click the Zoom link in Canvas and click the Published Recordings section near the top of the page.

• For each section, the section notes will be posted below before the first offering of that section. After the final offering of that section is held, the solutions for that section will be posted. You may need to refresh this page in your browser to see a newly added link.

Section Notes

ArrayBag and memory

slides, solutions

ArrayBag.java

Recursion, recursive backtracking

slides, solutions

RemoveCapitals.java, Fibonacci.java

Domino.java, DominoChain.java

Big O notation, practice with sorting

slides, solutions

Matrix.java, Loops.java

Sort.java, SortCount.java

Quicksort, merge sort, radix sort & time complexity

slides, solutions

Sort.java, SortCount.java

Recursive and iterative methods on linked lists

slides

StringNode.java

Midterm review

practice midterm

Lists, stacks, and generics

slides, solutions

Balanced.java

Binary trees, tree iterators, Huffman encoding

slides, solutions

LinkedTree.java

Binary search trees, balanced trees

slides, solutions

LinkedTree.java

Heaps, heapsort, search algorithms, hash tables

slides, solutions

Heap.java, HeapSort.java

Double hashing, graphs & graph traversals

slides

The HashTable interface

Open addressing implementation OpenHashTable