<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="ru">
	<id>https://wikicshse.ru/index.php?action=history&amp;feed=atom&amp;title=Discrete_Mathematics_DSBA2018%2F2019</id>
	<title>Discrete Mathematics DSBA2018/2019 - История изменений</title>
	<link rel="self" type="application/atom+xml" href="https://wikicshse.ru/index.php?action=history&amp;feed=atom&amp;title=Discrete_Mathematics_DSBA2018%2F2019"/>
	<link rel="alternate" type="text/html" href="https://wikicshse.ru/index.php?title=Discrete_Mathematics_DSBA2018/2019&amp;action=history"/>
	<updated>2026-06-06T13:25:09Z</updated>
	<subtitle>История изменений этой страницы в вики</subtitle>
	<generator>MediaWiki 1.45.3</generator>
	<entry>
		<id>https://wikicshse.ru/index.php?title=Discrete_Mathematics_DSBA2018/2019&amp;diff=211&amp;oldid=prev</id>
		<title>imported&gt;Rubtsov: Новая страница: «== Blended part  ==  The first topic of our course is  ``What is a Proof?&quot;. It is the first week ``Making Convincing Arguments&quot; on the Coursera [https://ru.course…»</title>
		<link rel="alternate" type="text/html" href="https://wikicshse.ru/index.php?title=Discrete_Mathematics_DSBA2018/2019&amp;diff=211&amp;oldid=prev"/>
		<updated>2019-09-04T10:49:56Z</updated>

		<summary type="html">&lt;p&gt;Новая страница: «== Blended part  ==  The first topic of our course is  ``What is a Proof?&amp;quot;. It is the first week ``Making Convincing Arguments&amp;quot; on the Coursera [https://ru.course…»&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Новая страница&lt;/b&gt;&lt;/p&gt;&lt;div&gt;== Blended part  ==&lt;br /&gt;
&lt;br /&gt;
The first topic of our course is  ``What is a Proof?&amp;quot;. It is the first week ``Making Convincing Arguments&amp;quot; on the Coursera [https://ru.coursera.org/learn/what-is-a-proof course ]. It is recommended (but not obligated) to study the whole course.&lt;br /&gt;
&lt;br /&gt;
==Exam ==&lt;br /&gt;
&lt;br /&gt;
(&amp;lt;span style=&amp;quot;color:red&amp;quot;&amp;gt;NEW!&amp;lt;/span&amp;gt;) Exam will take place in the room &amp;lt;b&amp;gt;317&amp;lt;/b&amp;gt;. Note that you are allowed to use any written or printed materials, but not allowed to use any electronic device. Please take your own paper with you.&lt;br /&gt;
&lt;br /&gt;
Final: [http://rubtsov.su/public/hse/2018/final0_dsba.pdf  Zero variant].&lt;br /&gt;
&lt;br /&gt;
Midterm: [http://rubtsov.su/public/hse/2018/midterm0.pdf  Zero variant].&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--- Exam will take place in the room &amp;lt;b&amp;gt;622&amp;lt;/b&amp;gt;. Note that you are allowed to use any written or printed materials, but not allowed to use any electronic device. Please take your own paper with you. ---&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Colloquium ==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;b&amp;gt;Schedule:&amp;lt;/b&amp;gt; 181 and 182 come at 13:40, 183 comes at 14:20. Room 509 (lecture room).&lt;br /&gt;
&lt;br /&gt;
The  [http://rubtsov.su/public/hse/2018/coll2_EN.pdf program] of the spring colloquium is ready.&lt;br /&gt;
&lt;br /&gt;
Colloquium will be on March 13. The timetable would be available soon.&lt;br /&gt;
&lt;br /&gt;
The  [http://rubtsov.su/public/hse/2018/Colloquium_program_DSBA.pdf program] of the winter colloquium.&lt;br /&gt;
&lt;br /&gt;
==Weekly Materials ==&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Problems || Keywords || Handouts&lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw01_dsba.pdf Problems week 1] ||  [http://rubtsov.su/public/hse/2018/keywords_1.pdf Keywords week 1]  ||  [http://rubtsov.su/public/hse/2018/boolean_laws.pdf Properties of Boolean Formulas] &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw02_dsba.pdf Problems week 2] ||  [http://rubtsov.su/public/hse/2018/keywords_2.pdf Keywords week 2]  ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw03_dsba.pdf Problems week 3] ||  [http://rubtsov.su/public/hse/2018/keywords_3.pdf Keywords week 3]  ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw04_dsba.pdf Problems week 4] ||  [http://rubtsov.su/public/hse/2018/keywords_4.pdf Keywords week 4]  ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw05_dsba.pdf Problems week 5] || [http://rubtsov.su/public/hse/2018/keywords_5.pdf Plan and Keywords week 5]  ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw06_dsba.pdf Problems week 6] || [http://rubtsov.su/public/hse/2018/keywords_6.pdf Plan week 6]  ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw07_dsba.pdf Problems week 7] ||[http://rubtsov.su/public/hse/2018/keywords_7.pdf Plan and Keywords week 7]  ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw08_dsba.pdf Problems week 8] || [http://rubtsov.su/public/hse/2018/keywords_8.pdf Plan and Keywords week 8]   ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw09_dsba.pdf Problems week 9] ||  [http://rubtsov.su/public/hse/2018/keywords_9.pdf Plan and Keywords week 9] ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw10_dsba.pdf Problems week 10] || [http://rubtsov.su/public/hse/2018/keywords_10.pdf Plan and Keywords week 10]  ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw11_dsba.pdf Problems week 11] ||   ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw12_dsba.pdf Problems week 12] || ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw13_dsba.pdf Problems week 13] || ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw14_dsba.pdf Problems week 14] || ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw15_dsba.pdf Problems week 15] ||  [http://rubtsov.su/public/hse/2018/keywords_15.pdf Plan and Keywords week 15]    ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw16_dsba.pdf Problems week 16] ||  [http://rubtsov.su/public/hse/2018/keywords_16.pdf Plan and Keywords week 16]    ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw17_dsba.pdf Problems week 17] ||  [http://rubtsov.su/public/hse/2018/keywords_17.pdf Plan and Keywords week 17]    ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw18_dsba.pdf Problems week 18] ||  ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw19_dsba.pdf Problems week 19] ||  ||  &lt;br /&gt;
|-&lt;br /&gt;
 ||  [http://rubtsov.su/public/hse/2018/cw20_dsba.pdf Problems week 20] ||  ||  &lt;br /&gt;
&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Schedule for office hours and consultations ==&lt;br /&gt;
&lt;br /&gt;
{| class = &amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Teacher / Assistant !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday&lt;br /&gt;
|-&lt;br /&gt;
| Alexander A. Rubtsov || || 17:00 - 18:00, room 617|| 17:00 - 18:00, room 511  || ||&lt;br /&gt;
|-&lt;br /&gt;
| Alexey K. Kovalev || || || 16:40 - 18:00, room 427 or 619|| ||&lt;br /&gt;
|-&lt;br /&gt;
| Boris R. Danilov || || || ||   || 09:30 - 12:00, room 623 &lt;br /&gt;
|-&lt;br /&gt;
| Tatyana	 Vasilyeva || || || || ||&lt;br /&gt;
|-&lt;br /&gt;
| Sofya 	 Kudryavtseva  || || || || ||&lt;br /&gt;
|-&lt;br /&gt;
| Anastasia Tabisheva || || || || || &lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Recommended books ==&lt;br /&gt;
&lt;br /&gt;
=== Assigned Reading ===&lt;br /&gt;
1.	L. Lovasz, K. Vesztergombi. Discrete Mathematics. Lecture Notes, Yale University, 1999. http://www.cs.elte.hu/~lovasz/dmbook.ps &lt;br /&gt;
&lt;br /&gt;
2.	C. Stein, R. Drysdale, K. Bogart. Discrete mathematics for computer scientists. Pearson; 1 edition 2010&lt;br /&gt;
&lt;br /&gt;
3.	J. Anderson. Discrete Mathematics With Combinatroics. Prentice Hall; 2 edition 2003&lt;br /&gt;
&lt;br /&gt;
7.    K. Rosen. Discrete Mathematics and Its Applications. McGraw-Hill; 7th edition 2007&lt;br /&gt;
&lt;br /&gt;
8.   E. Lehman, F. Thomson Leighton, A. R. Meyer. Mathematics for Computer Science, https://courses.csail.mit.edu/6.042/spring17/mcs.pdf&lt;br /&gt;
==== In Russian  ====&lt;br /&gt;
4.	M. Vyalyi, V. Podolsky, A. Rubtsov. D. Shvarts, A. Shen. Lectures on Discrete Mathematics [http://rubtsov.su/public/DM-HSE-Draft.pdf  Draft]&lt;br /&gt;
&lt;br /&gt;
5.	A. Shen. Mathematical induction (C1) 3rd ed., Moscow: MCCME, 2007, 32 p. http://www.mccme.ru/free-books/shen/shen-induction.pdf &lt;br /&gt;
&lt;br /&gt;
6.	N. K. Vereshchagin, A. Shen. Introduction to the set theory. 4th ed., Moscow: MCCME, 2012, 112 с. http://www.mccme.ru/free-books/shen/shen-logic-part1-2.pdf&lt;br /&gt;
&lt;br /&gt;
=== Additional Reading ===&lt;br /&gt;
*	R. Distel. Graph theory, GTM 173, 5th ed. 2016. Springer-Verlag, Heidelberg, Graduate Texts in Mathematics, Vol. 173, 447 p.&lt;br /&gt;
*	R. Hammack. Book of Proof, Virginia Commonwealth University 2013, https://www.people.vcu.edu/~rhammack/BookOfProof/BookOfProof.pdf &lt;br /&gt;
*	S. Jukna, Extremal Combinatorics. Texts in Theoretical Computer Science. An EATCS Series. 2nd ed. 2011, XXIV, 308 p.&lt;br /&gt;
&lt;br /&gt;
==Grading System ==&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Intermediate grade 1&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
Cumulative grade-1 = 50% colloquium-1 + 50% homework &lt;br /&gt;
&lt;br /&gt;
Intermediate grade (module 2) = 60% cumulative grade-1 + 40% intermediate exam (module 2)&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Intermediate grade 2&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
Cumulative grade = (3/14) colloquium-1 + (3/14)colloquium-2 + (3/14) intermediate exam + (15/42) homework &lt;br /&gt;
&lt;br /&gt;
Intermediate grade = 70% cumulative grade + 30% final exam&lt;br /&gt;
&lt;br /&gt;
Grade “homework assignments” is an average grade of all the homework assignments in the course.&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Intermediate grade 2 is the final grade for the course included in a diploma supplement.&amp;#039;&amp;#039;&amp;#039; &lt;br /&gt;
&lt;br /&gt;
Rounding of the cumulative grade, intermediate and final grades must be performed according to the following rules. Rounding down for marks between 1 and 5, rounding by the rules of arithmetic for marks between 5 and 6, and rounding up for all the other marks.&lt;br /&gt;
&lt;br /&gt;
There is no possibility to get an extra point to compensate the low cumulative grade.&lt;/div&gt;</summary>
		<author><name>imported&gt;Rubtsov</name></author>
	</entry>
</feed>