imported>Edashkov: /* Exams */

2020-06-16T10:55:34Z

Exams

Новая страница

== Exams ==
The final exam is scheduled for June 16, 1 p.m. Please read carefully the [https://drive.google.com/file/d/1OOw705wN0Ej_in6_3a10qh1QMmsvRlbF/view?usp=sharing Rules]. You can find the Zoom conference you should join [https://docs.google.com/spreadsheets/d/1WUJj3nI2I6km9fu2_D89vvWSD5Wi-BcnA3NavrkZ-2Q/edit?usp=sharing here]. It is also STRONGLY recommended to join our [https://t.me/joinchat/M0dUGFHUPOGTAkVoFTQy5A Telegram Group] (if you have not done it yet, by any chance). As an additional precaution, the examination task will be posted here as well.

Here's the Task: https://drive.google.com/file/d/1n2tYOTfDZmOQPi-MmCTzqqnucvgpTu0p/view?usp=sharing

'''The exam has started at 1337 and is to be finished by 1537. All uploads have to be done by 1548.'''

== Colloquiums ==

The 2nd Colloquium is scheduled for June, 13 from 12 a.m. Please have a look at the [https://drive.google.com/file/d/1-qZFhZrkCjE8wdBlXWem_rGbEtt3G2bI/view?usp=sharing question list]. The event will be held via a Jitsi video conference server at https://meet.edashkov.net. Make sure you have a microphone, headphones and Chrome (or Chromium) browser installed.

The 1st Colloquium is scheduled for February, 1 (room R301, from 3:00 till 9:00 pm). Please have a look at the [https://drive.google.com/open?id=1plE4LaEfDak34sP4BeVR9TcBm2Ww3V9l questions and rules] thereof.

== Current Results ==
You can check your progress up to now via the
[https://docs.google.com/spreadsheets/d/10DnnnhiiHIu0mG-gLLhKr8dz703pFkaMtWmUzxm2QC0/edit#gid=1264223279 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 <s>15</s> 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 <s>10</s> 16, 2020

'''For Group 193:'''

* HW 1 -- September 24, 2019
* HW 2 -- October 1, 2019
* HW 3 -- October <s>15</s> 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 <s>10</s> 17, 2020

== Online Consultation ==

If you have any questions regarding the Course, please feel free to ask them via our Telegram chat [https://t.me/joinchat/M0dUGFHUPOGTAkVoFTQy5A DSBA19-20 DM1 Public]. Alternatively, you may use the Lecturer's [https://vk.com/evgeny.v.dashkov 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) [https://drive.google.com/drive/folders/1o8EJwM9L4zwTVKIJh-lkjwfHfHPAv1ua?usp=sharing here].

{| class="wikitable"
|-
! Problems || Keywords
|-
|| [https://drive.google.com/open?id=1rBFUo9XTGQ7e3BFlwZw9oi4Ja8N8uKba cw1] || [https://drive.google.com/open?id=1kQGeAAaB-gqb2OLGovMTmtqIZ4YSPS1c kw1]
|-
|| [https://drive.google.com/file/d/1I-NBJx7HXldcTKHHFqfxjsqTmQZ12lIk/view?usp=sharing cw2] || [https://drive.google.com/open?id=113ucNaQObqJkvytp0Vb2_RlODavtaedd kw2]
|-
|| [https://drive.google.com/open?id=1vfUah9MiFySTPfdjV3OTAEd4fgeDJ1gw cw3] || [https://drive.google.com/open?id=1rspTwMDVmhDv4v3HbvJ_VUT-wMugJjX8 kw3]
|-
|| [https://drive.google.com/open?id=1NgulEyScQOcbUUZ2zkYyGon9i-vJrAjb cw4] || [https://drive.google.com/open?id=1jfb_GaxhPJEy1Irx4VTwXVCEjnGj_K63 kw4]
|-
|| [https://drive.google.com/open?id=16keB-odowxB6RXOBhz9nSqz4zqFHklOK cw5] || [https://drive.google.com/open?id=1dQGbQAjejlP57igBPAUqoFul1pWepTmF kw5]
|-
|| [https://drive.google.com/open?id=1cDhwWqrYHZaBh06YuPi8K7g3fBcPDbYz cw6] || [https://drive.google.com/open?id=1ksuILmp-AX44oaMdRZe3JpBDC8zlG4nX kw6]
|-
|| [https://drive.google.com/open?id=1RWxKdYuskUNyjJA_CK9yFLM62tKWtNmZ cw7] || []
|-
|| [https://drive.google.com/open?id=15mmmXhQhqgJbCm8bdoJgNdiQ_uro7Q7N cw8] || []
|-
|| [https://drive.google.com/open?id=1frivYNWIMXLPnxbeZfbYDdYRr9sBS6wl cw9] || []
|-
|| [https://drive.google.com/open?id=1wcTi71p_f-sH4F7AxGH9I8GPd1h6bxjv cw10] || []
|}

== Office hours ==

{| class = "wikitable"
|-
! 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.''

# 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.
# [http://courses.csail.mit.edu/6.042/spring17/mcs.pdf Lehman E., Thomson Leighton F., Meyer A. R. Mathematics for Computer Science, 2017.]
# [http://www.cs.elte.hu/~lovasz/dmbook.ps 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.
# [http://rubtsov.su/public/DM-HSE-Draft.pdf Вялый М., Подольский В., Рубцов А., Шварц Д., Шень А. Лекции по дискретной математике.]
# Гаврилов Г. П., Сапоженко А. А. Задачи и упражнения по дискретной математике. 3-е изд., М.: ФИЗМАТЛИТ, 2004.
# [https://drive.google.com/file/d/1DBwUuZhHjAJhKmyDeAwQGf9R69YDAeAZ/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 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.

Discrete Mathematics DSBA2019/2020 - История изменений

imported>Edashkov: /* Exams */