<?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_2023%2F24</id>
	<title>Python Programming DSBA 2023/24 - История изменений</title>
	<link rel="self" type="application/atom+xml" href="https://wikicshse.ru/index.php?action=history&amp;feed=atom&amp;title=Python_Programming_DSBA_2023%2F24"/>
	<link rel="alternate" type="text/html" href="https://wikicshse.ru/index.php?title=Python_Programming_DSBA_2023/24&amp;action=history"/>
	<updated>2026-06-06T12:10:11Z</updated>
	<subtitle>История изменений этой страницы в вики</subtitle>
	<generator>MediaWiki 1.45.3</generator>
	<entry>
		<id>https://wikicshse.ru/index.php?title=Python_Programming_DSBA_2023/24&amp;diff=591&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_2023/24&amp;diff=591&amp;oldid=prev"/>
		<updated>2023-12-20T09:16:42Z</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 !! 231 !! 232 !! 233 !! 234 !! 235&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;6&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;
|| 231-1: &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]  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 231-2: &amp;lt;br&amp;gt; [https://www.hse.ru/org/persons/863761957 Smirnov I.V.] &amp;lt;br&amp;gt; tg: [https://t.me/JanKrig @JanKrig]&lt;br /&gt;
|| 232-1: &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] &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 232-2: &amp;lt;br&amp;gt; [https://www.hse.ru/org/persons/863761957 Smirnov I.V.] &amp;lt;br&amp;gt; tg: [https://t.me/JanKrig @JanKrig]&lt;br /&gt;
|| 233-1, 233-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] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 234-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; 234-2: &amp;lt;br&amp;gt; [https://www.hse.ru/org/persons/305080854?ysclid=lnswey1uk8899184089 Ivanov A.P.] &amp;lt;br&amp;gt; tg: [https://t.me/Olenek0 @Olenek0]&amp;lt;br&amp;gt;&lt;br /&gt;
|| 235-1, 235-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] &amp;lt;br&amp;gt;&lt;br /&gt;
|- &lt;br /&gt;
|| Teaching Assistant&lt;br /&gt;
|| 231-1: &amp;lt;br&amp;gt; Pronina Anna &amp;lt;br&amp;gt; tg: [https://t.me/l_AnnaPronina_l @l_AnnaPronina_l]  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 231-2: &amp;lt;br&amp;gt; Kulakov Denis &amp;lt;br&amp;gt; tg: [https://t.me/Kulakov_Denis @Kulakov_Denis]&lt;br /&gt;
|| 232-1: &amp;lt;br&amp;gt; Pronina Anna &amp;lt;br&amp;gt; tg: [https://t.me/l_AnnaPronina_l @l_AnnaPronina_l]  &amp;lt;br&amp;gt;&amp;lt;br&amp;gt; 232-2: &amp;lt;br&amp;gt; Kulakov Denis &amp;lt;br&amp;gt; tg: [https://t.me/Kulakov_Denis @Kulakov_Denis]&lt;br /&gt;
|| 233-1, 233-2: &amp;lt;br&amp;gt; Shakhmin Pavel &amp;lt;br&amp;gt; tg: [https://t.me/rotanimoddFPV @rotanimoddFPV]&lt;br /&gt;
|| 234-1, 234-2: &amp;lt;br&amp;gt;  Argirov George &amp;lt;br&amp;gt; tg: [https://t.me/gotchaya @gotchaya]&lt;br /&gt;
|| 235-1, 235-2: &amp;lt;br&amp;gt;  Valami Benyamin &amp;lt;br&amp;gt; tg: [https://t.me/MaxmilesV @MaxmilesV]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|| Head TA&lt;br /&gt;
| colspan=&amp;quot;6&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;
[[Файл:formula_Python_2023_new.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/52133/enter/ Contest 1] || 24 sep 2023, 23:59:59  || Arithmetics&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/52153/enter/ Contest 2] || 1 oct 2023, 23:59:59  || While, float, strings&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/52941/enter/ Contest 3] || 9 oct 2023, 23:59:59  || Lists and tuples&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/53475/enter/ Contest 4] || 16 oct 2023, 23:59:59  || Functions&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/53874/enter/ Contest 5] || 23 oct 2023, 23:59:59  || Sets and dictionaries&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/54226/enter/ Contest 6] || 6 nov 2023, 23:59:59  || Sorting and searching&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/56807/enter/ Contest 7] || 11 dec 2023, 23:59:59  || Algorithms and data structures&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/57220/enter/ Contest 8] || 16 dec 2023, 23:59:59  || Functional programming&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; use +, -, *, /, //, %, ** only &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;#10:&amp;#039;&amp;#039;&amp;#039; do not change the initial list &amp;lt;br&amp;gt; &lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#11:&amp;#039;&amp;#039;&amp;#039; it is a must to change the initial list &amp;lt;br&amp;gt; &lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#15:&amp;#039;&amp;#039;&amp;#039; it is a must to change initial list, do not use additional lists &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#16:&amp;#039;&amp;#039;&amp;#039; it is a must to change initial list, do not use additional lists, do not use .insert() &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#20:&amp;#039;&amp;#039;&amp;#039; one pass through the list only&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;#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 &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 change initial list, do not use additional lists, one pass through the list only &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; function count_sort(A), which modifies the list passed to it, do not use in-built sorting functions/methods &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#10:&amp;#039;&amp;#039;&amp;#039; do not change initial lists, complexity O(len(A)+len(B)), do not use in-built sorting functions/methods &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 content of the file in memory &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;#12:&amp;#039;&amp;#039;&amp;#039; do not store the content of the file in memory &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 content of the file in memory &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;
the contest tasks are to be done using functional programming&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;
== Grades ==&lt;br /&gt;
&lt;br /&gt;
The results table with all your grades can be found by [https://docs.google.com/spreadsheets/d/1YWzSJhQJDGuVQXnPwf-raJEApaCdNU9CtPEACFMISQc/edit?usp=sharing this link].&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&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;
| 11 sep || [https://drive.google.com/file/d/1c4WKykTCu_6oHszQv0Gil7EhC1BfMo3W/view?usp=sharing Lecture 1] ||  Introduction&lt;br /&gt;
|-&lt;br /&gt;
| 18 sep || [https://drive.google.com/file/d/1tYi02lfKegixiBfGvDNQTgOi2mEveRnr/view?usp=sharing Lecture 2] || Numeral systems. Real numbers. Strings&lt;br /&gt;
|-&lt;br /&gt;
| 25 sep || [https://drive.google.com/file/d/1uyDea3oe3Nwok8DLsyMJ2LEi1Lh_pmHT/view?usp=sharing Lecture 3] || Lists and tuples&lt;br /&gt;
|-&lt;br /&gt;
| 2 oct || [https://drive.google.com/file/d/17avfsO2VORhY8TBEHjE1Wf54BL6MDTk3/view?usp=sharing Lecture 4] || Functions and recursion&lt;br /&gt;
|-&lt;br /&gt;
| 16 oct || [https://drive.google.com/file/d/1gUSSwxaIy2Oh11ka6p1-SHOkyS3a27hG/view?usp=sharing Lecture 5] || Sorting and searching algorithms&lt;br /&gt;
|-&lt;br /&gt;
| 6 nov || [https://drive.google.com/file/d/1fBE_QQpXXuSEUVm5YHM0Ciyu5SD7ZJa2/view?usp=sharing Lecture 6] || NumPy and Pandas&lt;br /&gt;
|-&lt;br /&gt;
| 13 nov || [https://drive.google.com/file/d/1IdkLlz0fdCweOxpk5Vn4YaHYqBStXfLL/view?usp=sharing Lecture 7] || Data visualization&lt;br /&gt;
|-&lt;br /&gt;
| 13 nov || [https://drive.google.com/file/d/1RhwsgnD7uOcd2TCADXyL71VL4ioMilWF/view?usp=sharing Notebook] &amp;lt;br&amp;gt; [https://drive.google.com/file/d/1ovJpzd-QfFA0mAmNyodOHO6PEOSfkirE/view?usp=sharing Dataset] || The Titanic example&lt;br /&gt;
|-&lt;br /&gt;
| 27 nov || [https://drive.google.com/file/d/1IYR9HbD5im6VvHO_hfHFVVf_LnbNHyjq/view?usp=sharing Lecture 8] || Data structures: Stack, Queue, Deque. Graphs.&lt;br /&gt;
|-&lt;br /&gt;
| 4 dec || [https://drive.google.com/file/d/1ddigf0sO6gWbONbWYSXSeJBGeDcPcXrN/view?usp=sharing Lecture 9] || Functional programming&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1dCpdCjHx4TyluhPDnJtkKrcT3rCS7C9x/view?usp=sharing Workshop 1: Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1No9ZnP-sQx6m4M-naezzWYsevSvrOIr6/view?usp=sharing Workshop 2: Numeral systems] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1XUEBYFAPvL1KGct5Pu0lW7j6wClbaqO1/view?usp=sharing Workshop 3: Float and Strings] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1YC67EjbRtLDieTZp8ejffL5lpm9aRhgP/view?usp=sharing Workshop 4: Strings] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1e_Rr-QA0QpdGramChDmnFan5RaX01PdM/view?usp=sharing Workshop 5: Lists and tuples] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Q613DRQC0K82mME8_s9BaHgj6KPip1ZS/view?usp=sharing Workshop 6: Lists and tuples] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cv8E-o68qrjqPUJ4W3jvIILBByzQ5TEs/view?usp=sharing Workshops 7-8: Functions and recursion] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1ZiWaE6rk9Y-5glXiAu5FE2FOxSCUnsna/view?usp=sharing Workshop 9: Sets and dictionaries] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1fLfU1FdOQDQu5YG-lyIFkTIA2FtqLNjt/view?usp=sharing Workshop 10: Sets and dictionaries] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1_z0f8EO5ZhtYA0UBm0rUSiFeUo-vZy2h/view?usp=sharing Workshop 11: Sort and search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/108tA9g7nhwU8AbqQX-2PiWAayZ_aNlZJ/view?usp=sharing Workshop 12: Files, exceptions and errors] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://colab.research.google.com/drive/1koAMZOlmZjcjsQdbW9hKnq0PE_5BAPhj?usp=share_link Workshop 13: NumPy] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1-G5HFY3I7hTFNuaW0nMDUXu8Bs-ytSrK/view?usp=share_link Workshop 14: Pandas] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1mkNxs0bgWbR9DncjpXZPa7K_15w0e0-s/view?usp=sharing Workshop 15: Visualization] &amp;lt;br&amp;gt;&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 23, at 18:10&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 2023/24 / 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 2023/24 / Project|this page]].&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
The exam will be conducted on &amp;#039;&amp;#039;&amp;#039;Thursday, December 21, at 13:00&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 2023/24 / Exam|here]].&lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/ba/data/courses/848422882.html&lt;/div&gt;</summary>
		<author><name>imported&gt;Aspronina</name></author>
	</entry>
</feed>