CSE 326: Data Structures Lecture #25 Class Wrap-up
Today’s Outline
Memoizing/ Dynamic Programming
Optimal Binary Search Tree Problem
The Optimal BST
Optimal BST Cost
Optimal BST Algorithm
Backtracking (a.k.a. Systematic Search)
Backtracking in Action
Game Search
Backtracking Game Search (MiniMax)
?-? Pruned Game Search
Randomized Algorithms
Randomization in Action
Properties of Primes
Calculating Powers
Checking Primality
Evaluating Randomized Primality Testing
Randomized Greedy Algorithms: Simulated Annealing
Randomized Backtracking for Heavy-Tailed Distributions
Data Structures and ADTs
Algorithms and Algorithm Analysis
Evaluating Algorithms
Criteria for Good Running Time
Games Theoreticians Play
More Games Theoreticians Play
Observation
Goals of the Course
To Do
Coming Up
Email: owner-cse326@cs.washington.edu
Home Page: http://www.cs.washington.edu/326/
Download presentation source