This is a sample syllabus only. Ask your instructor for the official syllabus for your course.

Instructor:

Office:

Office hours:

Phone:

Email:

Logic and sets, functions and relations, Boolean algebra and circuit design, mathematical induction, recursion, modular arithmetic and elementary number theory, counting techniques and combinatorics, big-O notation and complexity of algorithms, graphs and trees; with applications to computers and computer programming.

MAT 281 meets for three hours of lecture per week.

MAT 153, and CSC 121 or MAT 241 or CSC 111 or equivalent with grades C or better.

MAT 281 provides mathematical foundations for various topics in discrete mathematics including those necessary for core computer science courses. Upon completing MAT 281 the student should be able to

- construct and understand rigorous logical arguments and inferences
- construct and understand proofs by mathematical induction
- understand and use permutations, combinations, binomial coefficients, the pigeonhole principle, in algorithms, counting arguments, and proofs
- use "big-oh" and "big-omega" notation
- analyze the complexity of simple algorithms
- understand basic concepts and algorithms of graph theory
- understand combinatorial circuits and their properties; Boolean functions, and synthesis of circuits.

Students should be able to demonstrate through written assignments, tests, and/or oral presentations, that they have achieved the objectives of MAT 281.

Evaluations are based on homework, class participation, short tests and scheduled examinations covering students' understanding of topics covered in MAT 281.

*Discrete Structures with Contemporary Applications*, by A. Stanoyevitch. Chapman & Hall (2011)

Based on a 15 week course.

Week | Topics |
---|---|

1-2 | Logic and sets. |

3-4 | Functions and relations, equivalence relations |

5-6 | Mathematical induction and recursion |

7-8 | Modular arithmetic and elementary number theory |

9-10 | Counting techniques and combinatorics |

11-12 | Big-O notation and the complexity of algorityms |

13-14 | Graphs and trees |

15 | Boolean algebra and circuit design |

Students' grades are based on homework, class participation, short tests, and scheduled examinations covering students' understanding of the topics covered in MAT 281. The instructor determines the relative weights of these factors.

Attendance policy is set by the instructor.

Due dates and policy regarding make-up work are set by the instructor.

The instructor sets all test dates except the date of the final exam. The final exam is given at the date and time announced in the Schedule of Classes.

The mathematics department does not tolerate cheating. Students who have questions or concerns about academic integrity should ask their professors or the counselors in the Student Development Office, or refer to the University Catalog for more information. (Look in the index under "academic integrity".)

Cal State Dominguez Hills adheres to all applicable federal, state, and local laws, regulations, and guidelines with respect to providing reasonable accommodations for students with temporary and permanent disabilities. If you have a disability that may adversely affect your work in this class, I encourage you to register with Disabled Student Services (DSS) and to talk with me about how I can best help you. All disclosures of disabilities will be kept strictly confidential. Please note: no accommodation may be made until you register with the DSS in WH B250. For information call (310) 243-3660 or to use telecommunications Device for the Deaf, call (310) 243-2028.

Revision history:

Revised by A. Stanoyevitch, spring 2011.