COURSE NUMBER AND TITLE: COT 3100 Applications of Discrete Structures

OVERVIEW:  This course covers the mathematics of discrete events, 
i.e. events that involve distinct elements, finite structures of 
distinct elements, or finite sampled versions of continuous phenomena 
(such as movement).

PREREQUISITES: MAC 2311, MAC 2233, or MAC 3472.

TEXTBOOK: Kenneth H. Rosen, Discrete Mathematics and Its Applications. 
6th edition, McGraw-Hill, 2006.

MEETING TIME: Monday, Wednesday and Friday 5th period (11:45 - 12:35).

MEETING PLACE: Turlington 005.

LEARNING OBJECTIVES
1. Mathematical Reasoning: The ability to read, comprehend, and
construct valid mathematical arguments (proofs). Mathematical
induction will be stressed. 
2. Combinatorial Analysis: Methods of counting or enumerating
objects. 
3. Discrete Structures: Abstract mathematical structures used to
represent discrete objects and relationships between these
objects. These structures include sets, relations, graphs, trees. All
course activities are designed to serve these objectives.  

TENTATIVE LIST OF TOPICS:
   1. Logic and intro to proofs  
   2. Algorithms 
   3. Integers, including encryption  
   4. More advanced proof methods, including induction  
   5. Counting 
   6. Relations  
   7. Graphs 
   8. Trees  

GRADING will be based on homeworks, (frequent) quizzes and two exams
(a midterm and a final). Details on this will be given in the
syllabus.