Skip to content
Hallway
0:00 / 0:00

#dawg#boggle#trie

Lecture 25 | Programming Abstractions (Stanford)

Stanford

2.2M subscribers • 18 videos on Hallway

YouTube
  • Recommended by 2 people: 1 in engineering communities and 1 curated list.
  • Presented by Julie Zelenski, Stanford

Intermediate. Assumes working knowledge.

33K views18 years ago2 recommendations

Computer scienceSoftware designData structuresAlgorithmsC++

Julie Zelenski walks through a Boggle case study, comparing sorted vectors and binary search trees before introducing the DAWG data structure.

Help us caption and translate this video on Amara.org: amara.org/en/v/BH93/ 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: youtube.com/view_play_list?p=FE6E58F856038C69 CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development: scpd.stanford.edu/ Stanford University: stanford.edu/ Stanford University Channel on YouTube: youtube.com/stanforduniversity/

Why it's here

2 people recommend this

What people say. Recommended as an interesting algorithms lecture on choosing data structures for a real-world use case like Boggle.

u/ki11a11hippiesin r/compsci • Recommends

Pretty interesting algorithms lecture - choosing a data structure for Boggle
34View on Reddit

Coding Interview Universitycurated list on GitHubRecommends

Under “Even More Knowledge”

Stanford Lecture (real-world use case) (video)
View the list