Course Information

Course Description

Fundamental discrete mathematics for engineering, including logic, proof techniques, sets, relations, functions, counting, recurrences, growth of functions, and discrete models of computation. The course develops mathematical tools for reasoning about algorithms, correctness, complexity, and computational systems.

Prerequisites

ECE 160 completed with a grade of C or better; ECE 260 completed with a grade of C or better; MATH 242 completed with a grade of C or better.

Learning Outcomes

By the end of the course, students will be able to:

1. Use propositional and predicate logic to express and evaluate statements and construct valid arguments.
2. Construct rigorous proofs using direct proof, contraposition, contradiction, mathematical induction, and strong induction.
3. Work with sets, functions, and relations, including equivalence relations and partial orders.
4. Apply counting techniques, including permutations, combinations, inclusion–exclusion, and the pigeonhole principle.
5. Analyze the growth of functions and the time and space complexity of algorithms using asymptotic notation.
6. Set up and solve recurrence relations, including recurrences analyzed using the Master theorem.
7. Describe basic models of computation, including formal languages, finite automata, and Turing machines.

Textbook & Resources

• Required: Kenneth H. Rosen, Discrete Mathematics and Its Applications, 8th edition, McGraw-Hill, 2019. ISBN 978-1-259-67651-2.
• Supplementary: Susanna S. Epp, Discrete Mathematics with Applications, 5th edition, 2020.
• Lecture slides, notes, homework assignments, and other course materials will be posted on the course site or course web tool.

Grading

Grade scale: A+ ≥ 95, A 90–94, B 80–89, C 70–79, D 60–69, F < 60.

Grade cutoffs may be lowered if warranted by overall class performance. They will not be raised.

Homework

• Homework assignments will be posted on the course site with the corresponding due dates.
• Submit homework through Lamakū by the stated deadline. Email and paper submissions are not accepted.
• Format: Homework must be handwritten and submitted as a single scanned PDF. Typed solutions are not accepted. Work must be legible, and each problem and part should be clearly labeled.
• Collaboration: You may discuss the meaning of a problem and general approaches with others, but your submitted solution must be written independently. Any outside sources or assistance used should be acknowledged.
• Prep Sets: A Prep Set will be provided before each exam when needed to cover examinable material not included in the preceding homework assignments. Prep Sets are not collected or graded. Selected problems will be discussed during the review session, and material covered by a Prep Set may appear on the exam.

Quizzes & In-Class Exercises

Quizzes are short, closed-book assessments given at selected points during the course.

In-class exercises are collaborative practice activities. Students may use the textbook, lecture notes, and course materials unless otherwise stated.

The lowest quiz score is dropped.

Exams

There are two midterm exams during regular class time and one comprehensive final exam.

All exams are closed-book unless otherwise announced. Collaboration during exams is not permitted.

Makeup exams are available for documented university-approved circumstances. Students should contact the instructor as soon as possible if a makeup exam is needed.

Late Work & Regrading

• Late homework submissions are not accepted. The lowest homework score is dropped.
• Regrade requests must be submitted by email within one week after graded work is returned. The request should identify the specific grading issue.
• Approved makeup work associated with an excused absence will be handled separately from the late-work policy.

Tentative Course Schedule

The schedule below may be adjusted as needed. Changes will be announced in class and posted on the course site.

The final examination is comprehensive.