Math 61, Introduction to Discrete Structures
Lecture 1, Summer Session A, 2013
Instructor: Will Conley Office: MS 6322 Office Hours: (tentatively) Tuesdays 3:304:30pm, Thursdays 1:002:00pm, also by appointment Email:
[email protected] Website: http://www.math.ucla.edu/~wconley/ Lectures: MTW 1:002:50pm, Geology 3656 Each lecture will be broken up into two 50-minute lectures, with a 10-minute break in between. Discussion Sections: T and Th 10:0010:50am or 11:0011:50am TA: Scott Garrabrant Course Website: https://ccle.ucla.edu/course/view/131A-MATH61-1 Prerequisite: Math 31A and 31B (recommended: the whole 3133 series) Text: Discrete Mathematics, Seventh Edition, by Richard Johnsonbaugh. We will cover much of the core material in chapters 1, 2, and 3, plus selected topics from chapters 6, 7, 8, 9, and/or 10, and possibly topics from chapters 11 and 12 depending on time and the wishes of the class. Grading: Your final average in this class will be computed using the following weights: Homework: 15% Midterm: 35% Final exam: 50% Homework and Quizzes: Homework will be assigned in lecture each week on Monday, and posted on the course website. It will generally be collected the following Monday in lecture, except in the last week of class. It will be graded and returned to you as soon as possible. Your score on each homework assignment will be based on a few randomly chosen problems, as well as overall completion of the assignment. Late homework will not be accepted, but your lowest homework score will be dropped. Exams: During the exams, you may not use notes, calculators, cell phones, or anything other than paper and pencil. There will be no make-ups for missed midterms. If you absolutely must miss the midterm for a legitimate, documented reason, the final exam will be reweighted to 85%, to cover both the midterm and final. You must take the final exam in order to pass the class. Make-ups for the final exam are permitted only under exceptional circumstances, as outlined in the UCLA student handbook. Please bring a photo ID to every exam. The exams are tentatively scheduled for the following dates: Midterm: Wednesday, July 10, 1:001:50pm Final exam: Wednesday, July 31, 1:003:00pm
Course Outline (Tentative)
Week Date Mon, Jun 24 1 T ue, Jun 25 W ed, Jun 26 Mon, Jul 1 2 T ue, Jul 2 W ed, Jul 3 Mon, Jul 8 3 T ue, Jul 9 W ed, Jul 10 Mon, Jul 15 4 T ue, Jul 16 W ed, Jul 17 Mon, Jul 22 5 T ue, Jul 23 W ed, Jul 24 Mon, Jul 29 6 T ue, Jul 30 W ed, Jul 31 # 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 Sections 1.1 1.1 1.2 1.2, 1.3 2.1 Review 2.2 2.4 3.3 3.4 3.1 Review N/A N/A 6.1 6.2 Exam 6.3 6.7 6.8 8.1 8.2, 8.3 8.4 Review 8.5 8.6 8.7 9.1 9.2 Review 9.3, 9.4 9.5 7.3, 9.7 9.8 Exam Representation of graphs Isomorphisms of graphs Planar graphs Examples of trees More trees Minimal spanning trees Binary trees Decision trees, sorting (including merge sort from 7.3) Isomorphic trees Final exam (1:00-3:00pm) Proof techniques: Proofs by contrapositive, contradiction, cases, proving logical equivalences, etc Proof techniques: Mathematical induction Relations on sets Equivalence relations and quotients Functions Injectivity, surjectivity, bijectivity Cardinality of sets ("levels" of in nity, countable vs. uncountable, etc) Basic counting principles Permutations and combinations Midterm (Covers the material before chapter 6) Generalized permutations and combinations Binomial coe cients Pigeonhole principle Examples of graphs Paths and cycles Shortest-path algorithm T opics Basic set theory More basic set theory Logic: Propositions, conjunction, disjunction, conditionals Logic: T ruth tables, quanti ers Proof techniques: Direct proof, counterexamples
