The mission of the Department of Electrical Engineering and Computer Science is to produce graduates who are capable of taking a leadership position in the broad aspects of electrical engineering and computer science. Learn more
Description: This recitation covers the Python cost model and looks at the code for document distance, including main and most functions except count_frequency. Instructor: Victor Costan
Description: This recitation continues to look at versions of the document distance code, and briefly discusses insertion and merge sort. Instructor: Victor Costan
Description: This recitation starts with a review of recursion trees and recurrences, and then discusses binary search trees. Instructor: Victor Costan
Description: This recitation covers insertion, deletion, and rebalancing of AVL trees. Instructor: Victor Costan
Description: This recitation discusses the first problem from Problem Set 3, covering sweep-line algorithms and range queries. Instructor: Victor Costan
Description: This recitation looks at player positions in the Dance Dance Revolution game, along the lines of the guitar fingering example shown in lecture. Instructor: Victor Costan
Description: This recitation reviews the computational complexity concepts presented in lecture. Instructor: Victor Costan
Description: This lecture begins with error analysis of Newton's method and a comparison of multiplication algorithms. It then covers high-precision division, which is required for Newton's method, and discusses the complexity of division and computing square roots. ...
Description: This lecture begins with a review of graphs and applications of graph search, discusses graph representations such as adjacency lists, and covers breadth-first search. Instructor: Erik Demaine
Description: Overview of course content, including an motivating problem for each of the modules. The lecture then covers 1-D and 2-D peak finding, using this problem to point out some issues involved in designing efficient algorithms. Instructor: Srini Devadas
Description: Sorting is introduced, and motivated by problems that become easier once the inputs are sorted. The lecture covers insertion sort, then discusses merge sort and analyzes its running time using a recursion tree. Instructor: Srini Devadas
Description: This recitation discusses the knapsack problem and polynomial time vs. pseudo-polynomial time. Instructor: Victor Costan
Description: This lecture reviews shortest path notation, considers a generic shortest path algorithm, and then describes and proves the Bellman-Ford algorithm, which can handle graphs with negative cycles. Instructor: Srini Devadas
Description: This recitation covers depth-first search and DFS edge classification. Instructor: Victor Costan
Description: This recitation starts with a review of comparison sorting methods, and then discusses counting sort and radix sort. Instructor: Victor Costan
Description: This recitation reviews numerics and graphs in preparation for Quiz 2. Instructor: Victor Costan
Description: This recitation uses dynamic programming to find subsequences in the card game Crazy Eights, and to find the shortest path in a graph. Instructor: Victor Costan
Description: In this lecture, both professors present areas of current research, including parallel processor architecture and algorithms, geometric folding algorithms, data structures, and graph algorithms. Instructor: Srini Devadas, Erik Demaine
Description: This recitation starts with a discussion of Problem Set 5, and then covers graph representations and breadth-first search. Instructor: Victor Costan
Description: This recitation covers breadth-first search for shortest paths. Instructor: Victor Costan