Barnard College

COMS W 3203x and y Discrete Mathematics: Introduction to Combinatorics and Graph Theory

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). - J. Gross
Prerequisites: any introductory course in computer programming. BC: Fulfillment of General Education Requirement: Quantitative and Deductive Reasoning (QUA)..
3 points

Course
Number
Call Number/
Section
Days & Times/
Location
Instructor Enrollment
Autumn 2014 :: COMS W3203
COMS
3203
70547
001
TuTh 5:40p - 6:55p
501 NORTHWEST CORNER
D. Strickland 161 / 150 [ More Info ]
Spring 2015 :: COMS W3203
COMS
3203
20156
001
MW 11:40a - 12:55p
TBA
I. Vovsha 190 / 190 [ More Info ]