Faculty Syllabus

12 Homework assignments – average will be 70% of your grade

3 Exams – average will be 30% of your grade

An overall grade will be assigned based on the following scale:

90% - 100% A 89% - 80% B 79% - 70% C 69% - 60% D 0% - 59% F

Do NOT buy the textbook materials access until you receive detailed instructions from your instructor!

Discrete Math with Applications, Susanna Epp, 5th Edition, Cengage Learning, 2020.

A focus on discrete mathematical tools for the working computer scientist. An emphasis is placed on using logical notation to express rigorous mathematical arguments. Subjects may include introduction to graph theory, recurrences, sets, functions, and an introduction to program correctness.

This course is designed to provide students in the BAS Software Development program with a methodology for solving problems utilizing modern computing devices. This course includes both an overview of Computational Thinking tools (Abstraction, Decomposition, Pattern Recognition, and Algorithm Design) and an Introduction to the Discrete Mathematical topics of Logic, Proof, Sets, Functions, Relations, Counting, and Graphs.

1. Utilize Computational Thinking tools such as Abstraction, Decomposition, Pattern Recognition, and Algorithmic Design to formulate problems, automate solution procedures, and analyze results

2. Make use of Logical Statements and associated operators to express mathematical concepts and relationships related to problem solving

3. Construct proofs of assertions by choosing appropriate techniques from your proof toolset

4. Apply correct mathematical terminology and notation to formulate problems

5. Model sequences as recurrence relations

6. Distinguish between and work with the definitions and properties of Sets, Functions, and Relations

7. Formulate and Solve problems using probability and counting techniques

8. Demonstrate an understanding of Graphs and related topics (edges, vertices, walks, trails, paths, and circuits)

3