CSE 373 - Analysis of Algorithms
Course Time: 3PM - 4:20PM Tuesday-Thursday
Place: on Zoom
The Zoom link is available on Piazza if you can't find it on Blackboard
Steven Skiena's office hours are 11:05AM-12:35PM Tuesday-Thursday,
on Zoom, and by appointment.
You can also catch me right after class.
The course bulletin board will be Piazza.
Sign up by clicking here.
Our graduate TAs and their special responsibilities are:
The undergraduate course assistants are listed below.
Their office hours will be in the undergrad TA rooms 2203 and 2217 Old Computer Science.
The undergraduate TAs will have one review session each week on Zoom (two before midterms).
The schedule is:
Course Syllabus and lecture schedule
Daily Homework Problems in
A list of hard problems suitable to challenge me on.
Homework 1 - DUE 9/17/20 in
Homework 2 - DUE 10/1/20 in
Midterm 1 will be held Thursday, September 24 and will cover
big oh, data structures, and sorting.
I have posted a copy of a prior year's Midterm 1 to
help you study.
Note: we will not provide an answer key, especially for the multiple choice
problems, to encourage you to work them out on your own.
Homework 3 - DUE 10/20/20 in
The four testfiles for Homework 3 are
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 11/3/20 in
Test your program on our collection of
datasets for HW4.
Homework 5 - DUE 12/3/20 in
pdf. Try to do the dynamic programming problems before the midterm.
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.
You can submit these problems through
the UVA Online Judge.
I have given the corresponding UVA Judge number for each problem in parentheses.
A schedule for doing these problems that is somewhat consistant
with this course is:
Send me all your work at the end of the semester to receive credit.
Read about the CS accreditation ABET program.
The ABET 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
251 New 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