COT 3100 Computational Structures (a.k.a. Discrete Math) 

Instructor: Chip Klostermeyer 	e-mail: wkloster@unf.edu
URL: http://www.unf.edu/~wkloster
Office: 15/3224 		
Phone: 620-2985
Office Hours: TR 2:00-4:30 (you are welcome to drop by my 
office at any time the door is open or make an appointment)

Text (suggested): Discrete Mathematics and its Applications by Rosen

Due to publishers frequent edition changes in order to destroy the 
used book market, I will not adhere to any one text. You may buy the text 
above or another text. You can also use on-line sets of notes posted 
on the web site.

I have posted a .pdf file with problems that you will work
and that will be discussed in class. Do these problems!!!
  
Overview: Discrete Mathematics (sometimes more generally called combinatorics)
provides the mathematical foundations for much of computer science. It is 
used in modeling various real-world structures (e.g., the topology of a 
computer network) and in studying the behavior and correctness of computer 
programs (algorithms). Discrete math also happens to be beautiful and fun!

Goals: To become versed in the language of (discrete) mathematics (sets, 
functions, graphs, etc.) and it applications in computing and to develop 
mathematical maturity in these areas (i.e., learn how to prove theorems).

Evaluation: Three midterms (25% each), Final exam (25%)
         
Scale: 90%=A, 80%=B, 70%=C, 60%=D, though these may be scaled downward if 
necessary  (i.e., a score less than 90% may merit an "A'").

Honesty Statement: You are expected to do your own work. 
Any violation of academic integrity (copying, plagiarism, cheating, etc.) 
shows lack of respect for me and will be dealt with in accordance 
with university policy. 

Homework: Read the homework policy on the course web page for 
this semester's homework policy.

How to succeed in this class:

I. A study done in this course since 1999 by a colleague of mine breaks 
students into 3 categories: 
(1) those that attend all classes, do all homework, and take all exams 
(2) those that miss at least two homeworks or exams 
(3) those that are neither of the above.
On average, 60% of the students in category (2) fail and 33%
of the students in category (3) fail. 

II. Do the problems! Some homework problems can be done in 1 minute or 
less, some may take 10 minutes, and some 30 minutes or more. Be prepared 
to spend time thinking about and struggling with the problems.

Outline (approximate time schedule)
Foundations (Logic, Sets, Functions)	
Integers (primes, mod, binary #'s, etc.)
Boolean Algebra, Logic Gates  
Exam 1
Methods of Proof	
Exam 2	
Graphs I
Graphs II
Exam 3
Counting 		
Advanced Counting (if time permits)
Relations and Orders (if time permits)	
Final exam will be given at scheduled time.

No incomplete grades will be given unless you satisfy the strict 
university and department policies on such, as well as the instructor's 
approval.