Sometimes it's hard to get a sense about what a life and culture of a school is like w/o interacting with the students. So we have brought in two of MIT's most MIT-esque students (us) to provide you with that. 'We're two MIT student, come and ask us questions about our lives and our school.' - Avery 'Ask Avery and Megan Anything,well almost anything. Actually pretty much anything. We'll answer your questions about MIT, and well, anything.' - Megan

A fast overview of the material covered in MIT's 6.006: Introduction to Algorithms. We will look at a wide variety of algorithms, and give examples of the problems that they can be used to solve. Potential topics covered include: Asymptotic notation Divide and Conquer algorithms Sorting Hash tables, stacks, queues, trees Dynamic Programming Graph algorithms