<?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=Python_Programming_DSBA_2024%2F25</id>
	<title>Python Programming DSBA 2024/25 - История изменений</title>
	<link rel="self" type="application/atom+xml" href="https://wikicshse.ru/index.php?action=history&amp;feed=atom&amp;title=Python_Programming_DSBA_2024%2F25"/>
	<link rel="alternate" type="text/html" href="https://wikicshse.ru/index.php?title=Python_Programming_DSBA_2024/25&amp;action=history"/>
	<updated>2026-06-06T12:09:39Z</updated>
	<subtitle>История изменений этой страницы в вики</subtitle>
	<generator>MediaWiki 1.45.3</generator>
	<entry>
		<id>https://wikicshse.ru/index.php?title=Python_Programming_DSBA_2024/25&amp;diff=595&amp;oldid=prev</id>
		<title>imported&gt;Aspronina: Migrated current public revision from wiki.cs.hse.ru</title>
		<link rel="alternate" type="text/html" href="https://wikicshse.ru/index.php?title=Python_Programming_DSBA_2024/25&amp;diff=595&amp;oldid=prev"/>
		<updated>2024-12-21T09:07:24Z</updated>

		<summary type="html">&lt;p&gt;Migrated current public revision from wiki.cs.hse.ru&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Новая страница&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In case you find any inconsistencies on this page, please, contact [https://t.me/l_AnnaPronina_l @l_AnnaPronina_l].&lt;br /&gt;
&lt;br /&gt;
== Teachers and assistants ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align:center&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Group !! 241 !! 242 !! 243 !! 244 !! 245 !! 246&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;7&amp;quot; | [https://www.hse.ru/en/staff/voznesenskaya Voznesenskaya T.V.]&lt;br /&gt;
[mailto:tvoznesenskaya@hse.ru tvoznesenskaya@hse.ru], tg: [https://tlgg.ru/tvozn @tvozn]&lt;br /&gt;
|- &lt;br /&gt;
|| Workshop Instructor &lt;br /&gt;
|| 241-1, 241-2: &amp;lt;br&amp;gt; [https://www.hse.ru/org/persons/65846258 Rudakov K.A.] &amp;lt;br&amp;gt; tg: [https://t.me/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|| 242-1, 242-2: &amp;lt;br&amp;gt; [https://www.hse.ru/org/persons/65846258 Rudakov K.A.] &amp;lt;br&amp;gt; tg: [https://t.me/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|| 243-1, 243-2: &amp;lt;br&amp;gt; [https://www.hse.ru/org/persons/863761973?ysclid=lnmyq0a9cw303039182 Kopylov I.S.] &amp;lt;br&amp;gt; tg: [https://t.me/DanielWalker @DanielWalker]&lt;br /&gt;
|| 244-1, 244-2: &amp;lt;br&amp;gt; [https://www.hse.ru/org/persons/863761973?ysclid=lnmyq0a9cw303039182 Kopylov I.S.] &amp;lt;br&amp;gt; tg: [https://t.me/DanielWalker @DanielWalker]&lt;br /&gt;
|| 245-1: &amp;lt;br&amp;gt; Dovgopolyi I.A. &amp;lt;br&amp;gt; tg: [https://t.me/TriariiMisha @TriariiMisha] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 245-2: &amp;lt;br&amp;gt; Yartsev M.S. &amp;lt;br&amp;gt; tg: [https://t.me/Mischay @Mischay]&lt;br /&gt;
|| 246-1, 246-2: &amp;lt;br&amp;gt; Chechulina L.M. &amp;lt;br&amp;gt; tg: [https://t.me/love_chechulina @love_chechulina]&lt;br /&gt;
|- &lt;br /&gt;
|| Teaching Assistant&lt;br /&gt;
| colspan=&amp;quot;2&amp;quot; | Shakhmin Pavel &amp;lt;br&amp;gt; tg: [https://t.me/rotanimoddFPV @rotanimoddFPV]&lt;br /&gt;
| colspan=&amp;quot;2&amp;quot; | Argirov George &amp;lt;br&amp;gt; tg: [https://t.me/gotchaya @gotchaya]&lt;br /&gt;
|| Khudyakov Nikita &amp;lt;br&amp;gt; tg: [https://t.me/wildwoolywander @wildwoolywander]&lt;br /&gt;
|| Kulakov Denis &amp;lt;br&amp;gt; tg: [https://t.me/Kulakov_Denis @Kulakov_Denis]&lt;br /&gt;
|-&lt;br /&gt;
|| Head TA&lt;br /&gt;
| colspan=&amp;quot;7&amp;quot; | Pronina Anna &amp;lt;br&amp;gt; tg: [https://t.me/l_AnnaPronina_l @l_AnnaPronina_l]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
[[Файл:DSBA_Python_grade_formula_2024.png|800px|caption]]&lt;br /&gt;
&lt;br /&gt;
== Contests ==&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align:center&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Contest !! Deadline !! Topic&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/67694/enter/ Contest 1] || 22 sep 2024, 23:59:59  || Arithmetics&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/67988/enter/ Contest 2] || 29 sep 2024, 23:59:59  || While, float, string&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/68411/enter/ Contest 3] || 6 oct 2024, 23:59:59  || Lists and tuples&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/68839/enter/ Contest 4] || 13 oct 2024, 23:59:59  || Functions&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/69171/enter/ Contest 5] || 20 oct 2024, 23:59:59  || Sets and Dictionaries&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/69773/enter/ Contest 6] || 10 nov 2024, 23:59:59  || Sorting and Searching&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/71421/enter/ Contest 7] || 1 dec 2024, 23:59:59  || Algorithms and Data Structures&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/72037/enter/ Contest 8] || 15 dec 2024, 23:59:59 || Functional programming&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/72758/enter/ Contest 9] || 17 dec 2024, 23:59:59 || OOP (✨bonus for all groups✨)&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Contest Restrictions ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Contest !! Special Requirements&lt;br /&gt;
|-&lt;br /&gt;
|| Contest 1 || &lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#18:&amp;#039;&amp;#039;&amp;#039; do not use nonlinear constructions: branches, cycles, functions&lt;br /&gt;
|-&lt;br /&gt;
|| Contest 2 || &lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#11:&amp;#039;&amp;#039;&amp;#039; do not use conditionals, do not use loops &amp;lt;br&amp;gt; &lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#13:&amp;#039;&amp;#039;&amp;#039; do not use conditionals, do not use loops &amp;lt;br&amp;gt; &lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#17:&amp;#039;&amp;#039;&amp;#039; do not use loops, do not use .count()&lt;br /&gt;
|-&lt;br /&gt;
|| Contest 3|| &lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#1:&amp;#039;&amp;#039;&amp;#039; do not perform unnecessary actions &amp;lt;br&amp;gt; &lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#10:&amp;#039;&amp;#039;&amp;#039; do not change the list &amp;lt;br&amp;gt; &lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#11:&amp;#039;&amp;#039;&amp;#039; you must change the list &amp;lt;br&amp;gt; &lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#14:&amp;#039;&amp;#039;&amp;#039; you must change the list &amp;lt;br&amp;gt; &lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#15:&amp;#039;&amp;#039;&amp;#039; you must change the list, you are not allowed to use additional lists &amp;lt;br&amp;gt; &lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#16:&amp;#039;&amp;#039;&amp;#039; you must change the list, you are not allowed to use additional lists and .insert() &amp;lt;br&amp;gt; &lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#20:&amp;#039;&amp;#039;&amp;#039; you must change the list, you can do only one pass through the list, you are not allowed to use additional lists&lt;br /&gt;
|-&lt;br /&gt;
|| Contest 4 ||&lt;br /&gt;
In all problems of this contest, please, make sure that the function&amp;#039;s name, &amp;lt;br&amp;gt;&lt;br /&gt;
parameters and return type correspond to the problem statement &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#8:&amp;#039;&amp;#039;&amp;#039; do not use pow(), do not use loops, do not use ** &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#9:&amp;#039;&amp;#039;&amp;#039; complexity O(sqrt(n)) &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#10:&amp;#039;&amp;#039;&amp;#039; complexity O(sqrt(n)) &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#11:&amp;#039;&amp;#039;&amp;#039; do not use pow(), do not use ** &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#12:&amp;#039;&amp;#039;&amp;#039; use +1 and -1 only, do not use loops &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#13:&amp;#039;&amp;#039;&amp;#039; complexity O(log(n)) &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#16:&amp;#039;&amp;#039;&amp;#039; do not use loops, recursion is obligatory &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#18:&amp;#039;&amp;#039;&amp;#039; do not use lists, strings or similar data structures &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#19:&amp;#039;&amp;#039;&amp;#039; do not use lists, strings or similar data structures &amp;lt;br&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|| Contest 5 ||&lt;br /&gt;
no special requirements 🥳&lt;br /&gt;
|-&lt;br /&gt;
|| Contest 6 ||&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#1:&amp;#039;&amp;#039;&amp;#039; do not use additional lists, do not change the list &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#3:&amp;#039;&amp;#039;&amp;#039; complexity O(n) &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#4:&amp;#039;&amp;#039;&amp;#039; complexity O(n) &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#5:&amp;#039;&amp;#039;&amp;#039; do not use in-built functions, implement [https://en.m.wikipedia.org/wiki/Counting_sort Counting Sort Algorithm] &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#10:&amp;#039;&amp;#039;&amp;#039; do not use in-built functions, complexity O(len(A)+len(B)) &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#11:&amp;#039;&amp;#039;&amp;#039; do not store the contents of the whole file in memory, only one line at a time &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#13:&amp;#039;&amp;#039;&amp;#039; do not store the contents of the whole file in memory, only one line at a time &amp;lt;br&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|| Contest 7 ||&lt;br /&gt;
no special requirements 🥳&lt;br /&gt;
|-&lt;br /&gt;
|| Contest 8 ||&lt;br /&gt;
no special requirements 🥳&lt;br /&gt;
|-&lt;br /&gt;
|| Contest 9 ||&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#1 (А):&amp;#039;&amp;#039;&amp;#039; the constructor must copy the list of lists, when changing the lists from which the matrix was designed, the contents of the matrix should not change &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#2 (B):&amp;#039;&amp;#039;&amp;#039; the methods should not change the contents of the matrix  &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#3 (C):&amp;#039;&amp;#039;&amp;#039; 1) the &amp;#039;&amp;#039;&amp;#039;transpose&amp;#039;&amp;#039;&amp;#039; method modifies the instance of the Matrix class;  2) the &amp;#039;&amp;#039;&amp;#039;transposed&amp;#039;&amp;#039;&amp;#039; method must be static  &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#6 (F):&amp;#039;&amp;#039;&amp;#039; use fast power &amp;lt;br&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Defences ===&lt;br /&gt;
&lt;br /&gt;
You may be asked to &amp;#039;&amp;#039;&amp;#039;defend&amp;#039;&amp;#039;&amp;#039; your HW solutions. This means that you are invited to discuss what you have done in your work with a seminar instructor or a TA. The defenses take places &amp;#039;&amp;#039;&amp;#039;offline&amp;#039;&amp;#039;&amp;#039;, the time is scheduled independently each time with consideration of the both sides’ timetables. You will be notified about the upcoming event in the &amp;#039;&amp;#039;&amp;#039;direct messages in Telegram&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
During the defence you may be asked to:&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;explain&amp;#039;&amp;#039;&amp;#039; your solution &lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;modify&amp;#039;&amp;#039;&amp;#039; your code with correspondence to some new conditions stated by the instructor/assistant &lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;solve&amp;#039;&amp;#039;&amp;#039; the same or a similar problem either on paper or in IDE - it is up to the instructor/assistant’s choice&lt;br /&gt;
* identify (&amp;#039;&amp;#039;&amp;#039;recognize&amp;#039;&amp;#039;&amp;#039;) your solution among some others&lt;br /&gt;
* etc.&lt;br /&gt;
&lt;br /&gt;
Please, take into account that if you do no show up on the defense, you automatically get &amp;#039;&amp;#039;&amp;#039;0&amp;#039;&amp;#039;&amp;#039; points for the contest that was about to be discussed.&lt;br /&gt;
&lt;br /&gt;
In case of plagiarism, one task nullifies the entire work.&lt;br /&gt;
&lt;br /&gt;
If (in % of full mark) &amp;#039;&amp;#039;&amp;#039;Contests - CW(midterm) &amp;gt;= 50&amp;#039;&amp;#039;&amp;#039; then RP for сontests (all with the deadlines earlier, then CW) will be divided by &amp;#039;&amp;#039;&amp;#039;2&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
== Grades ==&lt;br /&gt;
&lt;br /&gt;
The results table with all your grades can be found by [https://docs.google.com/spreadsheets/d/1jfZF8RoFDtfUngAqTIdqJOrLll8sNDEp4DIWE0btscE/edit?gid=0#gid=0 this link].&lt;br /&gt;
&lt;br /&gt;
== Lecture notes and Workshop materials ==&lt;br /&gt;
&lt;br /&gt;
=== Lecture slides ===&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align:center&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Date !! Lecture !! Topic&lt;br /&gt;
|-&lt;br /&gt;
| 5 sep || [https://drive.google.com/file/d/1Lv9h835v2_KxaWDYUoHu05RSii-PO1RY/view?usp=sharing Lecture 1] ||  Introduction&lt;br /&gt;
|-&lt;br /&gt;
| 9 sep || [https://drive.google.com/file/d/1BvmSdsTFOQ5k7kWdIvmqIrFqNqX29CcT/view?usp=sharing Lecture 2] || Numeral systems. Real numbers. Strings&lt;br /&gt;
|-&lt;br /&gt;
| 16 sep || [https://drive.google.com/file/d/1qWNj9Y4C-BlIrEX1tSCBUqYyvOw25NUh/view?usp=sharing Lecture 3] || Lists and tuples&lt;br /&gt;
|-&lt;br /&gt;
| 30 sep || [https://drive.google.com/file/d/1dZmvrSMASR-y__oJVnR16EdxLgnTtCWJ/view?usp=sharing Lecture 4] || Functions and recursion&lt;br /&gt;
|-&lt;br /&gt;
| 30 sep || [https://drive.google.com/file/d/123WYNeAuEy_cFiDQNj7jD6wqAGmsn2TA/view?usp=sharing Lecture 5] || Sets and dictionaries&lt;br /&gt;
|-&lt;br /&gt;
| 7 oct || [https://drive.google.com/file/d/1O4JDCFOGryXzejcqoYgjxigyGxEuQXxR/view?usp=sharing Lecture 6] || Exceptions and errors&lt;br /&gt;
|-&lt;br /&gt;
| 7 oct || [https://drive.google.com/file/d/11y8DaoevlYX8sPyHXcDCAZgttlnMEaDf/view?usp=sharing Lecture 7] || PEP-8&lt;br /&gt;
|-&lt;br /&gt;
| 21 oct || [https://drive.google.com/file/d/11vyr3xNCIch1vhb7NlCEGfMyOoj2kv57/view?usp=sharing Lecture 8] || Sorting and searching&lt;br /&gt;
|-&lt;br /&gt;
| 11 nov || [https://drive.google.com/file/d/1gehUbWtGopnJy-HE7XgVScGIK5FyqTT9/view?usp=drivesdk Lecture 9] || Numpy and Pandas&lt;br /&gt;
|-&lt;br /&gt;
| 18 nov || [https://drive.google.com/file/d/1hl5_9FIpmjf5tKi4JVesMgKEMwZM2eRr/view?usp=drivesdk Lecture 10] || Data structures &lt;br /&gt;
|-&lt;br /&gt;
| 25 nov || [https://drive.google.com/file/d/1S5Qq3GwtXXGCcySvS4EfzH7tQ8EpJtjq/view?usp=sharing Lecture 11] || Data visualisation&lt;br /&gt;
|-&lt;br /&gt;
| 28 nov || [https://drive.google.com/file/d/1ZL2cGbDHnTBekiubkmp6y20w6nVUADRc/view?usp=sharing Lecture 12] || Functional programming  &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Workshop notebooks ===&lt;br /&gt;
&lt;br /&gt;
All the workshop notebooks may be found by [https://drive.google.com/drive/u/0/folders/1eF0VLME0DiTe0exZ4mu_xC11ITDa7NX_ this link].&lt;br /&gt;
&lt;br /&gt;
==Control work==&lt;br /&gt;
&lt;br /&gt;
The midterm will be conducted on &amp;#039;&amp;#039;&amp;#039;Monday, October 14, at 9:30&amp;#039;&amp;#039;&amp;#039; in the &amp;#039;&amp;#039;&amp;#039;offline&amp;#039;&amp;#039;&amp;#039; format.&lt;br /&gt;
&lt;br /&gt;
All the details you can find [[Python Programming DSBA 2024/25 / Midterm|here]].&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&lt;br /&gt;
All the information regarding your course project can be found by accessing [[Python Programming DSBA 2024/25 / Project|this page]].&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
Your exam will be conducted on &amp;#039;&amp;#039;&amp;#039;Saturday, December 21, at 14:40&amp;#039;&amp;#039;&amp;#039; in the &amp;#039;&amp;#039;&amp;#039;offline&amp;#039;&amp;#039;&amp;#039; format.&lt;br /&gt;
&lt;br /&gt;
All the details you can find [[Python Programming DSBA 2024/25 / Exam|here]].&lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/ba/data/courses/936176275.html&lt;/div&gt;</summary>
		<author><name>imported&gt;Aspronina</name></author>
	</entry>
</feed>