MIT机电工程与计算机科学系【本科生课程】6.006.算法导论.Introduction.to.Algorithms[www.ed2kers.com].pdfVIP

Introduction to Algorithms As taught in: Spring 2008 Rotation of a binary search tree, from the Recitation #4 slides. (Figure courtesy of Victor Costan.) Instructors: Prof. Erik Demaine Prof. Ronald Rivest Prof. Srinivas Devadas MIT Course Number: 6.006 Level: Undergraduate Course Description This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems. Syllabus Course Meeting Times Lectures: 2 sessions / week, 1 hour / session Recitations: 2 sessions / week, 1 hour / session Prerequisites A strong understanding of programming in Python™ and a solid background in discrete mathematics are necessary prerequisites to this course. You are expected to have taken 6.01 Introduction to EECS I and 6.042J/18.062J Mathematics for Computer Science, and received a grade of C or higher in both classes. If you do not meet these requirements, you must talk to a TA before taking the course. Course 6 Requirements New Curriculum For those students pursing the new curriculum, 6.006 will serve as a Foundational Computer Science course. In Fall 2008, 6.046 will have 6.006 as a prerequisite, and 6.046 will serve as a Computer Science theory header. Old Curriculum Students pursuing the old curriculum may count 6.006 as their computer science theory header (i.e., as a substitute for 6.046). 6.046 can still be taken and counted as a theory elective, if it is taken Fall 2008 or later. Lectures You are responsible for material presented in lectures, including oral comments made by the lecturer. Recitations Students must attend recitations. You are responsible for materia