## Syllabus Sections

## Publish Date

01/18/2012 15:04:03

## Discrete Mathematics

MATH-2405

**Spring 2012**

01/17/2012 - 05/13/2012

## Course Information

**Section 001**

*Lecture*

TTh 12:50 - 14:35

RGC1 341

Anthony Vance

## Office Hours

No office hours have been entered for this term

## Course Requirements

**Your grade will be based on the following. Please note that dates are tentative, and may be changed as needed.**

Test 1 - chapters 2 and 3 - Tuesday, February 14

Test 2 - Chapters 4 and 5 - Tuesday, March 27

Test 3 - Chapters 6, 7, 11 and 8 - Testing Center deadline Monday, April 23

Test 4 - Chapters 9 and 10 - Thursday, May 10

Homework: assigned in class, due on dates announced in class.

## Readings

**The Required Text:**

*Discrete Mathematics with Applications*, 4th edition, by Susanna S. Epp, Thomson (Brooks/Cole), 2011, ISBN 0-495-39132-8

We will discuss sections 1.1-1.3, 2.1-2.4, 3.1-3.4, 4.1-4.4, 4.6, 4.7, 5.1-5.3, 5.6, 5.7, 6.1, 6.2, 7.1, 7.2, 11.1, 11.2, 8.1-8.3, 9.1-9.5, 9.7-9.9, 10.1 and 10.2

## Course Subjects

**The official ACC math department course description:**

A course designed to prepare math, computer science and engineering majors for a background in abstraction, notation and critical thinking for the mathematics most directly related to computer science. Topics include: logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, graph theory, combinatorics, discrete probability, recursion, recurrence relations, elementary number theory and graph theory.

**Our TENTATIVE weekly schedule (subject to change):**

Week 1: Introduction to mathematical notation and start logic (Chapter 1, start Chapter 2).

Weeks 2 and 3: More on logic (finish Chapter 2, start Chapter 3).

Week 4: Finish logic, start elementary number theory (finish Chapter 3, start Chapter 4).

Week 5: Test 1, more elementary number theory (more Chapter 4).

Week 6: More elementary number theory (more Chapter 4).

Week 7: Finish elementary number theory, sequences (finish Chapter 4, start Chapter 5).

Week 8: Mathematical induction, recursion (more Chapter 5).

Week 9: Recursion, start elementary set theory (finish Chapter 5, start Chapter 6).

Week 10: Test 2, more elementary set theory, start functions (finish Chapter 6, start Chapter 7).

Week 11: More on functions (finish Chapter 7, start Chapter 11).

Week 12: More on functions, start relations (finish Chapter 11, start Chapter 8).

Week 13: More on relations, start counting and discrete probability (finish Chapter 8, start Chapter 9).

Week 14: Test 3 deadline, more counting and discrete probability (more Chapter 9)

Week 15: Finish counting and discrete probability, start graphs (finish Chapter 9, start Chapter 10).

Week 16 Finish graphs (finish Chapter 10), Test 4.

## Student Learning Outcomes/Learning Objectives

**The official ACC math department common course objectives:**

Upon completion of this course students should be able to do the following:

- Discuss definitions and diagram strategies for potential proofs in logical sequential order without mathematical symbols (plain English).
- Construct mathematical arguments using logical connectives and quantifiers.
- Verify the correctness of an argument using symbolic logic and truth tables.
- Construct proofs using direct proof, proof by contradiction, and proof by cases, or mathematical induction.
- Solve problems using counting techniques and combinatorics.
- Perform operations on discrete structures such as sets, functions, relations or sequences.
- Solve problems involving recurrence relations and generating functions.
- Construct functions and apply counting techniques on sets in the context of discrete probability.
- Apply algorithms and use definitions to solve problems to proof statements in elementary number theory.