UC Berkeley cs61b 2019 spring Data Structure （Josh Hug）
https://sp19.datastructur.es/
今年有一些视频是老师新录的，我把其中与往年视频不一致的课程搬运了一下，需配合https://sp19.datastructur.es/进行学习，前10课与18年相同，课程已经更新完。字幕已补完，请大家慢慢食用。
- 字幕制作者（English(US)）：ncww2
视频选集
（79/148）
11 Part 1 Lists and Sets in Java
05:17
11 Part 2 Basic Arrayset
05:23
11 Part 3 - exceptions
06:55
11 Part 4 Iterable
16:34
11 Part 5 toString
09:10
11 Part 6 equals
09:53
11 Part 7 Summary
01:59
11 Part 8 EXTRA fancier to String and the of static method
06:49
13 [Asymptotics1, Video 1] Welcome to the Second Half of 61B
02:45
13 [Asymptotics1, Video 2] Characterization 1 Clock Time
04:34
13 [Asymptotics1, Video 3] Technique 2 Operation Counting
06:41
13 [Asymptotics1, Video 4] Technique 2 Operation Counting Exercise
01:18
13 [Asymptotics1, Video 5] Why Scaling Matters
05:58
13 [Asymptotics1, Video 6] Worst Case Orders of Growth
07:57
13 [Asymptotics1, Video 7] Simplified Analysis
07:32
13 [Asymptotics1, Video 8] Big Theta
05:57
13 [Asymptotics1, Video 9] Big O
04:08
14 [Disjoint Sets, Video 1] - Intro to Disjoint Sets
08:31
14 [Disjoint Sets, Video 2] - Quick Find
06:36
14 [Disjoint Sets, Video 3] - Quick Union
09:13
14 [Disjoint Sets, Video 4] - Weighted Quick Union
08:37
14 [Disjoint Sets, Video 5] - Weighted Quick Union with Path Compression and Sum
10:48
15 [Asymptotics2, Video 1] Simple Nested Loops in Big Theta
01:54
15 [Asymptotics2, Video 2] Nested For Loops with Geometric Outer Loop
06:36
15 [Asymptotics2, Video 3] There is No Magic Shortcut for these Problems
03:55
15 [Asymptotics2, Video 4] Tree Recursion
05:46
15 [Asymptotics2, Video 5] Binary Search Intuitive
06:10
15 [Asymptotics2, Video 6] Binary Search Exact
09:05
15 [Asymptotics2, Video 7] Merge Sort Prelude
04:55
15 [Asymptotics2, Video 8] Merge Sort
10:01
15 [Asymptotics2, Video 9] Summary
02:06
16 [ADTs, Sets, Maps, BSTs, Video 1] - ADTs and Maps
09:46
16 [ADTs, Sets, Maps, BSTs, Video 2] - Inventing the BST
04:40
16 [ADTs, Sets, Maps, BSTs, Video 3] - BST Definitions
06:41
16 [ADTs, Sets, Maps, BSTs, Video 4] - BST Search
05:50
16 [ADTs, Sets, Maps, BSTs, Video 5] - BST Insert
04:43
16 [ADTs, Sets, Maps, BSTs, Video 6] - BST Deletion
07:35
16 [ADTs, Sets, Maps, BSTs, Video 7] - Sets vs Maps, Summary, Tips for Lab
05:34
17 [B Trees, Video 1] - Tree Height, Big O vs Worst Case
09:46
17 [B Trees, Video 2] - BST Performance
08:38
17 [B Trees, Video 3] - B Tree Basic Insertion
07:11
17 [B Trees, Video 4] - Splitting Non Leaf nodes, Terminolgoy
05:35
17 [B Trees, Video 5] - Bushiness Invariants for B Trees
05:00
17 [B Trees, Video 6] - Runtime Analysis, Summary
05:33
18 Red Black Trees, Video 1 Intro, Rotation
07:03
18 Red Black Trees, Video 2 Balancing with Rotation
05:57
18 Red Black Trees, Video 3 Red Black Tree Definition
07:24
18 Red Black Trees, Video 4 Red Black Tree Properties
09:02
18 Red Black Trees, Video 5 Red Black Tree Insertion
10:02
18 Red Black Trees, Video 6 Red Black Tree Exercise Optional
00:40
18 Red Black Trees, Video 7 Red Black Tree Exercise Solution Optional
04:45
18 Red Black Trees, Video 8 Red Black Tree Performance and Summary
06:05
19 Hashing, Video 1 Intro, Data Indexed Integer Sets
05:14
19 Hashing, Video 2 Intro, Data Indexed English Word Sets
06:01
19 Hashing, Video 3 ASCII and Data Indexed String Sets
05:02
19 Hashing, Video 4 Hash Codes and the Pigeonhole Principle
04:22
19 Hashing, Video 5 Separate Chains and Hash Tables
06:57
19 Hashing, Video 6 Hash Table Performance and Resizing
09:48
19 Hashing, Video 7 Hash Tables in Java
05:34
19 Hashing, Video 8 Good Hash Functions
07:49
20 [DataStructures5, Video 1] Introducing the Priority Queue
04:48
20 [DataStructures5, Video 2] Basic Use and Naive Implementations of the PQ
03:56
20 [DataStructures5, Video 3] Introducing the Heap
06:00
20 [DataStructures5, Video 4] Heap Operations
05:13
20 [DataStructures5, Video 5] Tree Representations
08:40
20 [DataStructures5, Video 6] PQ Implementation Considerations
04:43
20 [DataStructures5, Video 7] Data Structures Summary
12:51
21 Tries, Video 1 Special Purpose Maps
04:59
21 Tries, Video 2 Inventing the Trie
06:34
21 Tries, Video 3 The DataIndexedCharSet Trie
07:15
21 Tries, Video 4 Alternate Child Tracking Strategies
08:24
21 Tries, Video 5 Special String Operations
06:42
21 Tries, Video 6 Autocomplete, Conclusion
07:56
22 Multidimensional Data, Video 1 Intro to spatial search problems
03:29
22 Multidimensional Data, Video 2 Uniform Partitioning
04:24
22 Multidimensional Data, Video 3 1D BSTs on 2D data
06:40
22 Multidimensional Data, Video 4 QuadTree Insertion
05:18
22 Multidimensional Data, Video 5 QuadTree Range Finding
05:52
22 Multidimensional Data, Video 6 KdTree Insertion
09:51
22 Multidimensional Data, Video 7 K d Tree Nearest Finding
12:57
22 Multidimensional Data, Video 8 - k-d tree nearest PseudoCode
02:35
22 Multidimensional Data, Video 9 Summary and Applications
05:05
23 Intro to Graphs, Video 1 Tree Traversals
13:33
23 Intro to Graphs, Video 2 Graph Definition
07:39
23 Intro to Graphs, Video 3 Graph Problems
05:21
23 Intro to Graphs, Video 4 s t Connectivity
06:44
23 Intro to Graphs, Video 5 DepthFirstPaths
07:05
23 Intro to Graphs, Video 6 Tree vs Graph Traversals
06:14
24 Lecture 24 - BST and Graph Algorithm Implementations
50:41
25 Lecture 25, 2019 - Shortest Paths
55:00
26 vid1 graph problem warmup
02:39
26 vid2 spanning tree definition
02:20
26 vid3 spanning tree usefulness
01:50
26 vid4 msts vs spts
05:16
26 vid5 the cut property
04:57
26 vid6 prims conceptually
04:25
26 vid7 prims efficient
08:54
26 vid8 prims vs dijkstras
04:14
26 vid9 kruskals algorithm
06:41
26 vid10 kruskals vs prims
01:07
26 vid11 kruskals runtime
04:53
26 vid12 a funny thing happened on the way to optimal MST computation
02:33
27 Lecture 27 - Reductions and Decomposition
55:01
29 Lecture 29 - Basic Sorts
55:00
30 Lecture 30 - QuickSort
55:00
31 61B Lecture 31 - Software Engineering I
55:00
32 61B Lecture 32 - More Quick Sort, Sorting Summary
55:00
33 [Sorting4, Part 1] Math Warmup
10:11
33 [Sorting4, Part 2] Simple Bounds for TUCS
04:53
33 [Sorting4, Part 3] Puppy Cat Dog
07:27
33 [Sorting4, Part 4] Puppy Cat Dog
08:28
34 lec34 part1
10:55
34 lec34 part2
04:27
34 lec34 part3
12:58
34 lec34 part4
11:06
34 lec34 part5
06:31
35 Radix Sorts, Video 1 Going Beyond Comparison, Sleep Sort
04:21
35 Radix Sorts, Video 2 Intro to Counting Sort
03:18
35 Radix Sorts, Video 3 Counting Sort on Card Suits
05:35
35 Radix Sorts, Video 4 Counting Sort Runtime
07:58
35 Radix Sorts, Video 5 LSD Sort
08:50
35 Radix Sorts, Video 6 MSD Sort
08:56
36 [Radix vs. Comparison Sorting1, Video1] - Intuitive Analysis of Radix Sort vs
04:09
36 [Radix vs. Comparison Sorting1, Video2] - Cost Model Analysis of Radix Sort v
05:14
36 [Radix vs. Comparison Sorting1, Video3] - Hypothesis that Merge Sort will be
02:18
36 [Radix vs. Comparison Sorting1, Video4] - Running Our Empirical Analysis
03:04
36 [Radix vs. Comparison Sorting1, Video5] - The Just In Time Compiler
05:25
36 [Radix vs. Comparison Sorting1, Video6] - Rerunning Our Experiment with the J
07:26
36 [Radix vs. Comparison Sorting1, Video7] - Radix Sorting Integers
07:44
36 [Radix vs. Comparison Sorting1, Video8] - Sorting Summary
06:17
37 CS61B Sp19 Lec 37 - Software Engineering III - Your Life
55:00
38 vid1
02:07
38 vid2 codes, morse code
05:27
38 vid3 prefix free codes
04:11
38 vid4 shannon fano codes
03:18
38 vid5 huffman coding
06:11
38 vid6 data structures for huffman coding
05:42
38 vid7 huffman encoding demo
06:49
38 vid8 huffman encoding demo
03:51
38 vid9 proof that universal compression is impossible, an alternate model for
08:51
38 vid10 HugPlant
04:03
39 vid1 model 2 compression re explained
05:21
39 vid2 compressing the hugplant
04:16
39 vid3 kolmogorov complexity
06:45
39 vid4 space and time bounded compression
05:42
39 vid5 does P = NP
09:01
39 vid6 almost like gods
07:37
39 vid7 short but not comprehensible, fractal sound
09:01
爆肝30天！我做了一款《跳跳史莱姆》游戏！！
点击体验>>
顶部