Algorithms, Part II

In session from: Mar 16, 2016

Part II covers graph-processing algorithms, including minimum spanning tree and shortest paths algorithms, and string processing algorithms, including string sorts, tries, substring search, regular expressions, and data compression, and concludes with an overview placing the contents of the course in a larger context.

Instructor(s)

Robert Sedgewick
Robert Sedgewick
William O. Baker Professor of Computer Science

Robert Sedgewick was the founding chair of the Department of Computer Science. Prof. Sedgewick also served on the faculty at Brown University and has held various visiting research positions. Prof. Sedgewick's interests are in analytic combinatorics, algorithm design, the scientific analysis of algorithms, curriculum development, and innovations in the dissemination of knowledge. He has published widely in these areas and is the author of several books.

Kevin Wayne
Kevin Wayne
Phillip Y. Goldman Senior Lecturer in Computer Science

Kevin Wayne's research interests include the design, analysis, and implementation of algorithms. With Robert Sedgewick, he is the coauthor of two acclaimed textbooks, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008) and Algorithms, 4th Edition (Addison-Wesley Professional 2011). He has won the School of Engineering and Applied Science's Distinguished Teacher Award and the Engineering Council's Excellence in Teaching Award.