Education For All

www.edforall.net

Text size
  • Increase font size
  • Default font size
  • Decrease font size

Programming Abstractions - Lecture 25

Get the Flash Player to view video.
Lecture 25 - Lexicon Case Study

Lexicon Case Study, Lexicon as Sorted Vector, Lexicon as BST, Lexicon as Hash Table, Summary so Far, Noticing Patterns/repetitions in the Words, Letter Trie, Lexicon as Trie, Dynamic Array of Children, Flatten Tree into Array, Exploiting Prefixes and Suffixes, DAWG: Directed Acyclic Word Graph, Lexicon as DAWG, The Final Result, Cool Facts about the DAWG

Julie Zelenski
CS106B Programming Abstractions
(Stanford University: Stanford Engineering Everywhere)
http://see.stanford.edu
Date accessed: 2008-12-04
License: Creative Commons Attribution 3.0

Lecture Material

To view the lecture material accompanying this lecture in a new window, please click the button below. If necessary, use the vertical or horizontal scrollbar in the new window to view more of the material or you can resize the window.

To download the above lecture material use this link. (Right-click and select Save Target As or Save Link As.)

Supplementary lecture material is listed below.

1. Assignment 9
2. Solutions for Assignment 9



 

Translate

Chinese (Simplified) French German Italian Japanese Korean Portuguese Russian Spanish
More educational resources: