Skip to end of metadata
Go to start of metadata

You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 3 Current »

This course continues the topics covered in CS 345 with data structures such as trees and other graphs. An introduction to basic algorithm analysis and design techniques, including divide-and-conquer and greedy algorithms. Prerequisite: CS 345 and MATH 170. (Spring 2023)

Offered in alternate years

  • No labels