Lecture 25 | Programming Abstractions (Stanford)
- Title:
- Lecture 25 | Programming Abstractions (Stanford)
- Description:
-
more » « less
Lecture 25 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.
Julie examines a case study and opening up the lexicon file, which is complicated; she walks the students through the code and explains why she wrote it as she did as opposed to a sorted vector or binary search tree. She then introduces the DAWG data structure.
Complete Playlist for the Course:
http://www.youtube.com/view_play_list?p=FE6E58F856038C69CS 106B Course Website:
http://cs106b.stanford.eduStanford Center for Professional Development:
http://scpd.stanford.edu/Stanford University:
http://www.stanford.edu/Stanford University Channel on YouTube:
http://www.youtube.com/stanforduniversity/ - Video Language:
- English
- Duration:
- 50:36
N. Ueda edited English subtitles for Lecture 25 | Programming Abstractions (Stanford) | ||
Eunjeong_Kim added a translation | ||
Eunjeong_Kim added a video: Lecture 25 | Programming Abstractions (Stanford) |