source: UCBerkeley Last updated on 2014年7月2日
Computer Science 61B, 001 2014B - Jonathan SHEWCHUK2014-01-22: Course overview; Using objects 1:48:40
2014-01-27: Defining classes 50:30
2014-01-29: Types; conditionals; Iteration & arrays 1:44:37
2014-02-03: Iteration & arrays II 50:30
2014-02-05: Linked lists I; Linked lists II: Break 1:48:15
2014-02-10: Stack frames: Full version will be avai 37:37
2014-02-10: Stack frames 51:47
2014-02-12: Testing; Inheritance 1:49:28
2014-02-19: Abstract classes; Java packages 1:49:21
2014-02-26: Exceptions; More Java 1:40:37
2014-03-03: Game Trees: Last min of audio not avail 54:49
2014-03-05: Encapsulation; Encapsulated lists 1:39:21
2014-03-10: Asymptotic analysis 52:53
2014-03-12: Algorithm analysis; Dictionaries & hash 1:42:04
2014-03-17: Hash codes; Stacks & queues 51:55
2014-03-19: Trees and traversals; Priority queues 1:51:59
2014-03-31: Binary search trees 51:18
2014-04-02: Balanced search trees; Graphs 1:47:53
2014-04-07: Weighted graphs 52:02
2014-04-09: Four sorting algorithms; Quicksort 1:48:58
2014-04-16: Disjoint Sets; Sorting & selection 1:47:08
2014-04-21: Radix sort 53:50
2014-04-23: Splay trees; Amortized analysis: Last m 51:12
2014-04-28: Randomized analysis 57:09
2014-04-30: Garbage collection; Augmenting data str 1:42:45