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, Z. Grunschlag
Prerequisites: Any introductory course in computer programming. General Education Requirement: Quantitative and Deductive Reasoning (QUA).
3 points Lect: 3.

Course
Number
Call Number/
Section
Days & Times/
Location
Instructor Enrollment
Spring 2013 :: COMS W3203
COMS
3203
20958
001
MW 5:40p - 6:55p
501 NORTHWEST CORNER
D. Strickland 129 [ More Info ]
Autumn 2013 :: COMS W3203
COMS
3203
73476
001
MW 1:10p - 2:25p
TBA
J. Gross 120 / 125 [ More Info ]