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
Instructor: Dennis Freeman Description: Additional examples today illustrate the use of feedback to reduce sensitivity to variable component parameters and crossover distortion in audio systems, and to control two unstable systems (magnetic levitation, inverted ...
Instructor: Dennis Freeman Description: In the next half of the course, periodic functions are represented as sums of harmonic functions, via Fourier decomposition. Linear time-invariant systems amplify and phase-shift these inputs to produce filtered output, an ...
Instructor: Dennis Freeman Description: The response of a system to sinusoidal input gives valuable information about its behavior in the frequency domain, similar to convolution in the time domain. Eigenfunctions and vector plots are used to explore this frequency ...
Instructor: Dennis Freeman Description: This lecture introduces the administrative details of the course, and uses examples from several engineering fields to illustrate the central abstraction of 6.003: analysis and design of systems via their signal transform ...
Instructor: Dennis Freeman Description: In linear time-invariant systems, breaking an input signal into individual time-shifted unit impulses allows the output to be expressed as the superposition of unit impulse responses. Convolution is the general method of ...
Description: This recitation revisits the perfect-information blackjack problem that was covered in lecture. Instructor: Victor Costan
Description: This recitation covers the wood-cutting problem (dynamic programming) and Bloom filters (hashing, probability). Instructor: Victor Costan
Description: This lecture introduces computational complexity, including how most decision problems are uncomputable, hardness and completeness, and reductions. Instructor: Erik Demaine
Instructor: Dennis Freeman Description: The final Signals and Systems lecture explains how audio playback evolved from the fragile Edison cylinder phonograph to durable modern optical disks, through the application of digital signal processing concepts.
Instructor: Dennis Freeman Description: Today's lecture continues the discussion of control systems by demonstrating how feedback loops can add speed and bandwidth to the LM741 op-amp, and allow better control of a robot arm's angular position.
Description: This is the first of two lectures on numerics, covering irrational numbers, high-precision computation, and Karatsuba multiplication. Instructor: Srini Devadas
Description: Priority queues are introduced as a motivation for heaps. The lecture then covers heap operations and concludes with a discussion of heapsort. Instructor: Srini Devadas
Description: This lecture starts by using the comparison model to prove lower bounds for searching and sorting, and then discusses counting sort and radix sort, which run in linear time. Instructor: Erik Demaine
Description: This lecture starts with dictionaries in Python, considers the problems with using a direct-access table, and introduces hashing. The lecture discusses hashing with chaining, which is one way of dealing with collisions. Instructor: Erik Demaine
Description: This lecture covers table resizing, amortized analysis, string matching with the Karp-Rabin algorithm, and rolling hashes. Instructor: Erik Demaine
Description: This lecture introduces a second type of guessing, in which more subproblems are created so that more features of the solution can be found. This type of guessing is illustrated with piano/guitar fingering and the Tetris and Super Mario Brothers games. ...
Description: This lecture shows how to find shortest paths in directed acyclic graphs (DAGs) using topological sort, and in graphs without negative edges using Dijkstra's algorithm. Instructor: Srini Devadas
Description: This lecture covers optimizations that can improve real-life, average case performance of shortest path algorithms. These include using Dijkstra for a single source and single target, bi-directional search, and goal-directed or A* search. Instructor: Srini ...
Description: This recitation discusses principles of algorithm design, using example problems from previous final exams. Instructor: Victor Costan
Description: This recitation mostly covers rolling hashes, with a short discussion of amortized analysis at the end. Instructor: Victor Costan