imported>Edashkov: /* Assignment deadlines */

2025-03-16T17:46:02Z

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].

My Assistant (the person responsible for the tables etc.): [https://t.me/elizaaaa_5 Elizaveta Levshina].

=== Seminar Instructors and Teaching Assistants ===
{| class="wikitable" style="text-align:center"
|-
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246
|-
|| Teachers || [https://t.me/edashkov Evgeny Dashkov] ||colspan="2"| [https://t.me/brdann Boris Danilov]|| colspan="3"| [https://t.me/DiegBuitrago Diego Buitrago]
|-
|| Teaching Assistants || [https://t.me/svbudygin Sergei Budygin] || [https://t.me/Avgustine_iw Zakhar Zinkin] || [https://t.me/svnsrg Sergey Savin] || [https://t.me/NaviMash Ivan Mashkarin] || [https://t.me/underpl Maxim Titov] || [https://t.me/almanmaria Maria Krotova]
|}

=== Whom should I ask? ===

If you have a question or comment concerning the mathematical content of our course, it is best to post it to our [https://t.me/joinchat/T_YTN4IG1vAJNWT9 student chat]. Alternatively, you may address your question to your Teaching Assistant, Seminar Instructor or the Lecturer (say, if your question discloses an important idea for a HW problem). It is much better to ask and get to know than not to ask and remain ignorant. '''Please do not hesitate to ask your mathematical questions!'''

If you need a more detailed consultation concerning the course's mathematics, please be informed that our Teaching Assistants usually hold periodic consultations while the Seminar Instructors and Lecturer have some designated time for counseling students. Still, the best thing to do is to arrange a consultation in advance via a personal communication.

Homework-grading related questions should be directed to your teaching assistant first; then to your seminar instructor and to the lecturer just in case of any disagreement.

Organizational, administrative, legal or paperwork questions must be addressed to the Student Service Center, Study Office or other relevant offices first and foremost. If you have been redirected to us with such a question nevertheless, please contact the Lecturer's Assistant first.

== Current performance ==

[https://docs.google.com/spreadsheets/d/1632c9OT4ICCe5X3A1Obc1rH69dNpIEy_FEghK1vyM8o/edit?usp=drive_link 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’. These sets may be subdivided further for students’ convenience.

A student may be required to 'defend' (i.e., 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. The examination takes about 120 minutes. Some problems of the exam are labeled as ‘bonus’; the others are ‘ordinary’.

== 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.

'''Please find the question list and rules [https://drive.google.com/file/d/1ZdxmBUHDBnDnI156J4QR2X3Y0rJZoPiW/view?usp=drive_link here]'''.

== Exam 2 ==
A written examination is held past Module 3. 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’.

== Bonus activities ==
Throughout the course, the students may be graded for a variety of ‘bonus activities’ (like quizzes, etc.) either offline or online.

== Course materials ==

[https://t.me/joinchat/T_YTN4IG1vAJNWT9 Course chat]. This is our primary outlet for course announcements, questions, and discussions. '''Please join it!'''

=== Lecture notes ===

[https://drive.google.com/file/d/1mmNLLQ0--EDihGNRKwSyXLOA1KL7A0lD/view?usp=sharing Original English version]

[https://drive.google.com/drive/folders/1cTCdJtVVtO9uDgIKE8HY0qhl285tzOo1?usp=drive_link A Russian translation by volunteering students] (you are welcome to [https://t.me/sigma_algebraa join] their ranks)

=== Classes recordings ===

=== Lecture video archive ===

=== 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=drive_link Problem Set 1]

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

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

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

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

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

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

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

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

=== Assignment deadlines ===

{| class="wikitable"
|-
! Home problem set !! colspan="11" | Deadline
|-
| || 241 || 242 || 243 || 244 || 245 || 246
|-
| [https://drive.google.com/file/d/15vCxTrNMwagS4rqQnUzdLParTqOP8y5P/view?usp=drive_link HW1a ] || Sep 19 || Sep 19 || Sep 19 || Sep 24 || Sep 24 || Sep 24
|-
| [https://drive.google.com/file/d/1PTJY1PEG-wUlTqUGXT8KWRsll8H0XLb0/view?usp=drive_link HW1b] || Oct 12 || Oct 10 || Oct 10 || Oct 17 || Oct 17 || Oct 17
|-
| [https://drive.google.com/file/d/1mSNPCXo1J3eMz7Wk9yagWkgaZn7AwN7B/view?usp=drive_link HW1c] || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24 || Oct 24
|-
| [https://drive.google.com/file/d/1LOPPwGjyVleR_mclxTKUJ_bxFrxt44sW/view?usp=drive_link HW2a] || Nov 29 || Nov 29 || Nov 29 || Nov 29 || Nov 29 || Nov 29
|-
| [https://drive.google.com/file/d/1W7k1OTiIMlPOpo-2mwmGegrc4RDHz5_j/view?usp=drive_link HW2b] || Dec 8 || Dec 8 || Dec 8 || Dec 14 || Dec 14 || Dec 14
|-
| [https://drive.google.com/file/d/1V99HEXHgcCXT6tjJp0oPV05Jw172Bid8/view?usp=drive_link HW2c] || Jan 9 || Jan 23 || Jan 23 || Jan 25 || Jan 25 || Jan 25
|-
| [https://drive.google.com/file/d/1NVhQr0s6Z7SK6Y_oXzskXpY8c1CVeolJ/view?usp=drive_link HW3a] || Feb 6 || Feb 3 || Feb 6 || Feb 15 || Feb 15 || Feb 15
|-
| [https://drive.google.com/file/d/19S1mi9DHX0WoqJpSOMSItFPN--Snhrp_/view?usp=drive_link HW3b] || Feb 27 || Feb 27 || Feb 27 || March 9 || March 1 || March 1
|-
| [https://drive.google.com/file/d/1wPy3_0myen8aLP8f-WP3DMiPZjqT6CRy/view?usp=drive_link HW4a] || Mar 10 || Mar 20 || Mar 20 || March 15 || March 15 || March 15
|-
| [https://drive.google.com/file/d/1vKfnIzo6b-WbZLYrDL6hd1S2v4s55SZ2/view?usp=drive_link HW4b] || Mar 22 || Mar 22 || Mar 22 || Mar 22 || Mar 22 || Mar 22
|}

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

== Assessment and Grading ==

=== Homework ===

The homework is graded in two batches: one (HW_A) includes everything to be submitted in Module1 and the other (HW_B) includes all the rest. For each problem, either ordinary or bonus, the student is given a score from 0 to 1 point (in fractional values) according to the progress he made.

Grade HW_A is computed the following way (before rounding):

HW_A = 8 * ord + 2 * adv, where

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

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

Grade HW_B is computed similarly but for its respective period of Modules 2 and 3.

=== Exam1 and the Interim Assessment ===

Each problem solution in the exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam1 = 8 * ord + 2 * adv, where

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

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

The Interim grade 1 is computed past Module 1 and equals:

Interim1 = round(0.5 * HW_A + 0.5 * Exam1).

(Here and everywhere, rounding is according to arithmetic rules.)

=== Colloquium ===
For each of the 'definition' two questions, the student is given a score from 0 to 2 points, and from 0 to 4 points for the ‘proof’ question (all in fractional values).
The Colloq grade is computed the following way (before rounding):

Colloq = 10 * (the sum of points given) / 8.

=== Bonuses ===
Each student is given a score according to his progress in bonus activities, which results in the grade

Bonus = 10 * #(points given) / #(points possible).

The number of possible points varies but it is between 1 and 25 usually.

=== Exam2, the Second Interim, and the Final Assessment ===
Each problem solution in exam is graded with a fractional score from 0 to 1 point, and the entire exam with the value (before rounding)

Exam2 = 8 * ord + 2 * adv, where

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

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

The Interim grade 2 is computed past Module 3 and equals:

Interim2 = round(0.295 * HW_B + 0.295 * Colloq + 0.06 * Bonus + 0.35 * Exam2).

The final grade for the course is

Final = round(0.3 * Interim1 + 0.7 * Interim 2)

Generally, '''nobody is exempt from the examinations'''.

== Exam retaking ==
Examinations 1 and 2 are subject to be retaken if either the Interim1 or Final grade, respectively, is unsatisfactory (i.e., < 4). Retaking an exam is similar to the regular examination. The resulting grade is substituted for that of the latter (that is, retake grade is assigned to the variable Exami in the respective formula, whose value is then reevaluated). Those whose Interim or Final grade is still unsatisfactory after the first retake will have a (tough) choice to make.

Please take into account the following regulation according to the ''ПОПАТКУС'':
<blockquote>
On the first and second retake the cumulative course grade is taken into consideration. In case of receiving an unsatisfactory final grade after the first retake, the student may refuse to participate in the second retake and repeat the course according to the individual curricula. Cumulative grade is formed again as a result of repeated course. After the completion of the repeated course, the student is given a second retake only, from which the student has previously refused.
</blockquote>

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken. The 'second retake' is similar to the first one and it is evaluated according to the same formula with the same values of 'cumulative' variables. This poses an obvious risk for anyone whose 'cumulatives' are low!

== 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 2024/2025 - История изменений

imported>Edashkov: /* Assignment deadlines */