The course assistants will be:

Our undergraduate TA will be Yimin Zhu.
Her email address is
zym19930828@gmail.com.
Her office hours will be 10AM to 11:30AM on Monday and Wednesday.
Lecture Notes
Course Documents
Homework Assignments

Homework 1  DUE 2/19/15 in
pdf
format.

Homework 2  DUE 3/10/15 in
pdf
format.

Homework 3  DUE 4/2/15 in
pdf
format.
The four testfiles for Homework 3 are
file 1,
file 2,
file 3,
file 4.
The first number represents the number of edges, the second the number
of vertices, and each subsequent line represents an edge between the pair
of numbered vertices.

Homework 4  DUE 4/16/15 in
pdf
format.
Test your program on our collection of
datasets for HW4.

Homework 5  DUE 5/7/15 in
pdf. Try to do the dynamic programming problems before the midterm.
Extra Credit
Interested students
may attempt the following
extra credit programming challenges from
Skiena/Revilla
for a small amount of
additional points  small enough that you should be motivated primarily
by interest and not greed.
The solutions to these problems must be submitted on
www.programmingchallenges.com.
Register for an account and join my CSE 373 extra credit class if you
are intersted.
A schedule for doing these problems that is somewhat consistant
with this course is:

week 1: 110101 3n+1

week 2: 110201 Jolly Jumpers

week 3: 110303 Common Permutation

week 4: 110401 Vito's family

week 5: 110405 Shoemakers problem

week 6: 111101 Is Bigger Smarter?

week 7: 111104 Unidirectional TSP

week 8: 110801 Little Bishops

week 9: 110901 Bicoloring

week 10: 110902 Playing with Wheels

week 11: 111006 Tourist Guide

week 12: 111105 Cutting Sticks

week 13: 110806 Garden of Eden

week 14: 111005 War

week 15: 110805 Tug of War
Objectives
The objectives for the course are

Provide a rigorous introduction to worstcase asymptotic algorithm analysis.

Develop classical graph and combinatorial algorithms for such problems as sorting, shortest paths and minimum spanning trees.

Introduce the concept of computational intractability and NP completeness.
The course will also satisfy the following
program objective:

(S6) have a solid understanding of computational theory and
foundational mathematics.
Professor
Steven S. Skiena
1417 Computer Science Building
Department of Computer Science
State University of New York at Stony Brook
Stony Brook, NY 117944400, USA
skiena@cs.sunysb.edu
6316329026
Join the
Stony Brook Computer Science Society