CS 201. Data Structures and Discrete Mathematics I. 4 hours.
Lists, stacks, queues, sets, hash tables, introduction to trees and graphs. Algorithm correctness and complexity, inductive proofs, logic. Programming projects. Course Information: Previously listed as EECS 260. Credit is not given for CS 201 if the student has credit for MCS 261. Prerequisite(s): MATH 180; and grade of C or better in CS 102 or grade of C or better in CS 107.