CS 113 MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE - FALL 2012

PROFESSOR
Dr. Constantine Coutras
Office: 163 William Street, 2nd Floor, Office 240
Phone number: (212) 346-1006
e-mail: ccoutras@pace.edu
Office Hours: Tuesdays 10:00 - 11:15 and 1:45 - 4:15 and Thursdays 10:00 - 11:15

DESCRIPTION
This course covers the basic mathematical topics mainly for computer science major students. The topics include boolean algebra, propositional logic, predicate logic, relations, functions, set theory, counting, probability, combinatorics, proof methods, induction, recursion, number theory, and graph theory.
Boolean algebra is essential in designing digital circuits.
Logic is fundalmental in artificial intelligence such as theorem proving and in database queries.
Relations and set theory play important roles mainly in the relational database systems.
Recursive relation and induction are important in defining problems, designing recursive algorithms, and proving the correctness of algorithms.
Number theory leads to cryptography and more.
Probability and combinatorics are crucial in analysis of algorithms.
Graph theory is directly related to computer networks and many applications.

PREREQUISITES
None.

REQUIRED TEXT
Discrete Mathematics with Applications, 4th Edition by Susanna S. Epp, ISBN-10: 0495391328, ISBN-13: 978-0495391326

GRADING
Attendance 10%
Homeworks 30% (Late Homework is not accepted)
Midterm Exam 30%
Final Exam 30%

TENTATIVE SCHEDULE
09/06 Chapter 1 Speaking Mathematically
09/11, 09/13 Chapter 2 The Logic of Compound Statements
09/18, 09/20 Chapter 3 The Logic of Quantified Statements
09/25, 09/27, 10/02 Chapter 4 Elementary Number Theory and Methods of Proof
10/04, 10/09, 10/11 Chapter 5 Sequences, Mathematical Induction, and Recursion
10/16, 10/18, 10/23 Chapter 6 Set Theory
10/25 Midterm Exam
10/30, 11/01 Chapter 7 Functions
11/08, 11/13 Chapter 8 Relations
11/15, 11/20 Chapter 9 Counting and Probability
11/27, 11/29, 12/04, 12/06, 12/11 Chapter 10 Graphs and Trees
12/13 Study Day
12/18 Final Exam