CS 4321: Introduction to Algorithms
 Spring 2008
 1:05-1:55pm MWF
G09 Rekhi

Most recent update: April 28
Homework and Handouts                                                   Levitin's Slides
4/28 Final Exam (Final exam schedule)
4/25 List of problems and algorithms
4/10 Homework 8 Due Wednesday, April 23
3/18 Exam 2 Friday, April 18
3/28 Homework 7 Due Wednesday, April 9
3/31 HW 6 solutions
3/18     Linear time selection algorithm
3/18 Homework 6 Due Friday, Mar. 28     Chpt 5: Decrease & Conquer
3/17 HW 5 solutions
2/27 Homework 5 Due Friday, Mar. 7
2/28 HW 4 solutions
2/26     Exam 1 solutions
2/25 Quicksort average cost handout
2/14 Exam 1 Friday, February 22
2/14 Homework 4 Due Wednesday, Feb. 27
2/14 HW 3 solutions     Chpt 4: Divide & Conquer
2/11 Survey responses
2/4 HW 2 solutions
2/1 Homework 3 Due Wednesday, Feb. 13     Chpt 3: Brute Force
1/25 HW 1 solutions
1/23 Homework 2 Due Monday, Feb. 4
1/18 Definitions for asymptotic notation     Chpt 2: Fundamentals of Analysis
1/17 Homework 1 Due Friday, Jan. 25
1/14 Overview of algorithm design
and analysis topics 		    Chpt 1: Introduction

Fundamental topics in algorithm design, analysis, and implementation. Analysis fundamentals include asymptotic notation, analysis of control structures, solving recurrences, and amortized analysis. Design and implementation topics include sorting, searching, and graph algorithms. Design paradigms include greedy algorithms, divide-and-conquer algorithms, and dynamic programming. Prerequisites: CS 1721 and CS 2321 and CS 3311.

Syllabus (Updated April 28)
Text (required):
Title: The Design and Analysis of Algorithms
Author: A. Levitin
ISBN: 0-321-35828-7
Publisher: Addison Wesley
Pub. Date: 2nd Ed., 2007
Instructor: Steve Seidel
Office hours: 3-4:30pm Tuesday and Wednesday and whenever my door is open, and by appointment
Office: 310 Rekhi Computer Science Hall
Phone: 487-2950
Email: steve@mtu.edu

Grading is based on a 10% sliding scale: 100%-90% A, 89%-80% B, etc. Course activities will be weighted as given below.

50%: Homework will be assigned on a regular basis. You may discuss problems with each other but you must write your answers in your own words. Homework assignments will be graded; they will be worth about 50 points each.

24%: Two 1-hour in-class closed-book exams, each worth 12%, will be given.

26%: 2-hour final exam. The format of the final exam is like that of the midterm exams, but the final exam will be comprehensive. This exam will be given in the regularly scheduled final exam time slot.