Ostatnia aktualizacja:
May 18. 2019 23:41:59

Discrete Mathematics 1

Sylabus

Lecture notes

Test 2 - specimen

Test 1 - specimen 

Exercises:

1. Counting

2. Combinatorial identities. Partitions.

3. Inclusion-exclusion principle

4. Generating functions. Induction. Reccurences.

5. Coding theory.

6. Graph Theory. Basic Definitions.

Assesment method:

Two midterm tests - max. 17 pts for each,

activity on exercises - max. 6 pts

Final grade:

20-23 pts - 3.0

24-27 pts - 3.5

28-31 pts - 4.0

32-35 pts - 4.5

36-40 pts - 5.0

Books:

1) J. A. Bondy, U. S. R. Murty, Graph Theory with Applications, American Elsevier Publishing Co., 1976. 

2) W. Lipski, Kombinatoryka dla programistów, Warszawa, WNT 2004

3) F. Roberts, Applied Combinatorics, Prentice Hall, 1984.

4) K. A. Ross, C.R.B.Wright, Matematyka Dyskretna, PWN 1999.

5) R.J. Wilson, Introduction to Graph Theory, Addison Wesley, 1996.

6) R. Diestel, Graph Theory, Springer-Verlag 1997,2000,2005