Math 10/CS10 Discrete Math Fall 2013

Instructor: Gail Edinger Office: Math Complex 59 Campus Extension: (310) 434-3972 Office Hours: Monday/Wednesday 7:30 8:00 a.m., Tuesday 11 12, Thursday 9:30 10:30 Email: edinger_gail@smc.edu **Important note: Due to problems with email from unknown senders, put the following in the subject section of all emails: Your full name Math 10. If you do not have this in the subject section I will not read your email.****** Catalog Description: This course is intended for computer science, engineering, and mathematics majors. Topics include proof techniques, cardinality of sets, partial orderings and equivalence relations, symbolic logic and valid arguments, permutations and combinations with repetition, and an introduction to graph theory. Prerequisite: Math 8 Required Text and References: Discrete Mathematics and Its Applications, 7th Edition, by Kenneth Rosen

References: Dossey, John, Albert Otto, Lawrence Spence and Charles Vanden Eynden, Discrete Mathematics, 4th Ed., Addison Wesley, 2002 Ferland, Kevin, Discrete Mathematics, Houghton Mifflin, 2009 This class will require students to read and understand significant amount of material from the textbook on their own. This includes, but is not limited to definitions, theorems and problem types. We will not have time to cover everything in every chapter in class. Exams will include material that is in the chapters, but not covered in class. A significant portion of this class is theory. You can expect to prove statements using standard proof technique and format. Homework: A list of homework problems is attached. (There may be changes as we move through the semester.) You are expected to complete the appropriate assignments after each class. We do not have time to go over homework in class, so for the most part, if you have questions, please feel free to come by office hours. You are expected to complete and understand all homework. There may be additional assignments given as handouts during the semester. Homework should be kept neatly in a notebook. The notebooks will be collected at each exam and be graded on a scale of 0, 1 or 2 points, where 0 = Homework not or minimally done 1 = Homework partially done but not complete

= Homework assignments completed.

The homework will count for 6% of your grade. The homework cannot be turned in prior to the start of each exam. It will not be accepted FOR ANY REASON at any other time, unless you have made prior arrangements to take the exam at another time (see below.) All work should be shown in homework problems. Problems where only the answers are given or answers are copied from the back of the text, will not be considered even partially done. Exams: There will be three exams in this class. Please see the attached schedule for the dates. There will be NO MAKE-UP EXAMS for any reason. If you miss one exam that grade will be replace by your grade on the final. If you miss two or more exams a grade of 0% will be recorded for those exams that cannot be made-up or replaced in any way. The 0% will count toward your final average. At the end of the semester, if you have taken all three exams and your score on the final is higher than any ONE exam, the score on the final will replace the lowest exam score. This is the only way the grades will be curved. If your final exam score is lower than all three of your exams, all three exams will count individually and the final will count for the percentage listed below. The final cannot be skipped or replaced by any grade. Grades: Grades will be assigned as follows: 90 100% = A; 80 89% = B; 70 79% = C; 60 69% = D; Below 60% = F The grades will be calculated as follows: 6% homework 64% 3 exams 30% Cumulative Final. Other than as explained in the exams section, grades will not be curved. Your grade will be assigned exactly as above and only your work during the semester will apply toward your final grade. I cannot and will not make deals, take personal situations into account (including but not limited to: transfer status, GPA, graduation status and any other personal situation you can think of). All students will be graded on the same scale. Final: There will be a cumulative final on Monday, 12/16 from 12 noon 3 p.m.. You are expected to take the final with the class. This final will not be rescheduled for convenience, travel plans or any other reason. Please note the date now and schedule yourself accordingly.

Withdrawal

Students are responsible for their enrollment status in all SMC classes. If you intend to withdraw (earn a W grade) it is entirely the responsibility of the student to handle the withdrawal by the necessary date. Please see the SMC website for all dates and deadlines. If you miss the withdrawal deadline, you will receive a grade in this class. The instructor is no longer involved in the withdrawal process, please be sure you are aware of all dates and deadlines.

Lecture 8/26 8/28 9/4 9/9 9/11

9/16 9/18 9/23 9/25 9/30 10/2 10/7 10/9 10/14 10/16 10/21 10/28 10/30 11/4 11/6 11/13 11/18 11/20 11/25 11/27 12/2 12/4 12/9

Math 10 Rosen Text *All information in this table is approximate and subject to change. Section 1.1: Propositional Logic 1.2: Applications of Propositional Logic 1.3: Propositional Equivalences 1.6: Rules of Inference (Valid Arguments) 1.7: Introduction to Proofs 1.7: Introduction to Proofs 1.8: Proof Methods and Strategy (read only) 12.1 : Boolean Functions 12.2 Representing Boolean Functions 12.3 Logic Gates 12.4 Minimization 2.1: Sets 2.2: Set Operations 2.3: Functions 2.5: Cardinality of Sets 2.5: Cardinality of Sets 5.1: Mathematical Induction 5.2: Strong Induction and Well Ordering EXAM 1 9.1: Relations and Their properties 9.4: Closures of Relations 9.5: Equivalence Relations 9.6: Partial Order Relations 6.1: The Basics of Counting 6.2: The Pigeonhole Principle 6.3: Permutations and Combinations 6.3: Permutations and Combinations 6.4: Binomial Coefficients and Identities 6.5: General Permutations and Combinations 8.5: Principle of Inclusion and Exclusion 8.6: Applications of Inclusion and Exclusion EXAM 2 10.1: Graphs and Graph Models 10.2: Graph Terminology and Special Types of Graphs 10.4: Connectivity 10.5: Euler and Hamiltonian Paths EXAM 3 8.1: Applications of Recurrence Relations 8.2: Solving Recurrence Relations Review

Homework List: 1.1: 1,3,5,9,13,17,21,25,27,31,33,35,39,41 and 15 (no part e) 1.2: 41,43 1.3: 1,3,5,6,7,9,11,13,17,21,25,27,31,41 1.6: 1, 2, 9, 11, 12, 15, 16, 19, 20, 27, 35 1.7: 1 - 11, 13 - 15, 17, 23, 25, 27, 31, 41 1.8: No assigned work 12.1: 1, 2, 5, 9, 10, 13, 19 - 21, 24, 25, 33 12.2: 1, 3, 5, 7, 11, 12, 13, 15 12.3: 1 - 5, 8, 15, 16 12.4: 1 - 9, 12 - 14 2.1: 1 - 11, 17, 19, 21, 23, 25, 32, 33, 35, 36, 37, 39, 42, 46 2.2: 1, 4, 5 - 9, 13 - 16, 18 -25, 26 - 28 (optional), 30, 36 - 38, 42, 43, 47, 48, 50, 59 2.3: 1, 2, 6, 7, 10, 11, 12, 13, 14, 16, 20 - 22, 25, 26, 28, 33 - 35, 38, 40 - 42, 44, 45, 62, 70, 80 2.5: 1, 2, 4, 5 - 8 (Optional), 10 - 12, 15 - 23, 28, 30, 34, 35, 36, 40 5.1: 3 - 11, 14 - 16, 18 - 21, 25, 28, 31, 34, 35, 36, 39, 40, 43, 45, 54, 56, 57 5.2: 1, 3, 7, 8, 11, 12, 25, 26 9.1: 1 - 7, 10-15, 18 - 21, 25, 45, 46, 47 9.4: 1 - 3, 5 - 7, 9, 10, 11, 16(?) 9.5: 1 - 3, 6, 8, 9, 15, 16, 17, 21 - 23, 26 - 28, 36, 41, 44 - 46, 61 9.6: 1, 3, 4, 9 - 11, 15, 17, 18, 22, 25, 26, 32, 33, 35, 40 (more if necessary) 6.1: 1 - 9, 16, 17, 21, 23, 25, 27-29, 32-37, 44, 46, 47, 52, 54, 55, 59, 70 6.2: 1-5, 7, 9,12,13,15,18,19,27,31,35,36,44 6.3: 1 - 3, 5a, 7 - 9, 13, 15, 18, 21, 23, 25 - 28, 31, 33, 38 - 41 6.4: 1, 4, 5, 7, 8, 20, 22, 27, 29, 33 6.5: 1, 4, 5, 8, 9, 11, 14, 15, 17, 19, 21, 22, 23, 25, 31, 32, 35, 39, 41, 42, 44, 45 8.5: 3 - 7, 10, 11, 15, 16 8.6: 1 - 6, 9, 11, 14, 15, 21, 25 8.6: 1 - 6, 9, 11, 14, 15, 21, 25 10.1: 1, 3 - 12, 15, 20, 21, 26, 27, 29 10.2: 1 - 5 , 7, 9, 12, 13, 15, 18, 19, 27, 31, 35, 36 10.4 - 10.5: TBA 8.1: 2, 3, 7, 11, 12, 14, 19, 21, 27 8.2: 1, 3, 5, 7, 9 (only through example 4)

