Discrete Mathematics

IAI M1 905, IAI CS 915

3 Credit Hours (3/0 lecture/lab)

Online ANYTIME

Spring 2021

Harper College

- SECTION
Class will meet:

Section Time Days Room W01 It's online, silly. Just email me and I'll respond during my office hours! from Jan 19

^{th}to May 21^{st}.- FINAL TIME
Sections 001 & 002 will have their final during the first four (4) days of Finals Week — May 17-May 20.

- PREREQUISITES
MTH 103 (college algebra) with a grade of a C or better

OR

other placement options as listed here.- TEXT
Discrete Mathematics with Proof; Gossett; Wiley; 2

^{nd}EditionThe author has many web resources available which you may find useful during the semester.

- OTHER MATERIALS

(you might find useful) Discrete Mathematics and Its Applications, Rosen, McGraw Hill

- OBJECTIVE
Introduces analysis of finite collections and mathematical foundations of sequential machines, computer system design, data structures, and algorithms. Includes sets and logic, subscripts, arrays, number systems, counting, recursion, graph theory, trees, networks, and Boolean algebra.

- STUDENT OUTCOMES (The student should...)
- illustrate the basic concepts of sets, relations and functions.
- use mathematical logic and Boolean algebra.
- apply combinations, permutations, and the pigeonhole principle.
- solve simple graph problems.
- explain the algorithms for traversing trees.
- illustrate the concepts of languages and finite-state machines.

- EVALUATION
Activity Percent Tests 65 % Final 25 % In Class Activities 10 % Total 100 % Grade Percentage A 90 - B 80 - 90 C 70 - 80 D 60 - 70 F 0 - 60 - EXAMS
Tests consist (most often) of multiple choice, word problems, graphing/interpretation, solving equations, proofs, etc. Tests may also contain thought/discussion problems.

*All*problems are based on*similar homework*problems from that test's chapter(s). (But not necessarily homework 'set' problems...)Make-up exams (with reasonable excuse — see participation), will be

**ALL**essays, proofs, and/or word problems.The final is cumulative. That is, it will contain problems from through-out the

**entire**semester.Grading of all exams is based on correctness of work

. (If you do scratch work, don't erase it! And if you do scratch work on a separate sheet, label it with the problem number...)*SHOWN*- ASSIGNMENTS
Types of Assignments Timing of Assignments Grading of Assignments Handing in Assignments Homework sets The homework set for a chapter is for you to do to prepare for each exam. Do it at your own pace, but I'd recommend you do the problems at least twice a week — after each lecture. Again, I won't be grading the homework sets as they are for your own benefit. Don't hand in your homework sets. They are completely for your own benefit. Quizzes and Group Activities Each class period there may be one or the other. All in-class activities can be conducted at *any time*during the class period. Quizzes take about 10 minutes and you are given about 25 minutes for group activities.Grading is based on correctness and completeness. (Since you are doing these as a group during class, I am more lenient about thoroughness.) I only need a single copy from each group. (If you disagree with your group partners, you may hand in your own work separately.) Make sure the names of **all**group members is on the first sheet (along with course/section and chapter/section). Staple multiple pages together (if possible). If I can't read it, it doesn't count.Extra Credit You can hand in extra credit at *any time*— but**you must**mark it*clearly*as extra credit.Extra credit based on homework sets is graded based on completeness and thoroughness. Extra credit based on summary papers is graded on completeness, thoroughness, *and*correctness.Make sure you place your name, course, and section *at least*on the first sheet. Label each section of each chapter as such. Start new sections on a new page (the back of the sheet is a new page).**Staple**all sheets of a chapter together —**in order**. (No, you can**not**leave it in your notebook. My back cannot carry ~60 notebooks around!) If I can't read it, it doesn't count.- LATE POLICY
Due dates are present for a reason. If you do not turn in an assignment

**by the due date**given, credit will be**denied**. (Reasonable excuses*may*be accepted so that credit will merely be*reduced*.)- TENTATIVE OUTLINE
Week(s) Chapter Sections Topics 0 Chapter 1.1-3 Background and Overview 0 Appendix A Number Systems 0 Appendix F The Greek Alphabet 0 Appendix G and/or Author's Site Writing Mathematics End Preparatory Materials 1 Appendix B Summation Notation 1, 2 Chapter 2.1-6 Sets, Logic, and Boolean Algebras 3, 4 Chapter 3.1-6 Proof Exam 1 5 Chapter 4.1-2,4 Algorithms 6, 7 Chapter 5.1-3 Counting Exam 2 8 Appendix D The Golden Ratio 8, 9 Chapter 7.1-3,5 Recursion, et. al. Exam 3 10 Appendix E Matrices 10, 11, 12 Chapter 10.1-6 Graphs 13, 14 Chapter 11.1-2, 4 Trees 14 Chapter 12.1-2,3.1 Functions, Relations, Databases, and Circuits Exam 4 15 Chapter 6.1-6 Finite Probability Theory 16 Chapter 7.4 Generating Functions 16 Chapter 8.1 Introductory Combinatorics Exam 5 16 Chapter 9.4 Formal Models in Computer Science I will try to keep the week-to-week schedule up to date with notices during class. Watch for them (

*and remind me if I forget...*)!