|
Oct 06, 2024
|
|
|
|
2016-2017 Undergraduate Catalog [ARCHIVED CATALOG]
|
CS 240. Algorithms and Data Structures 3.00 Students learn to implement and analyze elementary data structures and the basic complexity classes of algorithms that use strategies such as greedy algorithms, divide-and-conquer algorithms and backtracking algorithms. This analysis is especially applied to problems in searching, sorting and parsing. Prerequisites: Grades of “C-” or better in CS 227 /MATH 227 or MATH 245 , MATH 231 or equivalent, and CS 159 .
|
|