A detailed study of more advanced data structures and algorithms, including
concepts and techniques of design efficiency and complexity of algorithms and
their lower bounds. Topics include search trees, hash functions, string
searching, disjoint sets, internal and external sorting, graphs and graph algorithms,
and different algorithm design techniques. Prerequisites: CS 250 and CS
301. (WSU catalog description)
Illegal collaboration on assignments, programs or tests will result in
a grade of F for the course. See the pdf files stating
the department's
Collaboration Policy defining illegal collaboration and the
Collaboration Form you must fill out for class.
Students are allowed to attempt a specific computer science class at most
three times. A student wishing to appeal this policy must follow the
process defined in the
Course Repetition Limit Appeal document.