CS 6003 Foundations of Computer Science

Fall 2010 Robert J. Flynn

Cheating is not allowed and can most likely result in a grade of F

The purpose of CS 6003 is to provide the mathematical context of computer science. Its goal is the easy expression of relationships among the entities that computer science creates. Examples include the rigorous analysis of the complexity (work required) of competing sorting algorithms, the development of asymptotic notation, the use of probability to construct tools (e.g. a baysian spam mail filter), the use of trees and directed graphs to understand interconnections and many other items.

The book (Rosen, Discrete Mathematics and its Applications, McGraw Hill (sixth edition)) is well written and will be used as the text. Essentially the material covered will be chapters 1 through 6 and sections of Chapter 8 and 9. The order in which the material is covered will differ from the book in that we will look to develop material in order to answer a specific question. (e.g. instead of covering all of probability, material may be added or dropped to get us to spam filter quicker).

To prepare for the course, please read Chapter 1 and 2.

The course will have 2 exams, a mid term and final. Home work will be assigned and usually covered in class as a part of the ordinary recitation

A student can use earlier editions of the book (Mathematics does not change; books do) If using earlier editions, you will have to check to make sure that homework problems are the same as in the 6th edition, which I will use to prepare lectures. The publisher has a lot of material to supplement the text and is available for students.

Robert J Flynn

[email protected] cell is 917 583 7791 office phone is 914 323 2002 or 718 260 4002

I will be in my office every week at least 2 hours before class and many other times. Call for an appointment or come early to class