Electrical Engineering and Computer Science (6) -
http://hdl.handle.net/1721.1/33986
Electrical Engineering and Computer Science (6)2017-02-24T08:05:22Z6.005 Elements of Software Construction, Fall 2011
http://hdl.handle.net/1721.1/106923
6.005 Elements of Software Construction, Fall 2011
Miller, Robert
This course introduces fundamental principles and techniques of software development. Students learn how to write software that is safe from bugs, easy to understand, and ready for change. Topics include specifications and invariants; testing, test-case generation, and coverage; state machines; abstract data types and representation independence; design patterns for object-oriented programming; concurrent programming, including message passing and shared concurrency, and defending against races and deadlock; and functional programming with immutable data and higher-order functions. The course includes weekly programming exercises and two substantial group projects.
2011-12-01T00:00:00Z18.405J / 6.841J Advanced Complexity Theory, Fall 2001
http://hdl.handle.net/1721.1/106671
18.405J / 6.841J Advanced Complexity Theory, Fall 2001
Spielman, Daniel
The topics for this course cover various aspects of complexity theory, such as  the basic time and space classes, the polynomial-time hierarchy and the randomized classes . This is a pure theory class, so no applications were involved.
2001-12-01T00:00:00Z6.042J / 18.062J Mathematics for Computer Science, Spring 2005
http://hdl.handle.net/1721.1/104427
6.042J / 18.062J Mathematics for Computer Science, Spring 2005
Leiserson, Charles; Lehman, Eric; Devadas, Srinivas; Meyer, Albert R.
This course is offered to undergraduates and is an elementary discrete mathematics course oriented towards applications in computer science and engineering. Topics covered include: formal logic notation, induction, sets and relations, permutations and combinations, counting principles, and discrete probability.
2005-06-01T00:00:00Z6.042J / 18.062J Mathematics for Computer Science, Spring 2010
http://hdl.handle.net/1721.1/104426
6.042J / 18.062J Mathematics for Computer Science, Spring 2010
Meyer, Albert R.
This subject offers an introduction to Discrete Mathematics oriented toward Computer Science and Engineering. The subject coverage divides roughly into thirds: Fundamental concepts of mathematics: definitions, proofs, sets, functions, relations. Discrete structures: graphs, state machines, modular arithmetic, counting. Discrete probability theory. On completion of 6.042, students will be able to explain and apply the basic methods of discrete (noncontinuous) mathematics in Computer Science. They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.
2010-06-01T00:00:00Z