Discrete Mathematics DSBA2018/2019
The first topic of our course is ``What is a Proof?". It is the first week ``Making Convincing Arguments" on the Coursera course . It is recommended (but not obligated) to study the whole course.
(NEW!) Exam will take place in the room 317. Note that you are allowed to use any written or printed materials, but not allowed to use any electronic device. Please take your own paper with you.
Final: Zero variant.
Midterm: Zero variant.
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.
Schedule for office hours and consultations
|Teacher / Assistant||Monday||Tuesday||Wednesday||Thursday||Friday|
|Alexander A. Rubtsov||17:00 - 18:00, room 617||17:00 - 18:00, room 511|
|Alexey K. Kovalev||16:40 - 18:00, room 427 or 619|
|Boris R. Danilov||09:30 - 12:00, room 623|
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
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
- 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.
Intermediate grade 1
Cumulative grade-1 = 50% colloquium-1 + 50% homework
Intermediate grade (module 2) = 60% cumulative grade-1 + 40% intermediate exam (module 2)
Intermediate grade 2
Cumulative grade = (3/14) colloquium-1 + (3/14)colloquium-2 + (3/14) intermediate exam + (15/42) homework
Intermediate grade = 70% cumulative grade + 30% final exam
Grade “homework assignments” is an average grade of all the homework assignments in the course.
Intermediate grade 2 is the final grade for the course included in a diploma supplement.
Rounding of the cumulative grade, intermediate and final grades must be performed according to the following rules. Rounding down for marks between 1 and 5, rounding by the rules of arithmetic for marks between 5 and 6, and rounding up for all the other marks.
There is no possibility to get an extra point to compensate the low cumulative grade.