|
NOTE: Course information changes frequently. Please re-visit these pages periodically for the most recent and up-to-date information. | |
Spring 2013 Computer Science W3203 section 001 DISCRETE MATHEMATICS COMBINATORICS/GRAPH THEORY | |
| Call Number | 20958 |
| Day & Time Location |
MW 5:40pm-6:55pm 501 NORTHWEST CO |
| Points | 3 |
| Approvals Required | None |
| Instructor | Dawn M Strickland |
| Type | LECTURE |
| Course Description | Prerequisites: Any introductory course in computer programming. Logic and formal proofs, sequences and summation, mathematical induction, binomial coefficients, elements of finite probability, recurrence relations, equivalence relations and partial orderings, and topics in graph theory (including isomorphism, traversability, planarity, and colorings). |
| Web Site | CourseWorks |
| Department | Computer Science |
| Enrollment | 129 students as of 11:44PM Tuesday, May 21, 2013 |
| Final Exam Day/Time | May 15 W 4:10pm-7:00pm |
| Final Location | 501 NORTHWEST CO |
| Subject | Computer Science |
| Number | W3203 |
| Section | 001 |
| Division | Interfaculty |
| Open To | Columbia College, Engineering and Applied Science, General Studies, School of Continuing Education, Graduate School of Arts and Science, School of the Arts, International and Public Affairs, Barnard, Engineering and Applied Science: Graduate |
| Campus | Morningside |
| Section key | 20131COMS3203W001 |
Home About This Directory Online Bulletins ColumbiaWeb | |