CS61BL

Summer 2020

Course Website: 61bl.org

Zoom Link: https://berkeley.zoom.us/j/91220387485

Schedule:

Section:

M 8AM-11AM
Th 8AM-10AM, 11AM-12PM

Office Hours:

W 1-3PM on Zoom

Youtube: https://www.youtube.com/channel/UCb-1zfEWCtJ5goJcxGqFTtA

Tutoring Sections

Tutoring Section 12: Sorting

Comparison Based and Counting Based Sorts

Tutoring Section 11: Disjoint Sets and MSTs

Disjoint Sets and MSTs

Tutoring Section 10: Graphs and Algorithms

Graphs and Algorithms

Tutoring Section 9: Heaps, Priority Queues and Hashing

Heaps, Priority Queues and Hashing

Tutoring Section 8: k-D Trees and Tries

k-D Trees and Tries

Tutoring Section 7: Balanced Search Trees

Balanced Search Trees

Tutoring Section 6: Tree Traversals, Stacks and Queues

Tree Traversals, Stacks and Queues

Tutoring Section 5: Exceptions and Iterators

Exception and Iterators

Tutoring Section 4: Dynamic Method Selection and Inheritance

Dynamic Method Selection and Inheritance

Midterm Review: Deques and LinkedLists

Midterm 1 Review: Deques and LinkedLists

Tutoring Section 3: Linked Lists

Linked Lists

Tutoring Section 2: Conditionals, Loops and Arrays

Conditionals, Loops and Arrays

Tutoring Section 1: Java and Git

Java and Git