jadwal mat-dis-2010

8/7/2019 jadwal mat-dis-2010

1/19

discrete mathematics and its aplications - Kenneth H. Rosen

5th edition - McGraw-Hill

chapter 1 the foundations : logic and proofs, sets and functions

1.1 logic

1.2 propositional equivalences

1.3 predicates and quantifiers

1.4 nested quantifiers1.5 methods of proof

1.6 sets

1.7 set operations

1.8 functions

end of chapter material

chapter 2 the fundamentals : algorithms, the integers and matrices

2.1 algorithms

2.2 the growth of functions

2.3 complexity of algorithms

2.4 the integers and divisions

2.5 integers and algorithms2.6 applications of number theory

2.7 matrices


chapter 3 mathematical reasoning, induction, and recursion

3.1 proof strategy

3.2 sequences and summations

3.3 mathematical induction

3.4 recursive definitions and structural induction

3.5 recursive algorithms

3.6 program correctness


chapter 4 counting

4.1 the basics of counting

4.2 the pigeonhole principle

4.3 permutations and combinations

4.4 binomial coefficients

4.5 generalized permutations and combinations

4.6 generating permutations and combinations


chapter 5 discrete probability

5.1 an introduction to discrete probability5.2 probability theory

5.3 expected value and variance


chapter 6 advanced counting techniques

6.1 recurrence relation


2/19

6.2 solving recurrence relations

6.3 divide-and-conquer algorithms and recurrence relations

6.4 generating functions

6.5 inclusion-exclusion

6.6 applications of inclusion-exclusion


chapter 7 relations7.1 relations and their properties

7.2 n-ary relations and their applications

7.3 representing relations

7.4 closures of relations

7.5 equivalence relations

7.6 partial orderings


chapter 8 graphs

8.1 introduction to graphs

8.2 graph terminology

8.3 representing graphs and graph isomorphism8.4 connectivity

8.5 euler and hamilton paths

8.6 shortest-path problems

8.7 planar graphs

8.8 graph coloring


chapter 9 trees

9.1 introduction to trees

9.2 applications of trees

9.3 tree traversal

9.4 spanning trees9.5 minimum spanning trees



3/19



chapter 1 the foundations : logic and proofs, sets and functions

1.1 propositional logic

1.2 propositional equivalences

1.3 predicates and quantifiers

1.4 nested quantifiers1.5 rules of inference

1.6 introduction to proofs

1.7 proof methods and strategy


chapter 2 basic structures : sets, functions, sequences, sums

2.1 sets

2.2 set operations

2.3 functions

2.4 sequences and summations


chapter 3 the fundammentals: algorithms, integers, matrices

3.1 algorithms

3.2 the growth of functions

3.3 complexity of algorithms

3.4 the integers and divisions

3.5 primes and GCDs

3.6 integers and algorithms

3.7 applications of number theory

3.8 matrices


chapter 4 induction and recursion4.1 mathematical induction

4.2 strong induction and well ordering

4.3 recursive definitions and structural induction

4.4 recursive algorithms

4.5 program correctness


chapter 5 counting

5.1 the basics of counting

5.2 the pigeonhole principle

5.3 permutations and combinations

5.4 binomial coefficients5.5 generalized permutations and combinations

5.6 generating permutations and combinations


chapter 6 discrete probability

6.1 an introduction to discrete probability

6.2 probability theory

6.3 Bayes' theorem

6.4 expected value and variance


4/19


chapter 7 advanced counting techniques

7.1 recurrence relation

7.2 solving recurrence relations

7.3 divide-and-conquer algorithms and recurrence relations7.4 generating functions

7.5 inclusion-exclusion

7.6 applications of inclusion-exclusion


chapter 8 relations

8.1 relations and their properties

8.2 n-ary relations and their applications

8.3 representing relations

8.4 closures of relations

8.5 equivalence relations

8.6 partial orderingsend of chapter material

chapter 9 graphs

9.1 introduction to graphs

9.2 graph terminology

9.3 representing graphs and graph isomorphism

9.4 connectivity

9.5 euler and hamilton paths

9.6 shortest-path problems

9.7 planar graphs

9.8 graph coloring


chapter 10 trees

10.1 introduction to trees

10.2 applications of trees

10.3 tree traversal

10.4 spanning trees

10.5 minimum spanning trees


chapter 11 boolean algebra

11.1 boolean functions

11.2 representing boolean functions11.3 logic gates

11.4 minimization of circuits


chapter 12 modeling computation

12.1 language and grammas

12.2 finite-state machines with output

12.3 finite-state machines with no output

12.4 language recognition


5/19

12.5 turing machines



6/19



Februari 1 1.1 propositional logic chapter 1 the fou

1.2 propositional equivalences 1.1

1.2

1.38 1.3 predicates and quantifiers 1.4

1.4 nested quantifiers 1.5

1.6

15 1.5 rules of inference 1.7

1.6 introduction to proofs

22 1.7 proof methods and strategy

Maret 1 2.1 sets chapter 2 basic st

2.2 set operations 2.1

2.3 functions 2.2

2.4 sequences and summations 2.3

2.4

8

15

22

29

chapter 3 mathem

3.1

3.2

3.3

3.4

3.5

3.6


7/19

3.7

3.8

April 5

12

19

26


8/19

dations : logic and proofs, sets and functions

propositional logic

propositional equivalences

predicates and quantifiersnested quantifiers

rules of inference

introduction to proofs

proof methods and strategy


ructures : sets, functions, sequences, sums

sets

set operations

functions

sequences and summations


atical reasoning, induction, and recursion

algorithms

the growth of functions

complexity of algorithms

the integers and divisions

primes and GCDs

integers and algorithms


9/19

applications of number theory

matrices



10/19



Februari 5 1.1 propositional logic chapter 1 the fo

1.2 propositional equivalences 1.1

1.3 predicates and quantifiers 1.2

1.312 1.4 nested quantifiers 1.4

1.5 rules of inference 1.5

1.6

19 1.6 introduction to proofs 1.7

1.7 proof methods and strategy

26 libur nasional

Maret 5 2.1 sets

2.2 set operations chapter 2 basic

2.3 functions 2.1

2.4 sequences and summations 2.2

2.3

2.4

April 2 libur nasional

Mei 28 libur nasional


11/19

ndations : logic and proofs, sets and functions

propositional logic

propositional equivalences

predicates and quantifiersnested quantifiers

rules of inference

introduction to proofs

proof methods and strategy


tructures : sets, functions, sequences, sums

sets

set operations

functions

sequences and summations



12/19

matematika diskrit 2010 (kelas A)


13/19


14/19


15/19


16/19

matematika diskrit 2010 (kelas B)

1

2

3

45

6

7

8

9

10

11

12

13

14

15

1617

18

19

20

21

22

23

24

25

26

27

2829

30

31

32

33

34

35

36

37

38

39

4041

42

43

44

45

46


17/19


18/19

A 81

AB 71

B 66

BC 61

C 56

D 41


19/19

jadwal mat-dis-2010

Documents