DOC PREVIEW
MIT 6 006 - Course Information

This preview shows page 1-2 out of 7 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 7 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 7 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 7 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Introduction to Algorithms September 6, 2007Massachusetts Institute of Technology 6.006Professors Ron Rivest and Srini Devadas Handout 1Course InformationThis handout describes basic course information and policies. Most of the sections will beuseful throughout the course. The main items to pay attention to NOW are:1. Be sure to hand in the recitation sign up sheet at the end of lecture.2. Please note the dates of the quizzes (Oct 17 and Nov 28) and make sure you will be availableon these dates.3. Please note the collaboration policy for homeworks.4. Please note the grading policy, and in particular, the penalty for missed problems.1 StaffLecturers: Ron Rivest 32-G692 [email protected] Devadas 32-G844 [email protected] Assistants: Michael Lieberman TBD [email protected] Zhou TBD [email protected] Wide Web: http://courses.csail.mit.edu/6.006Email: [email protected] PrerequisitesSome understanding of programming in Python and a good background in discrete mathematicsare necessary prerequisites to this course.You are expected to have taken 6.01 Introduction to EECS I and 6.042J/18.062J Mathematicsfor Computer Science, and received a grade of C or higher in both classes. If you do not meet theserequirements, you must talk to a TA before taking the course.2 Handout 1: Course Information3 Course 6 requirements3.1 New CurriculumFor those students pursing the new curriculum, 6.006 will serve as a Fundational Computer Sciencecourse. Next year, 6.046 will have 6.006 as a prerequisite, and 6.046 will serve as a ComputerScience theory header.3.2 Old CurriculumStudents pursuing the old curriculum may count 6.006 as their computer science theory header(i.e., as a substitute for 6.046). Later, 6.046 can still be taken and counted as a theory elective.(Advice: if you do so, it would be better to wait a bit as the material in 6.046 will be adapted tooverlap less with 6.006 material.)4 LecturesLectures will be held in Room 1-190 from 11:00 A.M. to 12:00 P.M. ET on Tuesdays and Thurs-days.You are responsible for material presented in lectures, including oral comments made by thelecturer.5 RecitationsTwo one-hour recitations will be held in Room 4-153 on Wednesdays and Fridays. Recitationassignments made by the scheduling office are not used. The course staff will schedule recitationsbased on the recitation sign up sheets that should be turned in at the end of the first lecture.Students must attend recitations. You are responsible for material presented in recitation. At-tendance in recitation has been well correlated in the past with exam performance. Recitationsalso give you a more intimate opportunity to ask questions and interact with the course staff. Yourrecitation instructor will have a significant say in your final grade.6 Problem setsSix problem sets will be assigned during the semester. The course calendar, on the last page of thisdocument, and also available on the class webpage, shows the tentative schedule of assignments,and due dates. The actual due date will always be on the problem set itself.A large portion of each problem set will be a coding assignment to be done in Python. Anycode for submission will be uploaded to the class website, and the final submission will be graded.Handout 1: Course Information 3• Late homework will generally not be accepted. If there are extenuating circumstances, youshould make prior arrangements with your recitation instructor.An excuse from the Dean’s Office will be required if prior arrangements have not been made.• Problem set solutions (other than code) must be written in LaTeX using the template pro-vided on the website. They should be submitted by 11:59PM of the due date. You mustsubmit them in PostScript or PDF format, following the instructions given on the homeworkitself. (If hand-drawn diagrams are useful for explaining solutions, please refer to the dia-grams in your LaTeX submission, and hand them in at your next recitation (make sure yourname is on these diagrams).)Be sure to fill in the “Collaborators” section of each problem. If you solved the problemalone, write “none”.• The problem sets include exercises that should be solved but not handed in. These questionsare intended to help you master the course material and will be useful in solving the assignedproblems. Material covered in exercises will be tested on exams.7 ExamsThere will be two evening quizzes, on Wednesday October 17, and Wednesday November 28. Thequizzes will be two hours long, starting at 7:30PM. Recitations those days will be optional reviewsessions.There will also be a final exam during finals week.8 Grading policyThe final grade will be primarily based on recitation participation, 6 problem sets, two quizzes,and a final. Recitation partipation will be worth 20 points. The problem sets will together be worth30 points, each quiz will be 20 points, and the final exam 30 points.There is a penalty for missing, i.e., not attempting, problems in the problem set. The followingtable shows the impact of failing to do problems:4 Handout 1: Course InformationProblems skipped Impact0 None1 One-hundredth of a letter grade2 One-tenth of a letter grade3 One-fifth of a letter grade4 One-fourth of a letter grade5 One-third of a letter grade6 One-half of a letter grade7 One letter grade8 Two letter grades9 or more FailPlease observe that this table is for problems skipped, not problem sets.The specifics of this grading policy are subject to change at the discretion of the course staff.Grading of CodeCode will be graded for correctness and for the algorithm used.Correctness You will be given a public set of unit tests to test your code. For grading purposes,we will run your code against a more thorough private set of unit tests. Your code must runwithin the time allotted (which will vary by assignment).Algorithm Your code must come well-commented describing the algorithm used. Your code mustbe readable so the TAs will believe that your code does what it claims to do. Your algorithmshould be efficient.9 Collaboration policyThe goal of homework is to give you practice in mastering the course material. Consequently, youare encouraged to collaborate on problem sets. In fact, students who form study groups generallydo better on exams than do students who work alone. If you do work in a study group, however,you owe it to yourself and your group to be prepared for your study group meeting. Specifically,you should


View Full Document

MIT 6 006 - Course Information

Documents in this Course
Quiz 1

Quiz 1

7 pages

Quiz 2

Quiz 2

12 pages

Quiz 2

Quiz 2

9 pages

Quiz 1

Quiz 1

10 pages

Quiz 2

Quiz 2

11 pages

Quiz 1

Quiz 1

12 pages

Graphs

Graphs

27 pages

Load more
Download Course Information
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Course Information and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Course Information 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?