CSE423/823 Spring 2003
Design and Analysis of Algorithms
Archived Class
Charles Cusack
Computer Science and Engineering
University of Nebraska--Lincoln
Main
Schedule
Grading
Gradebook

Policies
College
    Policies
Advice

Notes
Programs
Tutorials

CSCI 255
MATH 132
Others

Admin

Course Information


Time 9:30-10:20am MWF
Location112 Ferguson

Instructor Chuck Cusack
E-mail cusack@cse.unl.edu
Office108 Ferguson
Phone 472-2615
Office Hours MWF 10:30-11:20PM, and by appointment

Grader Chao Chen
Office Hours Friday 1:00-3: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, linked-lists, 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.