Discrete Mathematics DSBA2019/2020 — различия между версиями

Материал из Wiki - Факультет компьютерных наук
Перейти к: навигация, поиск
(Exam)
(Colloquium)
Строка 1: Строка 1:
 
==Exams ==
 
==Exams ==
  
==Colloquium ==
+
==Colloquiums ==
  
 
<b>Schedule:</b> 181 and 182 come at 13:40, 183 comes at 14:20. Room 509 (lecture room).
 
<b>Schedule:</b> 181 and 182 come at 13:40, 183 comes at 14:20. Room 509 (lecture room).

Версия 17:18, 21 августа 2019

Exams

Colloquiums

Schedule: 181 and 182 come at 13:40, 183 comes at 14:20. Room 509 (lecture room).

The program of the spring colloquium is ready.

Colloquium will be on March 13. The timetable would be available soon.

The program of the winter colloquium.

Weekly Materials

Problems Keywords Handouts
Problems week 1 Keywords week 1 Properties of Boolean Formulas
Problems week 2 Keywords week 2
Problems week 3 Keywords week 3
Problems week 4 Keywords week 4
Problems week 5 Plan and Keywords week 5
Problems week 6 Plan week 6
Problems week 7 Plan and Keywords week 7
Problems week 8 Plan and Keywords week 8
Problems week 9 Plan and Keywords week 9
Problems week 10 Plan and Keywords week 10
Problems week 11
Problems week 12
Problems week 13
Problems week 14
Problems week 15 Plan and Keywords week 15
Problems week 16 Plan and Keywords week 16
Problems week 17 Plan and Keywords week 17
Problems week 18
Problems week 19
Problems week 20

Schedule for office hours and consultations

Teacher / Assistant Monday Tuesday Wednesday Thursday Friday
Evgeny V. Dashkov
Boris R. Danilov

Recommended books

Assigned Reading

1. L. Lovasz, K. Vesztergombi. Discrete Mathematics. Lecture Notes, Yale University, 1999. http://www.cs.elte.hu/~lovasz/dmbook.ps

2. C. Stein, R. Drysdale, K. Bogart. Discrete mathematics for computer scientists. Pearson; 1 edition 2010

3. J. Anderson. Discrete Mathematics With Combinatroics. Prentice Hall; 2 edition 2003

7. K. Rosen. Discrete Mathematics and Its Applications. McGraw-Hill; 7th edition 2007

8. E. Lehman, F. Thomson Leighton, A. R. Meyer. Mathematics for Computer Science, https://courses.csail.mit.edu/6.042/spring17/mcs.pdf

In Russian

4. M. Vyalyi, V. Podolsky, A. Rubtsov. D. Shvarts, A. Shen. Lectures on Discrete Mathematics Draft

5. A. Shen. Mathematical induction (C1) 3rd ed., Moscow: MCCME, 2007, 32 p. http://www.mccme.ru/free-books/shen/shen-induction.pdf

6. N. K. Vereshchagin, A. Shen. Introduction to the set theory. 4th ed., Moscow: MCCME, 2012, 112 с. http://www.mccme.ru/free-books/shen/shen-logic-part1-2.pdf

Additional Reading

  • R. Distel. Graph theory, GTM 173, 5th ed. 2016. Springer-Verlag, Heidelberg, Graduate Texts in Mathematics, Vol. 173, 447 p.
  • R. Hammack. Book of Proof, Virginia Commonwealth University 2013, https://www.people.vcu.edu/~rhammack/BookOfProof/BookOfProof.pdf
  • S. Jukna, Extremal Combinatorics. Texts in Theoretical Computer Science. An EATCS Series. 2nd ed. 2011, XXIV, 308 p.

Grading System

Intermediate grade 1