MA2201/CS2022 Syllabus

This course provides an introduction to the mathematical structures of computer science. Discrete mathematics includes topics on set theory, logic, proofs, relations, functions, orders of growth, induction, recursion, and graphs.

This course is recommmended background for: CS2223, CS3133, CS3431, ECE3801 and most of upper-level mathematics.

1. Analyze logic propositions and predicates

2. Comprehend and produce proofs

3. Interpret set operations and functions

4. Compute complexity of algorithms

5. Interpret and create proofs

6. Expand and construct recursive definitions

7. Count

8. Produce and solve recurrence relations

9. Divide and Conquer

10. Represent relations

11. Use and describe graphs

From Michael P. Frank:

1. Check validity of simple logical arguments (proofs).
2. Check the correctness of simple algorithms.
3. Creatively construct simple instances of valid logical arguments and correct algorithms.
4. Describe the definitions and properties of a variety of specific types of discrete structures.
5. Correctly read, represent and analyze various types of discrete structures using standard notations

Week 1 (3/14 - 3/17) Module 1: Logic and Proofs (Read 1.1 - 1.5)

Week 2 (3/20 - 3/24) Module 1, Sets and Functions (Read 1.6-1.8)

Tuesday, 3/21: Homework 1 Due

Week 3 (3/27 - 3/31) Module 2: Algorithms and Integers (Read 2.1 -2.3) & Module 3: Mathematical Reasoning (Read 3.1-3.3)

Tuesday, 3/28: Homework 2 Due

Week 4 (4/3 - 4/7) Review & Module 4: Counting (Read 4.1-4.3)
Monday, 4/3: Review
Tuesday, 4/4: Test #1


Week 5 (4/10 - 4/14) Module 4 Counting & Probability (Read 4.1 - 4.3 and 5.1)
Tuesday: 4/11: Homework 3 Due

Week 6 (4/17 - 4/21) Module 5: Relations (Read 7.1-7.5)

Thursday, 4/20: Homework 4 Due

Week 7 (4/24 - 4/28) Module 6: Graphs (Read 8.1-8.2)
Tuesday, 4/25: Homework 5 Due

Week 8 (5/1 - 5/2) Review
Monday, 5/1: Review Homework 6 Due, Review and course evaluations

Tuesday, 5/2: Test #2

HONESTY POLICY
Homework: May be done in groups or individually. Submit with this form.

If any part of a submitted assignment is not your own or your group's own work (it should be!), the source or collaborator must be clearly identified. Failure to identify non-original work is consided academic dishonesty.

Please see WPI's Honesty Policy for information on both your rights and what happens if you are accused of cheating.