TWiki
>
CS201 Web
>
WebHome
(2014-08-25, Main.troy)
(raw view)
E
dit
A
ttach
---+!! 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 * Instructor: [[http://www.cs.uic.edu/Troy][Pat Troy]] * [[CS201F14][Semester Web Page]] %INCLUDE{Syllabus}%
E
dit
|
A
ttach
|
P
rint version
|
H
istory
: r7
<
r6
<
r5
<
r4
<
r3
|
B
acklinks
|
V
iew topic
|
Ra
w
edit
|
M
ore topic actions
Topic revision: r7 - 2014-08-25 - 13:34:03 - Main.troy
CS201
Syllabus
Fall 14 Web Page
Lecture Notes
Homeworks
Additional Material
[edit this menu
]
Log In
CS201 Web
Create New Topic
Index
Search
Changes
Notifications
RSS Feed
Statistics
Preferences
ABOUT US
Our Department
Recent News
Contact Us
ACADEMICS
Prospective Students
Undergraduate
CS Minor
Graduate
Courses
RESEARCH
Overview
By Faculty
Labs
PEOPLE
Faculty
Adjuncts
Staff
Students
Alumni
Copyright 2016 The Board of Trustees
of the University of Illinois.
webmaster@cs.uic.edu
WISEST
Helping Women Faculty Advance
Funded by NSF