UC Berkeley · Computer Science
Computer Science 61B
2014 · 26 free video lectures
26 recorded lectures from UC Berkeley's Computer Science 61B (Spring 2014). Berkeley removed its public webcasts; this copy is preserved on the Internet Archive.
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Lecture 3
- 2014-01-22: Course overview; Using objects
- 2014-01-27: Defining classes
- 2014-01-29: Types; conditionals; Iteration & arrays
- 2014-02-03: Iteration & arrays II
- 2014-02-05: Linked lists I; Linked lists II: Break
- 2014-02-10: Stack frames
- 2014-02-10: Stack frames: Full version will be avai
- 2014-02-12: Testing; Inheritance
- 2014-02-19: Abstract classes; Java packages
- 2014-02-26: Exceptions; More Java
- 2014-03-03: Game Trees: Last min of audio not avail
- 2014-03-05: Encapsulation; Encapsulated lists
- 2014-03-10: Asymptotic analysis
- 2014-03-12: Algorithm analysis; Dictionaries & hash
- 2014-03-17: Hash codes; Stacks & queues
- 2014-03-19: Trees and traversals; Priority queues
- 2014-03-31: Binary search trees
- 2014-04-02: Balanced search trees; Graphs
- 2014-04-07: Weighted graphs
- 2014-04-09: Four sorting algorithms; Quicksort
- 2014-04-16: Disjoint Sets; Sorting & selection
- 2014-04-21: Radix sort
- 2014-04-23: Splay trees; Amortized analysis: Last m
- 2014-04-28: Randomized analysis
- 2014-04-30: Garbage collection; Augmenting data str
From UC Berkeley webcasts, copy on the Internet Archive · CC BY-NC-ND 3.0. More from UC Berkeley.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights