 Course Information

Time 
9:3010:20am MWF 
Location  112 Ferguson 

Instructor 
Chuck Cusack 
Email  cusack@cse.unl.edu 
Office  108 Ferguson 
Phone  4722615 
Office Hours  MWF 10:3011:20PM,
and by appointment 

Grader  Chao Chen 
Office Hours  Friday 1:003:00pm, Ferguson 17 

Textbooks/ Resources 
The textbook for the course is:
In addition, you may find the following useful.


423 vs. 823 
Students enrolled for 823 will do more problems
than those enrolled for 423.
Also, the grading scales (the curve) may be different.


Coverage 
Tentatively, we will cover parts or all of the following chapters from the textbook:
7.4, 9, 15, 16, 17, 24, 25, 26, 34, 35. This list is subject to change.
Consult the schedule on a regular basis for actual topic coverage.


Prerequisites 
If you did not take and receive at least a C in CS310, you should
drop this course. In particular, I assume you have an understanding
of and ability to program

Basic data structures,
including stacks, queues, linkedlists, hash tables,
binary search trees, trees and graphs.

Sorting algorithms, including selection, insertion, quick, merge,
and radix.

Basic graph algorihtms including BFS, DFS, and MST.

Basic greedy and dynamic programming algorithms.
In addition, I assume you have some familiarity with theoretic and empirical
complexity analysis, including asympotic notation and
solving summations and recurrences.




