Kent State University
CS 23022 Discrete Structures for Computer Science

Fall 2009

Mondays and Wednesdays: 5:30pm - 6:45pm Rm. MSB 115
Office Hours:  Mondays and Wednesdays ( 4:30pm - 5:30pm )

TA: Muad Abu-Ata,

TA Tutoring Hours: Tuesdays (2:00pm-4:00pm)

TA Office: 160

---------------------------------------------------------

Course Overview

This class teaches the basic principles of discrete mathematics. It stresses mathematical reasoning and the different ways problems are solved. Four important topics are interwoven in this class: logic and mathematical reasoning, combinatorial analysis, and discrete structures (relations and graphs) and algorithmic thinking.

Topics:
Propositional logic
Predicate logic
Basic Number Theory

Sets
Functions
Induction
Recursion
Counting
Relations
Graphs

Grading Policy:
Assignment: 20%

Quizzes: 30%
Middle Exam: 20%
Final Exam 30%

Late submission of assignments will not be accepted one week after the due date. For every late day, 10% of the score will be penalized, up to a maximum penalty of 50%. There will be no make-up exams and quizzes.

University policy 3342-3-18 requires that students with disabilities be provided reasonable accommodations to ensure their equal access to course content. If you have a documented disability and require accommodations, please contact the instructor at the beginning of the semester to make arrangements for necessary classroom adjustments. Please note, you must first verify your eligibility for these through Student Disability Services (contact 330-672-3391 or visit Student Disability Services for more information on registration procedures)

Lectures:

1. Introduction

2. Propositional Logic (Chapter 1, Section1.1,1.2,1.3)

3. Logic and Proofs (Chapter 1, Section 1.5, 1.6)

4. Elementary Number Theory and Methods of Proof (Chapter 3: Section 3.4, 3.5 and 3.6)

5. Sets (Chapter 2: Section 2.1 and 2.2 )

6. Functions (Chapter 2: Section 2.3) 

7. Counting (Chapter 5: Section 5.1, 5.3, 5.4, 5.5)