Discrete Mathematics DSBA 2024/2025

Материал из Wiki - Факультет компьютерных наук
Перейти к: навигация, поиск

Instructors

The lecturer

My name is Evgeny Dashkov. Feel free to contact me via email: edashkov@gmail.com, Telegram, or VK.

My Assistant (the person responsible for the tables etc.): Elizaveta Levshina.

Seminar instructors

Group 241 242 243 244 245 246
Teachers Evgeny Dashkov Boris Danilov Diego Buitrago
Teaching Assistants [] [] [] [] []

Current performance

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

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

Course chat. This is our primary outlet for course announcements, questions, and discussions. Please join it!

Lecture notes

Original English version

A Russian translation by volunteering students (you are welcome to join their ranks)

Classes recordings

Lecture video archive

Other resources

Problem sets

Class problems

Assignment deadlines

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 is computed past Module 1 and equals:

Interim = 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 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 final grade for the course is computed past Module 3 and equals:

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

Generally, nobody is exempt from the examinations.

Exam retaking

Examinations 1 and 2 are subject to be retaken if the either the Interim or Final grade, respectively, is unsatisfactory. Retaking the 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 ПОПАТКУС:

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.

The 'cumulative grade' here means all the variables in the grading formulas except Exami, which are the only ones to be retaken.

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.
Источник — «http://wiki.cs.hse.ru/index.php?title=Discrete_Mathematics_DSBA_2024/2025&oldid=85671»