Wiki - Факультет компьютерных наук - Вклад [ru]

English DSBA 2024/2025

2024-12-21T15:23:54Z

2023-12-22T09:55:11Z

Feddes555:

=== [https://drive.google.com/file/d/1howziOImrxsqJjwVcLuO1-nRdzuPASll/view?usp=sharing Syllabus] ===

=== Teachers and Teaching Assistants ===

{| class="wikitable" style="text-align:center"
| Teachers || Ovchinnikova Anna Vasilievna [https://t.me/AnnaVasilievnaO Telegram] aovchinnikova@gmail.com ||Sildimirova Marina Alexandrovna [https://t.me/Msildimirova Telegram] aprvip1979@mail.ru ||Khvorostova Karina Alexandrovna [https://t.me/karinakhvorostova Telegram] karina.khvorostova@gmail.com||Perehodzeva Olga Vsevolodovna [https://t.me/OlgaPerekhodtseva Telegram] olga.perehodzeva@gmail.com || Glenn Hough [https://t.me/glenn_1_2 Telegram] glenn69@gmail.com|| Duane Schofield [https://t.me/DBS69 Telegram] duaneschofield@gmail.com
|-
| Groups || 231-1 233-1 234-1||232-1 233-2 234-2||235 || 231-2 232-2 || 232 234 || 231 233 235

|}

{| class="wikitable" style="text-align:center"
| Assistants ||Polina Lesovina [https://t.me/plesovina Telegram] pelesovina@edu.hse.ru || George Argirov [https://t.me/gotchaya Telegram] gaargirov@edu.hse.ru || Daria Lapko [https://t.me/dalapo4ka Telegram] dalapko@edu.hse.ru || Natalia Berlina [https://t.me/lavidanataliia Telegram] npberlina@edu.hse.ru || Vazhkaya Ksenia [https://t.me/vazhkayaaa Telegram] vazhkaya.ksusha@yandex.ru
|-
| Groups || 231-1 232-1 || 232-2 233-2 || 235 || 234 || 231-2 233-1
|-
| Lecturer’s Assistant || colspan="6" | Egor Kornelyuk [https://t.me/feddes5 Telegram] ekkornelyuk@edu.hse.ru

|}

=== Useful Links ===

{| class="wikitable"
|-
! Group !! Telegram Chat!! Register
|-
|231-1 || [https://t.me/+gImGMHlJEGhkOGNi Telegram] || [https://docs.google.com/spreadsheets/d/1mVzJCFeg24cnXnceAYWrVugMFWvzvknXSM_DI5x5NQo/edit?usp=drive_link Google Sheets]
|-
|231-2 || [https://t.me/+C-TRF4-rpoExMWE6 Telegram] || [https://docs.google.com/spreadsheets/d/1EMQLEDTO0N6yrEt42bUjf35ZizE_8vMyPi-rS6xj4Qs/edit?usp=drive_link Google Sheets]
|-
|232-1 || [https://t.me/+-g8Aymcv5lw0YTIy Telegram] || [https://docs.google.com/spreadsheets/d/1FY3GmU0Nuz0NapRs5aysBYiF_YMKjgPg8YjeiWTOE5Q/edit?usp=drive_link Google Sheets]
|-
|232-2 || [https://t.me/+Yz8QZcdwk2MxNDRi Telegram] || [https://docs.google.com/spreadsheets/d/1RlxB8gOqAPkJDDIvgjc0C1_Jo6mZ3igu0OWg8ZFL7L0/edit?usp=drive_link Google Sheets]
|-
|233-1 || [https://t.me/+qzBunCYOl5xkYTJi Telegram] || [https://docs.google.com/spreadsheets/d/1DcARJ-KQrv0Kp8rerJQ2M3s5YH_SZvmFfAmiUUSB2CM/edit?usp=drive_link Google Sheets]
|-
|233-2 || [https://t.me/+71Fp4Oep0y5mZmU6 Telegram] || [https://docs.google.com/spreadsheets/d/16vsPsk9ijd-NwJ5Jr4mFEHUQYYpvioVxQARonR_hKKc/edit?usp=drive_link Google Sheets]
|-
|234-1 || [https://t.me/+6BLHpu2a7nc2Zjcy Telegram] || [https://docs.google.com/spreadsheets/d/1LHXC8grOp8dDYw44dK06S7BfwO8hr0hdAaLVC77s38c/edit?usp=drive_link Google Sheets]
|-
|234-2 || [https://t.me/+I0Ai-sgPMRI3OGRi Telegram] || [https://docs.google.com/spreadsheets/d/18REnvhUjKtMO4FAnTM4dbtou4OENyR6gTz1P6sbJajo/edit?usp=drive_link Google Sheets]
|-
|235-1 || [https://t.me/+8m_g5L4kU58xYjVi Telegram] || [https://docs.google.com/spreadsheets/d/12-jenvUGWDB4BOjLkOyWWriUeB8pZSsi6kMNh7bNH60/edit?usp=drive_link Google Sheets]
|-
|235-2 || [https://t.me/+n5mYeU_Cd1kyYmMy Telegram] || [https://docs.google.com/spreadsheets/d/1RMU76gsLHIJRyrVL8gr9qhpbK1-nwV0QL2w4b-QwNbI/edit?usp=drive_link Google Sheets]
|}

Course Presentation - [https://drive.google.com/file/d/1Tscqt90nVgokaBH1cqRaCAnVwPo4k6qT/view?usp=sharing Link]

=== Grading System ===

===== 1-2 modules =====
G 1-2 modules = G cumulative 1-2 modules * 0.6 + G exam 2 module * 0.4 
G cumulative 1-2 modules = G attendance, classwork * 0.4 + G homework * 0.3+ G tests * 0.3

===== 3-4 modules =====

G 3-4 modules = G cumulative 3-4 modules * 0.6 + G mock test * 0.4 
G cumulative 3-4 modules = G attendance, classwork * 0.4 + G homework * 0,3 + G tests * 0.3

===== Final Grade =====

G final = (G 1-2 modules + G 3-4 modules) / 2

The arithmetic rounding rule is applied, i.e. 0.1-0.4 is rounded down and 0.5 and higher is rounded up.

=== Exam ===
December 23, English Exam, 09.45-17.30
Б. Трехсвятительский пер., 3
09.30-09.45 515 Leave your bags and all smart technology with our TAs

09.45-10.00 Be seated in your rooms according to your group / subgroup
537: 231, 232, 233-1

526: 233-2, 234, 235

No latecomers are allowed in the exam room during any part of the test, only in between the test parts.

10.00-12.00

Listening

2 listening sections, 20 minutes + time to transfer answers to the answer sheets

Reading

2 reading passages, 40 minutes, no extra time to transfer answers
Writing

Writing Task 1 (20 minutes)

12.00 Leave the exam room

Pokrovka
13.00-17.30 Speaking
Interview times are available on the link:
https://docs.google.com/spreadsheets/d/1FyzxIJITnCgRjXENbOmf966kDgrvKfH_zDK2RilckTQ/edit?usp=drive_link

Instructions

Before the written part

1) The test starts at 10.00, but you should be seated at 09.55, so arrive on time.

2) Your overcoats must be left downstairs in the cloakroom.

3) All belongings including your mobile phones are to be left in room 515.

4) You can take with you a bottle of water (label-free), a pen, a pencil and an eraser only.

5) Smartphones, smartwatches and other smarts are not allowed. In case any gadget is found with you, the test results are cancelled and you are disqualified.

During the test

6) You can make notes in the booklets.

7) Note that only your answer sheets (for READING and LISTENING) are to be checked.

8) Test timing will be noted on the board (for WRITING and READING).

9) In case you have a question, raise your hand and an assistant/teacher will help you asap.

10) You cannot talk during the test with other students or look at their answers or booklets. If we catch you doing so, the test results are cancelled and you are disqualified.

11) You should stop writing when you are asked to finish the test and in case you continue writing, it is regarded as cheating and the test results are cancelled.

Procedure

The test starts with LISTENING.

The next part to be done is READING.

The WRITING part comes after the other two.

Speaking

The day finishes with SPEAKING.

During the interview, no gadgets are allowed.

You should come 20 minutes before your time.

You should not discuss the questions you were asked with each other.

=== Retake Rules ===
Students’ performance during the final resit of the examination in module 2 is assessed by a committee of lecturers. The resit follows the same format as the examination. On the first resit the cumulative grade (G cumulative 1-2 modules) is taken into consideration. On the second resit the following rules are used: 
The formula remains the same: G 1-2 modules= G cumulative 1-2 modules* 0.6 + G exam 2 module* 0.4 
If the resulting grade (G 1-2 modules) is unsatisfactory, but the second resit grade (G exam 2 module) is higher than 7, the student is given a 4. 

=== Plagarism and Penalties ===
If plagiarism or AI is detected, the assessment element is assigned a score of “0”. If the student is suspected of preparing the task not on their own or using AI, the teacher has the right to initiate additional verification or defence of this particular assessment element. Such an assessment element is graded based on the additional verification or the defence. If the student manages to achieve a satisfactory defence on the suspicion, they should then be given the mark they achieved.

2023-09-06T17:30:28Z

Feddes555:

2023-03-11T15:07:04Z

Feddes555: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

=== Seminar instructors ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || Evgeny Dashkov ||colspan="2"| Boris Danilov [https://t.me/brdann Telegram]|| Trofimova Anastasia [https://t.me/AnastasiiaTrofimova Telegram]
|-
|| Teaching Assistants || Arseny Bolotnikov [https://t.me/l0i4b Telegram] ||Daria Ivanova [https://t.me/ivanovskayaaaaa Telegram]|| Egor Kornelyuk [https://t.me/feddes5 Telegram] || Marianna Kouis [https://t.me/mariannakouis Telegram]
|-
|| Lecturer’s Assistant || colspan="4"| Alena Chislova [https://t.me/alenka_chislova Telegram]
|}

== Current performance ==

[https://docs.google.com/spreadsheets/d/1KoXyABY4alQu-Gw3HsYy3Vco9rfvHdYQZuUjE_ERJB8/edit?usp=sharing The Table]

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems, some of which are labeled as ‘bonus’ while all the remaining are considered ‘ordinary’. One can get either 0, ½, or 1 point for each problem. For the entire homework, two values are computed:

HW = (the sum of points given for ordinary problems) / #(ordinary problems);

HW* = (the sum of points given for bonus problems) / #(bonus problems).

The value HW1 is similar to HW but restricted to the problem sets given in Module 1.

A student may be required to explain orally his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point, and the entire exam with two values:

Exam1 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam1* = (the sum of points given for bonus problems) / #(bonus problems)

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit. The student may get from 0 to 10 integer points for his answer; the value Colloq is just this score.

Please find the question list and rules [https://drive.google.com/file/d/13gNFBATQ6V3lieUj8vym8OXC2RXmbdt4/view?usp=share_link here].

== Exam 2 ==
A written examination is held at the end of the Course. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point; finally, two values are computed:

Exam2 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam2* = (the sum of points given for bonus problems) / #(bonus problems).

== Bonus activities ==
The students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) with an overall integer value Bonus from 0 to 25.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if Module 1 grade or Final grade (see below), respectively, is unsatisfactory. Retaking the exam is similar to the regular examination. The resulting grade is substituted for that of the latter. The last try Commission retaking is held for those whose final grade is still unsatisfactory after the retaking. A designated Commission carefully examines the student’s performance and gives him a final mark not better than ‘satisfactory’; at that the Commission is not bound by the grading formulas herein.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat].

=== Lecture notes ===

https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing

=== Classes recordings ===

https://disk.yandex.ru/d/enYKJ6O8NN_3lQ

=== Lecture video archive ===

https://youtube.com/playlist?list=PLEwK9wdS5g0pk-1YWDc3hezRt_rNpQDf8

=== Compensatory lecture video ===

https://youtu.be/SBH4lou-awE

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=sharing Problem set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=sharing Problem set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=sharing Problem set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=share_link Problem set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=share_link Problem set 5]

* [https://drive.google.com/file/d/1-ylVViaBgzxEM-M7Rvrz2iggtK6UiJTY/view?usp=share_link Problem set 6]

* [https://drive.google.com/file/d/15tcTNLW-uFqT2xPJn1imOnEzaGwlaZAq/view?usp=share_link Problem set 7]

* [https://drive.google.com/file/d/1N1EuCCe7NIiEa69nXHwncfQG2IOTyzLi/view?usp=share_link Problem set 8]

* [https://drive.google.com/file/d/1PmlR2bysnKSZrJle9Dwa4KiB23G5ORdZ/view?usp=share_link Problem set 9]

=== Homework problems ===

* [https://drive.google.com/file/d/1A8lFPdI3ZvC1vOgz2KEpYcuWOFlsQvb1/view?usp=sharing Homework 1]

* [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=sharing Homework 2a]

* [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=share_link Homework 2b]

* [https://drive.google.com/file/d/1UvF-3gRwMrnsDAT9H4KDpoUafhrthKPw/view?usp=share_link Homework 3]

* [https://drive.google.com/file/d/1I25qKW9F_ZJi8akim-X8Op17VTLnZznJ/view?usp=share_link Homework 4]

=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 221 || 222 || 223 || 224
|-
| HW 1 №1-3 || || 22.IX || 22.IX || 22.IX
|-
| HW 1 || October 6 || October 6 || October 6 || October 6
|-
| HW 2a №1-3 || || October 20 || October 20 ||
|-
| HW 2a || October 24 || October 27 || October 27 || October 27
|-
| HW 2b №1-7 || November 30 || November 20 || November 20 || November 20
|-
| HW 2b №8-14 || December 14 || December 4 || December 4 || December 4
|-
| HW 3 №1-3 || December 22 || December 22 || December 22 || December 24
|-
| HW 3 №4-12 || February 11 || February 11 || February 11 || February 11
|-
| HW 4 || March 16 || || ||
|}

'''Each deadline is set by the respective group's instructor.'''

== Grading system ==
For the final grading, we compute the following values:

Module 1 grade = round ((50*HW1 + 50*Exam1)/100);

basic = (21*Exam1 + 21*Colloq + 28*HW + 30*Exam2)/100;

adv = (30*Exam1* + Bonus + 35*HW* + 35*Exam2*)/100;

Final grade = round(min(10, 8 * basic + 2 * adv)).

The final grade is rounded half up to an integer. All the other values are reported with the greatest precision available.

== 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/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]

Discrete Mathematics DSBA 2022/2023

2023-03-11T15:06:45Z

Feddes555: /* Assignment deadlines */

== Instructors ==

=== The lecturer ===
My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, [https://t.me/edashkov Telegram], or [https://vk.com/evgeny.v.dashkov VK].

=== Seminar instructors ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 221 !! 222 !! 223 !! 224
|-
|| Teachers || Evgeny Dashkov ||colspan="2"| Boris Danilov [https://t.me/brdann Telegram]|| Trofimova Anastasia [https://t.me/AnastasiiaTrofimova Telegram]
|-
|| Teaching Assistants || Arseny Bolotnikov [https://t.me/l0i4b Telegram] ||Daria Ivanova [https://t.me/ivanovskayaaaaa Telegram]|| Egor Kornelyuk [https://t.me/feddes5 Telegram] || Marianna Kouis [https://t.me/mariannakouis Telegram]
|-
|| Lecturer’s Assistant || colspan="4"| Alena Chislova [https://t.me/alenka_chislova Telegram]
|}

== Current performance ==

[https://docs.google.com/spreadsheets/d/1KoXyABY4alQu-Gw3HsYy3Vco9rfvHdYQZuUjE_ERJB8/edit?usp=sharing The Table]

== Homework ==
The homework includes a few problem sets, one in a fortnight or so (the deadlines are announced on giving each set). Every problem set consists of about 10 – 15 problems, some of which are labeled as ‘bonus’ while all the remaining are considered ‘ordinary’. One can get either 0, ½, or 1 point for each problem. For the entire homework, two values are computed:

HW = (the sum of points given for ordinary problems) / #(ordinary problems);

HW* = (the sum of points given for bonus problems) / #(bonus problems).

The value HW1 is similar to HW but restricted to the problem sets given in Module 1.

A student may be required to explain orally his written solution to any problem. His grade for the problem may be decreased if he fails to do so properly.

== Exam 1 ==
A written examination is held past Module 1. Students may not consult any sources during the exam. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point, and the entire exam with two values:

Exam1 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam1* = (the sum of points given for bonus problems) / #(bonus problems)

== Colloquium ==
An oral colloquium is held at the beginning of Module 3. Each student is given two questions concerning statements and definitions as well as one question requiring a proof. After no less than 45 minutes of preparation (when using any literature is allowed), the student is required to answer ‘from scratch’, that is, with no recourse to any materials. The examiner may pose additional questions as he sees fit. The student may get from 0 to 10 integer points for his answer; the value Colloq is just this score.

Please find the question list and rules [https://drive.google.com/file/d/13gNFBATQ6V3lieUj8vym8OXC2RXmbdt4/view?usp=share_link here].

== Exam 2 ==
A written examination is held at the end of the Course. Students may not consult any sources during the exam. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’. Each problem solution is graded with either 0, ¼, ½, ¾, or 1 point; finally, two values are computed:

Exam2 = (the sum of points given for ordinary problems) / #(ordinary problems);

Exam2* = (the sum of points given for bonus problems) / #(bonus problems).

== Bonus activities ==
The students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) with an overall integer value Bonus from 0 to 25.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if Module 1 grade or Final grade (see below), respectively, is unsatisfactory. Retaking the exam is similar to the regular examination. The resulting grade is substituted for that of the latter. The last try Commission retaking is held for those whose final grade is still unsatisfactory after the retaking. A designated Commission carefully examines the student’s performance and gives him a final mark not better than ‘satisfactory’; at that the Commission is not bound by the grading formulas herein.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat].

=== Lecture notes ===

https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing

=== Classes recordings ===

https://disk.yandex.ru/d/enYKJ6O8NN_3lQ

=== Lecture video archive ===

https://youtube.com/playlist?list=PLEwK9wdS5g0pk-1YWDc3hezRt_rNpQDf8

=== Compensatory lecture video ===

https://youtu.be/SBH4lou-awE

=== Other resources ===
* [https://tinyurl.com/rwky5vmk The Course's Google Directory]

* [https://www.youtube.com/playlist?list=PL1Uob8iPTHGTidrmrqEHTJ96Pt3-PmML4 Past years' videos]

* We have a [https://meet.edashkov.net.ru dedicated server] to hold an online meeting if we need one.

== Problem sets ==

=== Class problems ===

* [https://drive.google.com/file/d/1EP-diSuOTn9f0ryg18Z2w0xjEp8j0bnl/view?usp=sharing Problem set 1]

* [https://drive.google.com/file/d/12ct99-ORd7A94Gh5g4Nf9riv7UqNMSRc/view?usp=sharing Problem set 2]

* [https://drive.google.com/file/d/1yKKqLsS99V4AhCYqbjafuav2CMCdQTOQ/view?usp=sharing Problem set 3]

* [https://drive.google.com/file/d/1YgH_AdCk4GcKC0KH7xBA4-sUnOYkUvUK/view?usp=share_link Problem set 4]

* [https://drive.google.com/file/d/1M556PSgTJOo5W-AxYEXjFu94VfledpF5/view?usp=share_link Problem set 5]

* [https://drive.google.com/file/d/1-ylVViaBgzxEM-M7Rvrz2iggtK6UiJTY/view?usp=share_link Problem set 6]

* [https://drive.google.com/file/d/15tcTNLW-uFqT2xPJn1imOnEzaGwlaZAq/view?usp=share_link Problem set 7]

* [https://drive.google.com/file/d/1N1EuCCe7NIiEa69nXHwncfQG2IOTyzLi/view?usp=share_link Problem set 8]

* [https://drive.google.com/file/d/1PmlR2bysnKSZrJle9Dwa4KiB23G5ORdZ/view?usp=share_link Problem set 9]

=== Homework problems ===

* [https://drive.google.com/file/d/1A8lFPdI3ZvC1vOgz2KEpYcuWOFlsQvb1/view?usp=sharing Homework 1]

* [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=sharing Homework 2a]

* [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=share_link Homework 2b]

* [https://drive.google.com/file/d/1UvF-3gRwMrnsDAT9H4KDpoUafhrthKPw/view?usp=share_link Homework 3]

* [https://drive.google.com/file/d/1I25qKW9F_ZJi8akim-X8Op17VTLnZznJ/view?usp=share_link Homework 4]

=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 221 || 222 || 223 || 224
|-
| HW 1 №1-3 || || 22.IX || 22.IX || 22.IX
|-
| HW 1 || October 6 || October 6 || October 6 || October 6
|-
| HW 2a №1-3 || || October 20 || October 20 ||
|-
| HW 2a || October 24 || October 27 || October 27 || October 27
|-
| HW 2b №1-7 || November 30 || November 20 || November 20 || November 20
|-
| HW 2b №8-14 || December 14 || December 4 || December 4 || December 4
|-
| HW 3 №1-3 || December 22 || December 22 || December 22 || December 24
|-
| HW 3 №4-12 || February 11 || February 11 || February 11 || February 11
|-
| HW 4 || March 16 | March 18 | | March 18 | ||
|}

'''Each deadline is set by the respective group's instructor.'''

== Grading system ==
For the final grading, we compute the following values:

Module 1 grade = round ((50*HW1 + 50*Exam1)/100);

basic = (21*Exam1 + 21*Colloq + 28*HW + 30*Exam2)/100;

adv = (30*Exam1* + Bonus + 35*HW* + 35*Exam2*)/100;

Final grade = round(min(10, 8 * basic + 2 * adv)).

The final grade is rounded half up to an integer. All the other values are reported with the greatest precision available.

== 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/1RM6KX_reBFwUXesWGUEu0sFn2NCaBgvz/view?usp=sharing Дашков Е. В. Введение в математическую логику. Множества и отношения. М.: МФТИ, 2019.]
# Зубков А. М., Севастьянов Б. А., Чистяков В. П. Сборник задач по теории вероятностей. 2-е изд., М.: Наука, 1989.
# Мельников О. И. Теория графов в занимательных задачах. 5-е изд., М.: Книжный дом "ЛИБРОКОМ", 2013.
# [http://www.mccme.ru/free-books/shen/shen-induction.pdf Шень А., Математическая индукция. 5-е изд, М.: МЦНМО, 2016.]