Discrete Mathematics DSBA2019/2020
Содержание
Exams
Colloquiums
Homework Deadlines
For Group 191:
- HW 1 -- September 23, 2019
For Groups 192 and 193:
- HW 1 -- September 24, 2019
Online Consultation
If you have any questions regarding the Course, please feel free to ask them via our Telegram chat DSBA19-20 DM1 Public. Alternatively, you may use the Lecturer's VK page or send us an email (e:d,a:s.h:k;o,v AT gmail.com -- without punctuation marks to the left of AT, of course).
Materials
You can find some useful materials (including the Lecture Notes) here.
Problems | Keywords |
---|---|
cw1 | kw1 |
cw2 | [] |
Office hours
Teacher / Assistant | Monday | Tuesday | Wednesday | Thursday | Friday |
---|---|---|---|---|---|
Evgeny V. Dashkov | from 3:10 till 5 p.m. in room S913 | ||||
Boris R. Danilov | from 10:00 till 11:30 a.m. in room S913, starting from October 1 | ||||
Artem Streltsov | from 9:30 till 10:20 a.m. in room D204 |
Recommended Reading
Please notice that The Book for our Course does not exist. The latter is based on many sources.
- Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
- Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
- Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
- Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.
- Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.
- Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
- Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
- Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
- Vinogradov I. M. Elements of number theory. Dover, 1954.
In Russian
If you understand Russian (by any chance), you will probably benefit from reading the following books.
- Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
- Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.
- Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
- Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.
- Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
- Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
- Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.
Grading System
Intermediate grade-2 = (1/2) colloquium-2 + (1/2) homework-2.
Cumulative grade-3 = (3/10) colloquium-2 + (3/10) colloquium-3 + (4/10) homework-3.
Final grade-3 = (7/10) cumulative grade-3 + (3/10) final exam.
The number in a grade’s name is the number of the module when grading takes place. The grade homework-n is the normalized average grade for the homework in modules from 1 to n. The Intermediate and Final grades are subject to rounding half up to an integer. All the other grades are reported with the greatest precision available.