15-451 Course Information, Spring 2009

Overview:

This course is about designing algorithms for computational problems, and how to think clearly about analyzing correctness and running time. The main goal of this course is to provide the intellectual tools needed for designing and analyzing your own algorithms for new problems you need to solve in the future. Algorithm design tools we will discuss include Dynamic Programming, Divide-and-Conquer, Data Structure design principles, Randomization, Network Flows, Linear Programming, and the Fast Fourier Transform. Some analytical tools we will discuss and use include Recurrences, Probabilistic Analysis, Amortized Analysis, and Potential Functions. We will also discuss a bit of Complexity Theory (which looks at the intrinsic difficulty of computational problems) as well as Cryptography and Algorithmic Game Theory.

Instructor:

Manuel Blum, mblum@cs.cmu.edu, GHC 7205, x8-3742. Office hours: Tue-Thur after class.

Teaching Assistants:

Or Sheffet, osheffet@cs.cmu.edu. Office Hours: Tuesday 16:00-17:00 at GHC 7004. Students can email me if they want to meet at a different time.

Tilak Sharma, tilaks@andrew.cmu.edu. Office Hours: Monday 4:30-5:30 at GHC 7th floor lounge. Students can email me if they want to meet at a different time.

Andrey Vadim Grinshpun, agrinshp@andrew.cmu.edu. Office Hours: Monday 2:30-3:30 at WH 6th floor couches or WH 6215, depending on availability.

Sam Tetruashvili, samt@cmu.edu. Office Hours: Wednesday 4:30-6:00 at GHC 7th floor lounge

Dafna Shahaf, dshahaf+451@cs.cmu.edu. Office Hours: Friday 2:30-3:30 at GHC 7th floor lounge

Course Secretary:

Amelia Williams, ameliaw@cs.cmu.edu, Wean 4114, x8-7897.

Lectures: Tues/Thurs 12:00-1:20. Wean Hall 7500

Recitations:

Rec E: Wed 10:30 (DH 1217) - Or Sheffet

Rec A: Wed 11:30 (DH 1217) - Tilak Sharma

Rec B: Wed 1:30 (DH 1217) - Dafna Shahaf

Rec C: Wed 2:30 (DH 1217) - Andrey Vadim Grinshpun

Rec D: Wed 3:30 (DH 1217) - Sam Tetruashvili

Everyone is expected to go to one of the recitation sections. Recitations are a chance to engage in more discussion than is usually possible in a large lecture, with a focus on the process of solving algorithmic problems. Recitations will often contain new material as well.

Final Exam: TBA

Course Home page: http://www.cs.cmu.edu/afs/cs/academic/class/15451-s10/www/

Check it frequently for announcements and updates, lecture notes, handouts, assignments, solutions, and other goodies.

Bboards:

There are two bulletin boards for the course: academic.cs.15-451.discuss is for general discussion, and academic.cs.15-451 is for staff announcements. Please use them and read them frequently!

Grading: Grading will be done as follows:

• homeworks and minis: 45% (7 hwks at 5% each, 5 minis at 2% each)
• quizzes: 10% (Two 30-min quizzes at 5% each)
• midterm: 15%
• final: 30%
• class participation: adjust borderline scores

Important Dates:

The first quiz will be February 9. The midterm will be March 2. The second quiz will be April 8. The date of the final is not yet known. A detailed course schedule is available from the course home page.

Homework:

There will be a problem set every two weeks. These will alternate between ones that require written answers (homeworks 1, 3, 5, and 7) and ones that require an oral presentation (homeworks 2, 4, and 6). Here are guidelines for each type of assignment.

Written homeworks:

• Written homeworks are due at the start of class on their due date. You should do each problem on a separate page, with your name and recitation section at the top of each page. There will be separate boxes to hand in each problem.
• You should do the homeworks by yourself. What you hand in is to be your own work. If you get stuck, come see the TAs or instructor. Clarification questions can also be posted to the bboards.
• Typed homework is not required, but we don't discourage it. It is your responsibility to make sure your handin is legible. Latex (see miktex for Windows machines) is a good typesetting system for documents with lots of math.
• Lateness Policy: We have adopted the following lateness policy in order to allow us to post solutions soon after the due date.
  • later in the same day: 10% off
  • 1-2 days (up to 48 hours) late: 25% off
  • more than 48 hours late: 75% off
    (at this point solutions will be posted and you may look at them, though anything handed in should be put into your own words)

Oral Homeworks:

• The oral-presentation homeworks will be done in groups of three. Each of these assignments will consist of three problems. The members of your group will work together to solve the problems (so, unlike written homeworks, here collaboration is required). You will then present your solutions, as a group, to one of the instructors or TAs.
• Presentations will be given in 1-hour time slots (there will be an electronic sign-up sheet reachable from the course home page). At the presentation, each member of the group will spend 15 minutes presenting one of the problems. The instructor (or TA) will decide who presents which problem, but when one member is presenting, other members are allowed to chime in too. In the end, the three presentations together will determine the grade for the group.
• If you are nervous about your presentation, you may in addition hand in a written sketch of your solution as well. We will then take this writeup into consideration in determining your grade on the assignment.

Minis:

Mini-homeworks will be handed out on Thursdays, and will be due via email to your TA by the upcoming Tuesday night . These will typically be practice-type problems or sometimes may consist of a single open-ended question to think about. Unlike the regular homeworks, these are intended to require at most one hour of work. If you are taking more time than that, please let one of us know. As with written homeworks, you should do minis by yourself -- if you have questions, contact your TA.

Textbook:

The textbook for the course Introduction to Algorithms (Second Edition) by Cormen, Leiserson, Rivest, and Stein (hereafter referred to as "CLRS"). If you have a (very) old version of CLRS, known as "CLR", you can use that too. We will be providing lecture notes covering all the material in this course, but we would like you to have a book to give you more detailed coverage (as well as an alternative perspective if you cannot understand what the instructor is saying!). Specific readings are listed on the course schedule. It is recommended that you skim the reading before lecture, with a more thorough read afterwards.

Other helpful material can be found in: Algorithm Design by J. Kleinberg and E. Tardos, Algorithms by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, Data Structures and Network Algorithms by R. E. Tarjan, Randomized Algorithms by Motwani and Raghavan, Programming Pearls by J. Bentley, Introduction to Algorithms: a Creative Approach by Manber, and the classic Aho-Hopcroft-Ullman book.