Midterm 1 will be held Tuesday, March 5 in class and will cover
big oh, data structures, and sorting.
Students who's last names start from A - H should report to Library E4310.
may attempt the following
extra credit programming challenges from
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
Register for an account and join my CSE 373 extra credit class if you
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
The objectives for the course are
Provide a rigorous introduction to worst-case 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
(S6) have a solid understanding of computational theory and
Steven S. Skiena
1417 Computer Science Building
Department of Computer Science
State University of New York at Stony Brook
Stony Brook, NY 11794-4400, USA
Stony Brook Computer Science Society