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

Материал из Wiki - Факультет компьютерных наук
Перейти к: навигация, поиск
(Materials)
(Materials)
(не показано 10 промежуточных версии 2 участников)
Строка 20: Строка 20:
 
* HW 7 -- February 10, 2020
 
* HW 7 -- February 10, 2020
 
* HW 8 -- February 28, 2020
 
* HW 8 -- February 28, 2020
 +
* HW 9 -- March 10, 2020
  
 
'''For Group 192:'''
 
'''For Group 192:'''
Строка 32: Строка 33:
 
* HW 7 -- February 10, 2020 (defence deadline March, 13, 2020)
 
* HW 7 -- February 10, 2020 (defence deadline March, 13, 2020)
 
* HW 8 -- March 2, 2020
 
* HW 8 -- March 2, 2020
 +
* HW 9 -- March <s>10</s> 16, 2020
  
 
'''For Group 193:'''
 
'''For Group 193:'''
Строка 44: Строка 46:
 
* HW 7 -- February 11, 2020 (defence deadline March, 13, 2020)
 
* HW 7 -- February 11, 2020 (defence deadline March, 13, 2020)
 
* HW 8 -- March 3, 2020
 
* HW 8 -- March 3, 2020
 +
* HW 9 -- March <s>10</s> 17, 2020
  
 
== Online Consultation ==
 
== Online Consultation ==
Строка 73: Строка 76:
 
  || [https://drive.google.com/open?id=15mmmXhQhqgJbCm8bdoJgNdiQ_uro7Q7N cw8] || []
 
  || [https://drive.google.com/open?id=15mmmXhQhqgJbCm8bdoJgNdiQ_uro7Q7N cw8] || []
 
|-
 
|-
  || [https://drive.google.com/open?id=1B7ADkn3E48SB7WkW6cqaxfKx9Dhd68Up cw9] || []
+
  || [https://drive.google.com/open?id=1frivYNWIMXLPnxbeZfbYDdYRr9sBS6wl cw9] || []
 +
|-
 +
|| [https://drive.google.com/open?id=1wcTi71p_f-sH4F7AxGH9I8GPd1h6bxjv cw10] || []
 
|}
 
|}
  

Версия 03:22, 24 марта 2020

Exams

Colloquiums

The 1st Colloquium is scheduled for February, 1 (room R301, from 3:00 till 9:00 pm). Please have a look at the questions and rules thereof.

Current Results

You can check your progress up to now via the DM1 Register Online.

Homework Deadlines

For Group 191:

  • HW 1 -- September 23, 2019
  • HW 2 -- September 30, 2019
  • HW 3 -- October 28, 2019
  • HW 4 -- November 15, 2019
  • HW 5 -- November 25, 2019
  • HW 6 -- December 9, 2019
  • HW 7 -- February 10, 2020
  • HW 8 -- February 28, 2020
  • HW 9 -- March 10, 2020

For Group 192:

  • HW 1 -- September 24, 2019
  • HW 2 -- October 1, 2019
  • HW 3 -- October 15 29, 2019
  • HW 4 (except ex. 6-9, 12, 14) -- November 15, 2019
  • HW 4 (ex. 6-9, 12, 14), HW 5 (ex. 1-4) -- November 22, 2019
  • HW 5 (ex. 4-8) -- November 26, 2019
  • HW 6 -- December 10, 2019 (defence deadline February, 21, 2020)
  • HW 7 -- February 10, 2020 (defence deadline March, 13, 2020)
  • HW 8 -- March 2, 2020
  • HW 9 -- March 10 16, 2020

For Group 193:

  • HW 1 -- September 24, 2019
  • HW 2 -- October 1, 2019
  • HW 3 -- October 15 29, 2019
  • HW 4 (except ex. 6-9, 12, 14) -- November 15, 2019
  • HW 4 (ex. 6-9, 12, 14), HW 5 (ex. 1-4) -- November 22, 2019
  • HW 5 (ex. 4-8) -- November 26, 2019
  • HW 6 -- December 10, 2019 (defence deadline February, 21, 2020)
  • HW 7 -- February 11, 2020 (defence deadline March, 13, 2020)
  • HW 8 -- March 3, 2020
  • HW 9 -- March 10 17, 2020

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 kw2
cw3 kw3
cw4 kw4
cw5 kw5
cw6 kw6
cw7 []
cw8 []
cw9 []
cw10 []

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 16:00 till 17:30, room S913

Recommended Reading

Please notice that The Book for our Course does not exist. The latter is based on many sources.

  1. Anderson J. A., Discrete Mathematics With Combinatorics. Prentice Hall, 2003.
  2. Biggs N. L., Discrete mathematics. 2nd ed., New York; Oxford: Oxford University Press, 2004.
  3. Gavrilov G. P., Sapozhenko A. A. Problems and Exercises in Discrete Mathematics. Kluwer Texts in the Mathematical Sciences 14. Springer, 1996.
  4. Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.
  5. Lovasz L., Vesztergombi K. Discrete Mathematics. Lecture Notes; Yale University, 1999.
  6. Melnikov O., Sarvanov V., Tyshkevich R., Yemelichev V., Zverovich I. Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences 19. Springer, 1998.
  7. Rosen K. H. Discrete Mathematics and Its Applications. McGraw-Hill, 1999.
  8. Stein C., Drysdale R. L., Bogart K. Discrete mathematics for computer scientists. Addison-Wesley, 2010.
  9. 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.

  1. Виноградов И. М. Основы теории чисел. 9-е изд., М.: Наука, 1981.
  2. Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.
  3. Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
  4. Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.
  5. Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
  6. Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
  7. Шень А., Математическая индукция. 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 = min(10, (7/10) cumulative grade-3 + (3/10) final exam + (1/10) bonus points).

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.

Bonus point number is between 0 to 20. Such points may be given for a variety of auxiliary activities.