DISCRETE MATHEMATICS - INTRO-COMBINATORICS/GRAPH THRY

Section

Professor

Jonathan Gross

Course Information

Prerequisite: any introductory course in computer programming. Mathematical induction, counting arguments (permutations and combinations, elementary finite probability, generating functions, recurrence relations, inclusion-exclusion principle), and topics in graph theory (isomorphism, planarity, circuits, trees, and directed graphs).

Department: Computer Science(COMS)

Subject: Computer Science(COMS)

School: School of the Arts, Barnard College, Columbia College, School of General Studies, Graduate School of Arts and Sciences, School of International and Public Affairs, Continuing Education and Special Programs

Division: Interfaculty

Course ID: 3203