Naive String Matcher Implementation 00:03:03
Dynamic Programming 00:58:45
Divide and Conquer 01:10:10
Properties of Dynamic Programming 01:14:51
Pipe Cutting Problem 01:26:33

This course builds on COMP 231 to apply similar techniques to analyze more sophisticated algorithms and data structures. Topics covered include various tree types, graphs, storage structures and algorithms suitable for storage and retrieval of data to and from secondary storage, greedy algorithms, graph search and traversal and random algorithms.

Loading more stuff…

Hmm…it looks like things are taking a while to load. Try again?

Loading videos…