# 2 Classes (24 Units)

**6.006**(12),

**6.042**(12)

# 6.006 Introduction to Algorithms

Introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. Emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems.

This class has 6.042, 6.0001, and 6.009 as prerequisites.

6.006 will be offered this semester (Spring 2019). It is instructed by J. Ku.

Lecture occurs 11:00 AM to 12:00 PM on Tuesdays and Thursdays in 26-100.

This class counts for a total of 12 credits.

You can find more information at the 6.006: Introduction to Algorithms - Massachusetts Institute of Technology site or on the 6.006 Stellar site.

# 6.042 Mathematics for Computer Science

Elementary discrete mathematics for computer science and engineering. Emphasis on mathematical definitions and proofs as well as on applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics include recursive definition and structural induction, state machines and invariants, integer congruences, recurrences, generating functions.

This class has 18.01 as a prerequisite.

6.042 will be offered this semester (Spring 2019). It is instructed by F. T. Leighton,  Z. R. Abel and  A. Moitra.

Lecture occurs 2:30 PM to 4:00 PM on Tuesdays and Thursdays in 34-101.

This class counts for a total of 12 credits.

You can find more information at the 403 Forbidden site or on the 6.042 Stellar site.