Discrete Mathematics I (Matematika Diskret I) - Term 1, 2011/2012

Description This course introduces the subject of discrete mathematics which provides theoretical foundations for more advance studies as well as brief overview of its applications in computer science. This course covers introduction to classical logics (propositional and first-order predicate logic), proof and reasoning methods, sets, functions, sequences, summations, mathematical inductions and combinatorial analysis. Terminal Learning Objectives At the end of this course: 1. Students are able to understand and analyze a given mathematical proof or argument, as well as to construct a mathematical proof or argument that solves a given mathematical problem in a correct, rigorous and systematic way. 2. Students are able to work on and solve a given mathematical problem using discrete structures introduced in this course, such as sets, functions, sequences, summations, etc.. 3. Students are able to count or numerate objects. Prerequisite: None. Status: Mandatory for students in computer science and information system study programs. Given at semester: 1 Credits: 3 Recommended reference: Kenneth H. Rosen. Discrete Mathematics and Its Applications, 6th Ed. McGraw-Hill, International edition, 2007. Lecturer: Prof. Belawati H. Widjaja, Ph.D. (bela@cs.ui.ac.id) Bayu Distiawan Trisedya, M.Kom. (b.distiawan@cs.ui.ac.id) Alhadi Bustamam Ph.D.(alhadi@ui.ac.id) Marking scheme: Tugas & Quiz: 10% Nilai Ujian Tertinggi: 35% Nilai Ujian Terendah: 25% Nilai Ujian Lain: 30% Course Plan Date (1) 12 16 Sept 2011 Topics Propositional logic Proposition Logical operators Truth tables Expressing statements using logical expressions Logical equivalences de Morgan laws Logic Puzzle First-order predicate logic Predicates Quantifiers Logical equivalence involving quantifiers The order of quantifiers Assignment

(2) 19 23 Sept 2011 (3) 26 30 Sept 2011

Homework on Propositional Logic

(4) 3 7 Oct 2011 (5) 10 14 Oct 2011

(6) 17 21 Oct 2011 (7) 24 28 Oct 2011 29 Oct 2011 (8) 31 Oct 5 Nov 2011 (9) 7 12 Nov 2011

(10) 14 18 Nov 2011 (11) 21 - 25 Nov 2011 26 Nov 2011 (12) 28 Nov 2 Dec 2010 (13) 5 9 Dec 2011 (14) 12 16 Dec 2011 (15) 19 23 Dec 2011 (16) 27 30 Dec 2011 2 13 Jan 2012

First-order predicate logic Negating (nested) quantifiers Expressing statements using logical expressions with quantifiers Rules of Inference Additions, simplifications, conjunctions, modus ponens, modus tollens, hypothetical syllogism, disjuctive syllogism, resolution) Fallacies (fallacy of affirming the conclusion, fallacy of denying the hypothesis) Rules of Inference for quantified statements (instantiation, generalization) Logic puzzles Methods of Proving theorem Direct, indirect, vacuous, trivial proofs, proofs by contradiction, proof by cases, counterexamples. Test 1: Propositional Logic, Predicate Logic, Rules of Inference) Mathematical inductions Sequences and Summations Mathematical Inductions Strong inductions Set and Functions Definition of set and functions Power set, cardinality Cartesian products Set operations, set identities One-to-one and onto functions Inverse functions and compositions of functions Countability Growth of functions Combinatorial Analysis Basic counting Pigeonhole principle Test 2: Methods of Proving Theorem, Mathematical Induction, Set and Function Combinatorial Analysis Permutation of a set of distinct objects r-permutations of a set of n distinct elements Permutations with repetition Permutations of sets with indistinguishable objects Combinations Combinations with repetition Binomial Coefficients Lexicographic ordering Generating permutations and Combinations Review

Homework on First Order Predicate Logic

Homework on Rules of Inference

Homework on Methods of Proof, Mathematical Induction

Homework on Set and Functions

Homework on Combinatorial Analysis

UAS: Combinatorial Analysis