Syllabus for MAD2104 002 Summer, 2005

Instructor:	F. Hoffman S&E206 (561) 297-3345 hoffman@fau.edu
Text:	Mathematical Structures for Computer Science,
	Haggard, Schlipf, Whitesides, Thomson BrooksCole, 2005

Topics to be covered (subject to deletion, if pressed for time):

Chapter 1:	Sets Proof Templates, and Induction Basic Definitions Operations on Sets The Principle of Inclusion-Exclusion Mathematical Induction A Second Form of Induction
Chapter 9:	Recurrence Relations The Towers of Hanoi Problem Solving First-Order Recurrence Relations
Chapter 2:	Formal Logic Introduction to Propositional Logic Truth and Logical Truth Predicates and Quantification
Chapter 3:	Relations Definitions and Operations Special Types of Relations Equivalence Relations Ordering Relations
Chapter 4:	Functions Basic Definitions Operations on Functions The Pigeon-Hole Principle
Chapter 6:	Graph Theory Definitions Connected Graphs The Königsberg Bridge Problem Trees Spanning Trees Directed Graphs
Chapter 7:	Counting and Combinatorics Counting Principles Permutations and Combinations Permutations and Combinations with Repetitions Combinatorial Identities

Schedule:
	May 16:	Class begins; held MWF, 9:15-10:20am in ED113
	May 27:	Quiz
	May 30:	Holiday; no class
	June 6:	Test on Chapters 1 and 9
	June 17:	Test on Chapter 2
	July 4:	Holiday; no class
	July 11:	Test on Chapters 3 and 4
	July 22:	Test on Chapter 6
	Aug 5:	Final Examination, Part 1 (in ED123, open 8am-noon)
	Aug 8:	Final Examination, Part 2 (Students who are free either before or after our class may take both parts of the examination on August 5, and are advised to do so.)

Additional quizzes or take-home assignments may be added. The basic grade will be the average of the four tests and the two parts of the final, counted equally. Other assignments and quizzes will only be used to increase students’ grades.

Scale: A:90; A:-87; B+:83; B:80; B-:77; C+:73; C:70; C-:65; D:60

The instructor likes the textbook, but there are mistakes in it. These will be pointed out in class, whenever possible. The book has a CD with solutions to odd-numbered problems. The instructor will supply solutions for a small number of even-numbered problems.

For many students, this is the first course in which proofs are studied and required. This may be somewhat scary to begin with. Get over it! Almost all of you can learn what you have to about proofs, if you work at it. The material we cover will be useful to you in future courses in mathematics and in computer science and many fields of engineering. It is even possible to enjoy it. Let’s try!