Methods of Matching 00:00:00
Rabin Karp Algorithm 00:06:03
Knuth Morris Pratt Algorithm 00:18:55
Prefix Function 00:33:17
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.