CMPS/MATH 2170 Discrete Mathematics
Fall 14

[ Home | Policies | Schedule | Slides, pictures | Homework | Resources ]

Home

Class Description:

This course is an introduction to several areas of mathematics that are particularly useful in computer science. The topics include an introduction to predicate and propositional logic, mathematical induction, combinatorics and counting, and discrete probability theory.

Course contents:

Propositional and predicate logic
Mathematical Induction and Recursion
Combinatorics: counting, permutations and combinations
Discrete Probability

Class webpage:

http://www.cs.tulane.edu/~carola/teaching/cmps2170/fall14

Time & Place:

Lectures: MWF 2pm - 2:50pm, ST 302
Lab: R 2pm - 3:15pm, GI 325

Textbooks:

Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7th edition, McGraw-Hill, 2012.
Online resources for this book (additional exercises with solutions, links to resources on the web, etc.)
Older editions of the book contain most of the covered material, but not all. Students are responsible for identifying the differences.

Instructor:

Carola Wenk
Stanley Thomas, 303F
E-mail: cwenk -at- tulane -dot- edu
Phone: 504-865-5805
Office hours: T 2pm-3pm, W 3pm-4pm, and by appointment

Teaching Assistant:

Ellis Fenske
E-mail: efenske -at- tulane -dot- edu
Office hours: MW 1pm-2pm, ST 309, and by appointment

Last modified by Carola Wenk, cwenk -at- tulane -dot- edu,