97¾Ç¦~«×²Ä1¾Ç´Á

Â÷´²¼Æ¾Ç

¡@

±Ð®v©m¦W¡G§d¥@¥°

                 Office Hours: ¶g¤@  10:00~12:00 (E-734¬ã¨s«Ç)

                             ¶g¥|  10:00~12:00 (E-734¬ã¨s«Ç)

¡@

½Ò¸¹

½Ò¦W

¶}½Ò¯Z¯Å

¤W½Ò®É¶¡¦aÂI

2733

Â÷´²¼Æ¾Ç

¸ê¤u¥|¤é¤TC

(¤T)5ÿ T1-603,¡]¥|¡^6-7  T1-503

2732

Â÷´²¼Æ¾Ç

¸ê¤u¥|¤é¤TB

(¤T)6-7ÿ T1-603,¡]¥|¡^5  T1-503

Text book:

 

  1. R.P. Grimaldi, ¡§Discrete and Combinatorial Mathematics¡¨, 5th edition, Addison Wesley, 2004. (ªFµØ¥N²z)
  2. §ë¼v¤ù(Slides)

 

°Ñ¦Ò®Ñ¥Ø(Reference Books):

  1. C.L. Liu, Elements of Discrete Mathematics 2/e, McGraw Hill, 1998. (µØ®õ¥N²z)
  2. K.H. Rosen, Discrete Mathematics and Its Applications 5/e, McGreaw-Hill, 2003. (¼Ú¨È¥N²z)
  3. R. Johnsonbaugh, Discrete Mathematics, 5th edition, Prentice Hall, 2001. («T³Ç®Ñ§½¥N²z)

 

Schedule

¶g¦¸

¹w©w¶i«×

§@·~/µû¶q

³Æ¦Ò

1

Fundamental Principles of Counting (1)

 

 

2

Fundamental Principles of Counting (2)

Quiz#1

 

3

Fundamentals of Logic (1)

 

 

4

Fundamentals of Logic (2)

 

 

5

Set Theory

 

 

6

Mathematical Induction (1)

 

 

7

Mathematical Induction (2)

 

 

8

Relations and Functions (1)

 

10/30´Á¤¤¦Ò´£¦­¤@¶g

9

Relations and Functions (2)

Mid Exam

´Á¤¤¦Ò¶g¤W½Ò

10

The Principle of Inclusion and Exclusion

 

 

11

Generating Functions

 

 

12

Recurrence Relations (1)

 

 

13

Recurrence Relations (2)

 

 

14

An Introduction to Graph Theory

 

 

15

Trees

 

 

16

Optimization and Matching (1)

 

 

17

Optimization and Matching (2)

 

 

18

 

Final Exam

´Á¥½¦Ò

Teaching Assistant:

   TBA

 

Homework

¡@


Last update: 2008-09-20

 

shwu@cyut.edu.tw