TWiki> CS201 Web>WebHome (revision 6)EditAttach

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. 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.

Fall 2014


Edit | Attach | Print version | History: r7 < r6 < r5 < r4 < r3 | Backlinks | Raw View | Raw edit | More topic actions...
Topic revision: r6 - 2014-08-25 - 01:35:42 - Main.troy
Copyright 2016 The Board of Trustees
of the University of
Helping Women Faculty Advance
Funded by NSF