Disclaimer: All information in this syllabus is subject to change by the instructor. Students are responsible for knowing all announced changes.
Upon completion of the course students will be able to: A. Determine whether a function between sets is injective, surjective or bijective. B. Determine whether an infinite set is countable or uncountable. C. Prove propositions using techniques including mathematical induction, contradiction and contrapositive. D. Prove logical equivalence of compound statements using truth tables and properties of conjunction, disjunction and negation. E. Translate an English argument into symbolic form using logical connectives, and determine whether or not an argument is valid, both with and without using truth tables. F. Find a disjunctive normal form for a Boolean function. G. Demonstrate the application of Boolean functions to logic circuits. H. Refine logic circuits using Karnaugh maps. I. Determine whether a relation is reflexive, symmetric, antisymmetric or transitive. J. Prove and use theorems about equivalence relations and orderings. K. Use permutations, combinations and multinomial coefficients to solve basic combinatorial problems. L. Solve combinatorial problems using the pigeonhole principle, distribution, and the principle of inclusion-exclusion. M. Verify binomial coefficient identities by combinatorial arguments. N. Solve first and second order recurrence relations. O. Prove theorems and use algorithms from graph theory related to connectedness, Eulerian graphs, and trees.

Student Learning Outcome(s):

1.

Given a theoretical or applied problem, students will be able to represent the problem and solve it using techniques such as combinatorics, graph theory, function theory and logic.

2.

Given a mathematical statement, students will be able to construct and communicate a valid argument using standard proof techniques.

Course Details
Description This course is intended for computer science, engineering and mathematics majors. Topics include sets and relations, permutations and combinations, graphs and trees, induction and Boolean algebras. Prerequisites Math 8

How It Transfers Transfer: UC, CSU IGETC AREA 2 (Mathematical Concepts)

Textbook Roman, Steven, An Introduction to Discrete Mathematics, Harcourt Brace Javanovich, Inc., 1989

Mathematics Skills Associated With This Course

Entry Level Skills Skills the instructor assumes you know prior to enrollment in this course Differentiate and integrate exponential, logarithmic, hyperbolic functions. Use various techniques of integrations and applications. Analyze infinite series (congruence and divergence). Use Power and Taylor series to express an infinite series. Recognize indeterminant forms and improper integral (using polar coordinates or parametric equations). Use analytical geometry (rotation of axes) to differentiate and integrate. Know the binomial theorem. Course Objectives Skills to be learned during this course Simplify a logic diagram. Construct the parse tree for any mathematical expression. Construct a truth table for any logical expression from the sentential calculus. Demonstrate a working knowledge of the first order predicate calculus and its notation. Create a logic diagram that corresponds to a logical formula. Compute permutations, combinations, and probabilities given a sample space. Analyze a graph of n vertices and edges using graph theory algorithms.