Discussions

January 17: Discussion 1: Welcome to CS61B!
January 24: Discussion 2: Scoping
January 31: Discussion 3: Linked Lists and Arrays.
February 7: Discussion 4: Inheritance.
February 14: Discussion 5: ADTs.
February 21: Discussion 6: Exceptions/Iterators.
February 28: Discussion 7: Asymptotics I.
March 7: Discussion 8: Asymptotics II.
March 14: Discussion 9: Hashing.
March 21: Discussion 10: k-nearest Neighbors and k-D Trees.
April 4: Discussion 11: Graphs.
April 11: Discussion 12: Graph Algorithms.
April 18: Discussion 13: Sorting.
April 25: Discussion 14: Radix Sorting and Good-Bye.