# Honors Introduction to Discrete Structures

## COT 3100H

**Term:** Spring 2007

**Time:** Tues Thurs 1:30pm - 2:45pm

**Location:** ENGR 0227

**Instructor:** Dr. Pawel Wocjan

**Office hours:** Tues Thurs 3:00pm - 4:15pm, HC 339

**Teaching Assistant:** Chen-Fu Chiang

**Office hours:** TBA

## Final Exam + Grade

Please go and see Chen-Fu Chiang on 05/01 (Tuesday) at 1:00pm - 3:00pm in 354 HC (Parallel and Quantum Computing Lab) to get your
graded exam and your final grade.

**Lecture Notes:**

The lectures notes, and other material used during the semester such as
the assignments, exams, their solution keys, will be available and
updated on the web at http://www.eecs.ucf.edu/~wocjan/Teaching/COT3100H-Spring2007/LectureNotes.html

**Text:**

R.P. Grimaldi, *Discrete and Combinatorial Mathematics. An Applied Introduction*, 5th edition, Pearson Addison-Wesley, 2004

## Course Objectives:

This course provides an introduction to discrete mathematics that is relevant to future computer science courses:
- Logic
- Set Theory
- Proof Methods
- Principles of Counting
- Basic Number Theory: Properties of Integers; Mathematical Induction
- Functions and Relations
- ... let's see how much time is left

**Grading Policy:**

Homework Assignments: 25%

First Midterm Exam: 25%

Second Midterm Exam: 25%

Final Exam (see University's Final Exam Schedule): 25%

Grades A, B, C, D, and F are based on the straight-percentage scale (that is, 90% or above is A, 80% to 89.99% is B, etc.)

**Academic Integrity and Student Conduct:**

Please read and understand student rights and
responsibilities including conduct rules clearly stated in UCF’s golden rules, at http://www.goldenrule.sdes.ucf.edu/2e_Rules.html

**Note:**

All work (homework assignments and exams) represent individual effort; no late homework and make-up tests will be accepted
except for exceptional situations (handeled individually); all exams are closed books, closed notes, and no calculators