<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="ru">
	<id>https://wiki.cs.hse.ru/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Gzhulikov</id>
	<title>Wiki - Факультет компьютерных наук - Вклад [ru]</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.cs.hse.ru/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Gzhulikov"/>
	<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/%D0%A1%D0%BB%D1%83%D0%B6%D0%B5%D0%B1%D0%BD%D0%B0%D1%8F:%D0%92%D0%BA%D0%BB%D0%B0%D0%B4/Gzhulikov"/>
	<updated>2026-09-21T05:47:02Z</updated>
	<subtitle>Вклад</subtitle>
	<generator>MediaWiki 1.43.9</generator>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_2_DSBA_2022/2023&amp;diff=77211</id>
		<title>Introduction to Programming 2 DSBA 2022/2023</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_2_DSBA_2022/2023&amp;diff=77211"/>
		<updated>2023-03-24T13:12:30Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Control Work 24 March */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&lt;br /&gt;
&#039;&#039;&#039;&#039;&#039;Please, do not consider this page as the main one, it is just an addition to the [https://edu.hse.ru/course/view.php?id=135428 official course page] on SmartLMS platform. In case of any inconsistencies, please, follow the instructions given there.&#039;&#039;&#039;&#039;&#039;&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 !! 221 !! 222 !! 223 !! 224&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&amp;quot; | [https://www.hse.ru/org/persons/190888348?ysclid=l9mq967pw4205659969 Zhulikov G.A.] &amp;lt;br&amp;gt; [mailto:gzhulikov@hse.ru gzhulikov@hse.ru] &amp;lt;br&amp;gt; tg: [https://t.me/l8doku @l8doku]&lt;br /&gt;
|- &lt;br /&gt;
|| Workshop Instructor &lt;br /&gt;
|| 221-1, 221-2: [https://www.hse.ru/staff/sshershakov/timetable?ysclid=lc6j6ae6nw831682911 Shershakov S.A.] &amp;lt;br&amp;gt; [mailto:sshershakov@hse.ru sshershakov@hse.ru] &amp;lt;br&amp;gt; tg: [https://t.me/sshersh @sshersh] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 222-1: [https://www.hse.ru/staff/sshershakov/timetable?ysclid=lc6j6ae6nw831682911 Shershakov S.A.] &amp;lt;br&amp;gt; [mailto:sshershakov@hse.ru sshershakov@hse.ru] &amp;lt;br&amp;gt; tg: [https://t.me/sshersh @sshersh] &amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
222-2: [https://www.hse.ru/org/persons/190888348?ysclid=l9mq967pw4205659969 Zhulikov G.A.] &amp;lt;br&amp;gt; [mailto:gzhulikov@hse.ru gzhulikov@hse.ru] &amp;lt;br&amp;gt; tg: [https://t.me/l8doku @l8doku]&lt;br /&gt;
|| 223-1, 223-2:  [https://www.hse.ru/org/persons/65846258 Rudakov K.A.] &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] &amp;lt;br&amp;gt; tg: [https://t.me/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 224-1: [https://www.hse.ru/org/persons/65846258 Rudakov K.A.] &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] &amp;lt;br&amp;gt; tg: [https://t.me/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
224-2: [https://www.hse.ru/staff/gordenko?ysclid=lemtrkpqoy898759597 Gordenko M.K.] &amp;lt;br&amp;gt; [mailto:mgordenko@hse.ru mgordenko@hse.ru] &amp;lt;br&amp;gt; tg: [https://t.me/oduvan_ja @oduvan_ja]&lt;br /&gt;
|-&lt;br /&gt;
|| Assistant &lt;br /&gt;
|| Makarenkov Artem &amp;lt;br&amp;gt; tg: [https://t.me/Artem_Makarenkov @Artem_Makarenkov]&lt;br /&gt;
|| Kulakov Denis &amp;lt;br&amp;gt; tg: [https://t.me/Kulakov_Denis @Kulakov_Denis]&lt;br /&gt;
|| Shestakov Artem &amp;lt;br&amp;gt; tg: [https://t.me/aptemvs @aptemvs]&lt;br /&gt;
|| Fomin Gena &amp;lt;br&amp;gt; tg: [https://t.me/Genfom @Genfom]&lt;br /&gt;
&lt;br /&gt;
|-&lt;br /&gt;
|| Head TA&lt;br /&gt;
| colspan=&amp;quot;5&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;
[[Файл:formulaItoP.png|centre|800px|caption]]&lt;br /&gt;
&lt;br /&gt;
== Study materials ==&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;
! Week !! Topic !! Lecture slides !! Lecture recordings !! Workshop materials&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  1 &lt;br /&gt;
|| Introduction&lt;br /&gt;
|| [https://docs.google.com/presentation/d/191JRRGUfpD5gkqK_2mTqLJv5N60_8PL_J7r3jIsSwMI/edit?usp=sharing Lecture 01]&lt;br /&gt;
|| [https://drive.google.com/file/d/1HypR2UKvAtip-mCauVYBoz1lahpW4BNv/view?usp=sharing Lecture 01]&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  [https://github.com/dsba-z/week1cpp2022 Seminars 01-02]&lt;br /&gt;
|- &lt;br /&gt;
|| Basics&lt;br /&gt;
|| [https://docs.google.com/presentation/d/19Kt-uh1V1R_tvMw07S1XV7eg1ED_blFgk9atwnZZQGc/edit?usp=sharing Lecture 02]&lt;br /&gt;
|| [https://drive.google.com/file/d/1IpvWz9wN4EGi2dTDJ4PdyJTTczEb0AcE/view?usp=sharing Lecture 02]&lt;br /&gt;
|- &lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  2 &lt;br /&gt;
|| Control Flow&lt;br /&gt;
|| [https://docs.google.com/presentation/d/1Lkf-1ijgoEK7KwtEAvBmQS_ohtURi1Y140JdzpowZ6k/edit?usp=sharing Lecture 03]&lt;br /&gt;
|| [https://drive.google.com/file/d/1lffwnasDD-ojkEo6PZ7KVCOUUEaqgP58/view?usp=sharing Lecture 03]&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  [https://github.com/dsba-z/week2cpp2022 Seminars 03-04]&lt;br /&gt;
|-&lt;br /&gt;
|| Strings and Streams&lt;br /&gt;
|| [https://docs.google.com/presentation/d/1TevnKa_Bd48R5OWZiZTHjpqVYf2uuU3h_Urj_JTwiZw/edit?usp=sharing Lecture 04]&lt;br /&gt;
|| [https://drive.google.com/file/d/1w3n96gH9ieYLueIYjjBlYPCOkcugNdX0/view?usp=sharing Lecture 04]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  3&lt;br /&gt;
|| Procedural Decomposition&lt;br /&gt;
|| [https://docs.google.com/presentation/d/1p1km8PWYiwEG8N_PUWK_Z0iP3rPopW68BdxoZXLvo4k/edit?usp=sharing Lecture 05]&lt;br /&gt;
|| [Lecture 05]&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  [https://github.com/dsba-z/week3cpp2022 Seminars 05-06]&lt;br /&gt;
|-&lt;br /&gt;
|| References&lt;br /&gt;
|| [https://docs.google.com/presentation/d/1EqzPkeNCwgunzXLBl1QeLD6zmztpEMNkBhbwX2WIYqI/edit?usp=sharing Lecture 06]&lt;br /&gt;
|| [https://drive.google.com/file/d/1hvKJhTkr9sjlzSiqzKTXItblDL6gQvJ6/view?usp=sharing Lecture 06]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  4&lt;br /&gt;
|| STL&lt;br /&gt;
|| [https://docs.google.com/presentation/d/1QedQq6J0aRysTLVFkBpz_-tm428aeU8iSny_xO_lfeU/edit?usp=sharing Lecture 07]&lt;br /&gt;
|| [Lecture 07]&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  [https://github.com/dsba-z/week4cpp2022 Seminars 07-08]&lt;br /&gt;
|-&lt;br /&gt;
|| Iterators&lt;br /&gt;
|| [https://docs.google.com/presentation/d/15KEyaL85g3Ho8DE4MusB9F6BK8AlvZwrLKacEmGMZMU/edit?usp=sharing Lecture 08]&lt;br /&gt;
|| [https://drive.google.com/file/d/1dsxxOsALElROhOL78Tb5NiDLmN-oFuNY/view?usp=sharing Lecture 08]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  5&lt;br /&gt;
|| Sets and Maps&lt;br /&gt;
|| [https://docs.google.com/presentation/d/1Z0ohj2WbfRsfNj7k_U9hZbS0MfpKpa4KW6TKvct8jj4/edit?usp=sharing Lecture 09]&lt;br /&gt;
|| [Lecture 09]&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  [https://github.com/dsba-z/week5cpp2022 Seminars 09-10]&lt;br /&gt;
|-&lt;br /&gt;
|| Ranges and Custom Comparators&lt;br /&gt;
|| [https://docs.google.com/presentation/d/19sPGV_j-GsM-FPPCJnVS9Xgmxc3TRls8uzBZ7qf29Eo/edit?usp=share_link Lecture 10]&lt;br /&gt;
|| [Lecture 10]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  6&lt;br /&gt;
|| QUIZ discussion&lt;br /&gt;
||     ...&lt;br /&gt;
|| [Lecture 11] &lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  [https://github.com/dsba-z/week6cpp2021 Seminars 11-12]&lt;br /&gt;
|-&lt;br /&gt;
|| QUIZ discussion&lt;br /&gt;
||     ...     &lt;br /&gt;
|| [Lecture 12] &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  7&lt;br /&gt;
|| Structures&lt;br /&gt;
|| [https://docs.google.com/presentation/d/1xUmB_BvZIpeKPQ9ajbHoennHPA10LNmwpPbTNaAg89g/edit?usp=sharing Lecture 13]&lt;br /&gt;
|| [Lecture 13]&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  [https://github.com/dsba-z/week7cpp2022 Seminars 13-14]&lt;br /&gt;
|-&lt;br /&gt;
|| Structures. Pointers. Classes&lt;br /&gt;
|| [https://docs.google.com/presentation/d/1l4wwl1HE6V5OmEifFJ1Sz2wkOwRj34YYyGKApHDqM4I/edit?usp=sharing Lecture 14]&lt;br /&gt;
|| [Lecture 14]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  8&lt;br /&gt;
|| Classes. Constructors&lt;br /&gt;
|| [https://docs.google.com/presentation/d/1CMirvFEqdJHUz4OUwCiRrnaMC9J9viszJhYtvAVXJws/edit?usp=sharing Lecture 15]&lt;br /&gt;
|| [Lecture 15]&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  [https://github.com/dsba-z/week8cpp2022-vector Seminars 15-16]&lt;br /&gt;
|-&lt;br /&gt;
|| Classes. Operator Overloading&lt;br /&gt;
|| [https://docs.google.com/presentation/d/1lkhLNOxteGxFX0hykzJ9kqLgAv6rcRea1UiZxEUsZHk/edit?usp=sharing Lecture 16]&lt;br /&gt;
|| [Lecture 16]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  9&lt;br /&gt;
|| Exceptions. Errors&lt;br /&gt;
|| [https://docs.google.com/presentation/d/13r32cqErS3YBDW3yATWRxkkxzJJOWG_Ryg6U0jHHKCA/edit?usp=sharing Lecture 17]&lt;br /&gt;
|| [Lecture 17]&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  [https://github.com/dsba-z/week9cpp2022 Seminars 17-18]&lt;br /&gt;
|-&lt;br /&gt;
|| Templates&lt;br /&gt;
|| [https://docs.google.com/presentation/d/1XJmhguJMPZnZr9NvfWnxu3vHR6P7QFlP-m5BTyZHrkc/edit?usp=sharing Lecture 18]&lt;br /&gt;
|| [Lecture 18]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  10&lt;br /&gt;
|| Bitwise operations. Enums&lt;br /&gt;
|| [https://docs.google.com/presentation/d/1av1gLmLg_Ufu7ptCNlnpb3Zx5DksJ8LST7jddqQhDbw/edit?usp=sharing Lecture 19]&lt;br /&gt;
|| [Lecture 19]&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  [https://github.com/dsba-z/week10cpp2022 Seminars 19-20]&lt;br /&gt;
|-&lt;br /&gt;
|| Type casting. Enum. Enums class&lt;br /&gt;
|| [https://docs.google.com/presentation/d/1R0dRmqBRPJ5hA4hZXJ9ZLg0vP4R8qD1LI_4SkNd-JuM/edit?usp=sharing Lecture 20]&lt;br /&gt;
|| [Lecture 20]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  11&lt;br /&gt;
|| Memory model (1)&lt;br /&gt;
|| [https://docs.google.com/presentation/d/1TawAkpl3mWYKLCiTA30Aj3IVIKC_qrq2Q1ru2GywKbo/edit?usp=sharing Lecture 21]&lt;br /&gt;
|| [Lecture 21]&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |  [https://github.com/HSEhomework/Test1 Seminars 21-22]&lt;br /&gt;
|-&lt;br /&gt;
|| TO DO&lt;br /&gt;
|| [Lecture 22]&lt;br /&gt;
|| [Lecture 22]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Honor Code ==&lt;br /&gt;
&lt;br /&gt;
Plagiarism rules are using the Honor Code based on the ideas of Stanford University.&lt;br /&gt;
You may discuss general ideas and strategies, look up information about particular steps of your solution (e.g. &amp;quot;how to open a file&amp;quot;). You may use your past results.&lt;br /&gt;
However,&lt;br /&gt;
* Never look at other people&#039;s solutions (both from other students and from the Internet) specific to problems from the course.&lt;br /&gt;
* Never share your solutions.&lt;br /&gt;
* State any outside help you received, including other students.&lt;br /&gt;
You can get acquainted with the full text of the Honor Code on SmartLMS.&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 !! Preliminary !! Deadline !! Topic &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/45461 Contest 1] || 24 jan 2023, 23:59:59 || 31 jan 2023, 23:59:59 || Basic Operations&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/45749 Contest 2] || 1 feb 2023, 23:59:59 || 15 feb 2023, 23:59:59 || Strings&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/46215 Contest 3] || 18 feb 2023, 23:59:59 || 25 feb 2023, 23:59:59 || STL&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/47156 Contest 4] || 17 mar 2023, 23:59:59 || 24 mar 2023, 23:59:59 || Classes&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
In addition to regular in-built tests, there are manual checks in the contest (if there are major flaws in your solution, but you still pass the tests, you get a reduced grade). To give you a chance to fix and flaws, there will be a preliminary deadline for each contest. Submission rate will be limited to 1 submission every 5 minutes. Thus, please, test your code locally before submitting it.&lt;br /&gt;
&lt;br /&gt;
Remember that you can extend any homework/project deadline for 24 hours. You may have 3 such extensions for the whole course. But note, that you cannot use more than 2 extensions for the same deadline. &lt;br /&gt;
In order to get an extension, please, fill in the form on the SmartLMS platform.&lt;br /&gt;
&lt;br /&gt;
Also, do not forget about &#039;&#039;&#039;CodeStyle&#039;&#039;&#039;. It is based on the [https://google.github.io/styleguide/cppguide.html &amp;quot;Google C++ Style Guide&amp;quot;], but with minor differences:&lt;br /&gt;
&lt;br /&gt;
* The indent size is 4 space characters.&lt;br /&gt;
* Tab characters must not be used.&lt;br /&gt;
* Nested structures should be indented.&lt;br /&gt;
** Your indentation structure should look similar to Python code, where such indentation is mandatory.&lt;br /&gt;
** Your own namespace is an exception to this rule.&lt;br /&gt;
* Place the opening brace on the new line.&lt;br /&gt;
** Short single line function are an exception (for example, line `int getValue() { return _value;})&lt;br /&gt;
* The asterisk for pointer definition and the ampersand for references should be written next to the type (for example, use int* p = getPointer(); for pointers instead of int *p = getPointer())&lt;br /&gt;
&lt;br /&gt;
== Defenses ==&lt;br /&gt;
&lt;br /&gt;
Some of your works are to be defended. There are 2 types of defenses: &lt;br /&gt;
# Defenses of potentially plagiarized works. The result may be one of 2 options: the full grade if the defense was successful, or 0 otherwise. Please, note that the teaching team has the right to nullify your work without letting you defend it if the fact of plagiarism is extremely clear.&lt;br /&gt;
# Defenses which are a part of the assessment. For example, the defense of your BigHW project.&lt;br /&gt;
The defenses of your homeworks take place during your assistant’s consultation every Wednesday from 16:00 to 19:00. The deadline is exactly 2 Wednesdays after the work’s grading. In particular cases you may ask to reschedule your defense. For that, please, write assistant Anna on telegram (do not forget to mention the reason for your request).&lt;br /&gt;
&lt;br /&gt;
== Results ==&lt;br /&gt;
&lt;br /&gt;
The results can be found [https://docs.google.com/spreadsheets/d/1yH-N8d0cW3WmP7lY5Ibcw3Yq7G2RG9bQuNZtUUpWevw/edit?usp=sharing here] as well as in your SmartLMS&lt;br /&gt;
&lt;br /&gt;
==Control works==&lt;br /&gt;
&lt;br /&gt;
Tests (control works or extended quizzes) will be held offline, using OBS proctoring you&#039;re familiar with.&lt;br /&gt;
There are two new rules:&lt;br /&gt;
# Your OBS recording should show all your running processes at the start of the video (open task manager and scroll through it).&lt;br /&gt;
# Instead of file size, submit MD5 hash of the video if you can&#039;t upload it right away.&lt;br /&gt;
&lt;br /&gt;
=== Extended Quiz 17 Feb===&lt;br /&gt;
&lt;br /&gt;
Your first extended quiz with theoretical questions will be conducted on &#039;&#039;&#039;Friday, February 17, at 16:20&#039;&#039;&#039; in the &#039;&#039;&#039;offline&#039;&#039;&#039; format.&lt;br /&gt;
&lt;br /&gt;
All the details can be found at [[Introduction to Programming 2 DSBA 2022/2023 / ExQuiz1 |Introduction to Programming 2 DSBA 2022/2023 / ExQuiz1]].&lt;br /&gt;
&lt;br /&gt;
=== Control Work 24 March===&lt;br /&gt;
&lt;br /&gt;
Your CW will take place on &#039;&#039;&#039;Friday, March 24, at 16:20&#039;&#039;&#039; in the &#039;&#039;&#039;offline&#039;&#039;&#039; format.&lt;br /&gt;
&lt;br /&gt;
Contest link - https://official.contest.yandex.com/contest/47897/&lt;br /&gt;
&lt;br /&gt;
All the details can be found at [[Introduction to Programming 2 DSBA 2022/2023 /Contest1 |Introduction to Programming 2 DSBA 2022/2023 /Contest1]].&lt;br /&gt;
&lt;br /&gt;
=== Midterm===&lt;br /&gt;
&lt;br /&gt;
Your midterm will take place on &#039;&#039;&#039;________&#039;&#039;&#039; in the &#039;&#039;&#039;offline&#039;&#039;&#039; format.&lt;br /&gt;
&lt;br /&gt;
All the details can be found [[Introduction to Programming 2 DSBA 2022/2023 /Midterm |here]].&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/749558890&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_2_DSBA_2022/2023_/Contest1&amp;diff=77210</id>
		<title>Introduction to Programming 2 DSBA 2022/2023 /Contest1</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_2_DSBA_2022/2023_/Contest1&amp;diff=77210"/>
		<updated>2023-03-24T13:11:52Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The control work will be conducted on &#039;&#039;&#039;Friday, 24th of March, at 16:20&#039;&#039;&#039; in the &#039;&#039;&#039;offline&#039;&#039;&#039; format. &lt;br /&gt;
&lt;br /&gt;
Contest link - https://official.contest.yandex.com/contest/47897/&lt;br /&gt;
&lt;br /&gt;
There will be several rooms: &#039;&#039;&#039;R401&#039;&#039;&#039; for the majority of you and &#039;&#039;&#039;R602&#039;&#039;&#039; with campus computers and sockets for those, who do not have personal laptops or whose laptops consume too much energy to manage OBS + contest + IDE without recharging. If you understand that you are facing one of these problems, please write directly to [https://t.me/l_AnnaPronina_l assistant Anna in Telegram] in order to be allocated in а computer class.&lt;br /&gt;
&lt;br /&gt;
=== &#039;&#039;&#039;People invited in R602:&#039;&#039;&#039; ===&lt;br /&gt;
# Абубекерова&lt;br /&gt;
# Алексанян&lt;br /&gt;
# Бохян&lt;br /&gt;
# Валами&lt;br /&gt;
# Забруссков&lt;br /&gt;
# Калиновский&lt;br /&gt;
# Клевцова&lt;br /&gt;
# Корнилова&lt;br /&gt;
# Лайпанов&lt;br /&gt;
# Левшина&lt;br /&gt;
# Лесовина&lt;br /&gt;
# Мамедов&lt;br /&gt;
# Панкин&lt;br /&gt;
# Сухопаров&lt;br /&gt;
# Фокина&lt;br /&gt;
# Харченко&lt;br /&gt;
# Чуркин&lt;br /&gt;
# Шарифуллин&lt;br /&gt;
If you asked for a socket, but did not find yourself in the list above, do not worry. We will provide you with one in R401.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Important note:&#039;&#039;&#039; follow [https://github.com/Aptemvs/DSBA-Tools-Installation this instruction] to install OBS. If something goes wrong, do not hesitate to ask your assistants for help.&lt;br /&gt;
&lt;br /&gt;
You will have to solve several problems in &#039;&#039;&#039;75 min&#039;&#039;&#039;. The tasks may be interconnected, so we highly recommend you to follow the direct order. The points (&#039;&#039;&#039;50 RP&#039;&#039;&#039; in total) earned during this work are part of Ongoing Assessment.&lt;br /&gt;
&lt;br /&gt;
=== &#039;&#039;&#039;Rules:&#039;&#039;&#039; ===&lt;br /&gt;
# Please do not forget to bring your &#039;&#039;&#039;ID&#039;&#039;&#039; (students&#039; ID certificates, HSE campus pass-cards or passports will be accepted) &lt;br /&gt;
# During the test you are allowed to use only:&lt;br /&gt;
## Lecture notes &lt;br /&gt;
## Workshop materials &lt;br /&gt;
## Your homework contests solutions &lt;br /&gt;
## [https://en.cppreference.com/w/ cppreference] or [https://cplusplus.com cplusplus.com]&lt;br /&gt;
## Online translators &lt;br /&gt;
# Pay attention that you are &#039;&#039;&#039;not allowed&#039;&#039;&#039; to use:&lt;br /&gt;
## Online compilators &lt;br /&gt;
## &#039;&#039;&#039;stackoverflow, math.stackexchange, quorа, geeksforgeeks&#039;&#039;&#039; and similar resources&lt;br /&gt;
# If we notice you opening any external windows, your work will get a 0 mark automatically. &lt;br /&gt;
# Be prepared that you will &#039;&#039;&#039;not be able to leave the room&#039;&#039;&#039; until the end of the work.&lt;br /&gt;
#You will have to record your screen using the OBS system:&lt;br /&gt;
## You are supposed to record your &#039;&#039;&#039;screen onlу&#039;&#039;&#039;. Microphone and web-camera recordings are a must only for those, who are now studying online (and have confirmed it with the Study Office).&lt;br /&gt;
## Start the recording &#039;&#039;&#039;5 minutes before&#039;&#039;&#039; the beginning of the contest.&lt;br /&gt;
## Right after starting the recording, you record all your running processes at the start of the video (open task manager and scroll through it). &lt;br /&gt;
## At the end of the work, &#039;&#039;&#039;within 30 minutes&#039;&#039;&#039;, you must place the recordings on Yandex/Google disk (most preferably), dropbox or YouTube, and &#039;&#039;&#039; fill the form in SmartLMS&#039;&#039;&#039;, indicating the link to the recording file (just a file, not a folder) in it. In case of technical problems with video uploading or with meeting the uploading deadline (30 minutes), fill the form with the &#039;&#039;&#039;MD5 hash&#039;&#039;&#039; of the video file and write to [https://t.me/l_AnnaPronina_l assistant Anna in Telegram]. As soon as the problem is solved, provide a link to your video in comments.&lt;br /&gt;
## Please, &#039;&#039;&#039;do not delete the video until your teacher checks the recording&#039;&#039;&#039; (you will get notification about it).&lt;br /&gt;
# &#039;&#039;&#039;Communication in any form is strictly prohibited&#039;&#039;&#039; including:&lt;br /&gt;
## Verbal communication&lt;br /&gt;
## Messengers&lt;br /&gt;
## Code collaboration tools&lt;br /&gt;
&lt;br /&gt;
&amp;lt;br&amp;gt; For &#039;&#039;&#039;those, who have confirmed studying online&#039;&#039;&#039;: we will send you a link to Zoom as private messages. Please, join the conference and start recording your screen, web-camera and microphone. All the rules above are valid for you as well. &amp;lt;br&amp;gt;&lt;br /&gt;
If you caught a flu and now at home officially &#039;&#039;&#039;with medical certificates&#039;&#039;&#039;, you &#039;&#039;&#039;are allowed to join the online session&#039;&#039;&#039; as well. But, please, write to [https://t.me/l_AnnaPronina_l assistant Anna in Telegram] in order to notify about it in advance. All the rules for you are the same as for distant learning students. Be aware, that &#039;&#039;&#039;your result will be accounted if and only if you provide your medical certificate to the study office&#039;&#039;&#039; and it is proved to be a true one.&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=63219</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=63219"/>
		<updated>2021-12-20T16:58:14Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Exam */  Пояснение о технических проблемах.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Sadullaev M., tg: [https://tlgg.ru/samiysamiytochniy @samiysamiytochniy]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The control work will take place on Monday, 08.11 at 12.50 in an online format using asynchronous proctoring&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The contest will start at 13.00. At 12.50 in the zoom on the lecture link there will be an instruction. Also, this zoom will be used to be able to ask a question or make an announcement during the test.&lt;br /&gt;
&lt;br /&gt;
You will have 5 problems for 80 minutes: A, В, С, D - 10 points each, E - 20 points. The points earned on the test are part of Ongoing Assesment.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their seminarist or TA. They will write a supervised test in zoom and should be prepared to further defend their works. Zoom link for such  students:https://zoom.us/j/92446507737 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;All instructions can be read here [[Introduction_to_Programming_DSBA_2021/2022/Control_work_rules | Rules]]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link to the contest:&#039;&#039;&#039; https://official.contest.yandex.com/contest/31178/problems/  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Video download link&#039;&#039;&#039; - form [https://docs.google.com/forms/d/e/1FAIpQLSeG9R8BGosVAO84z2C_lQX-GAcDxsXJ3Cfhys2t2kUo84r8cw/viewform?usp=sf_link]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Who have missed CW ===&lt;br /&gt;
&lt;br /&gt;
Students who have missed the control work for a good reason will be able to write it &#039;&#039;&#039;on Monday, December 6 at 12.50.&#039;&#039;&#039; The rules are the same as for the main attempt (proctoring with the help of OBS system, etc.) The link will be sent before the control work&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link&#039;&#039;&#039; — [https://zoom.us/j/95617319275 here]&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cpQgDzfo0qx3KLi5FqyBql34NEiWnaH5/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Wn8doFKX6QEgthcKNxozIp1vQTzxsbcg/view?usp=sharing Lecture 3. Functional &amp;amp; OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/10oO1lk5BqVHedCY5QDnH0m2eF5JHu8cB/view?usp=sharing Lecture 4. Basic data structures. Graphs.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19nr1z5Mx-cs_06KoNlik6MR2nHlLp9rj/view?usp=sharing Lecture 5. NumPy.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1iLPnPtRKwYoi1V328_1BlBRtiin4bbLv/view?usp=sharing Lecture 6. Pandas. Matplotlib. Seaborn.] &amp;lt;br&amp;gt;&lt;br /&gt;
Lecture 7.Python for data analysis. Examples: Titanic 1 [https://drive.google.com/file/d/1uTpw8kbj8oeexhEqiME1jU-1wNlVGIVK/view?usp=sharing], Titanic 2 [https://drive.google.com/file/d/1U4M_P5h1eTvRZwXL9RmaS4ZvxMgXLzcz/view?usp=sharing]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1xSStI-ObdWE76IJfKikDz7T5e1IvGA6s/view?usp=sharing Tweets] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Topic !! ipynb (Jupyter) !! html !! pdf&lt;br /&gt;
|-&lt;br /&gt;
| 1. Introduction || [[https://drive.google.com/file/d/163k2AVJAOXi5vzuqhLTUbUtXBORDWjJ0| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%201%20-%20introduction HTML]] || [[https://drive.google.com/file/d/1XiWVH77w96t4M-bDcCMQ5yDoHvaDUbJc/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 2. Numeral systems || [[https://drive.google.com/file/d/1SZqOa3szmbJtrGOvqOhOzqIWyN8lvjnO| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%202%20-%20numbering%20systems HTML]] || [[https://drive.google.com/file/d/123wWBNg80z067VBsrxRaNVnVTaxX2eZt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 3. If, while || [[https://drive.google.com/file/d/12dkRJ7DyOxn4u5rgfsD7ulA4VsZGk4_Y| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%203%20-%20if,%20for HTML]] || [[https://drive.google.com/file/d/1yJD7vFi5xLr2QUpQaN-XW2aTtBZwVKCt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 4. Floats and strings || [[https://drive.google.com/file/d/1Q1UAICsnU4nOtUqCC1GmK82Y18p6jdpo| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%204%20-%20real%20numbers%20and%20strings HTML]] || [[https://drive.google.com/file/d/1FHVmsqCxTTU03YZjrooyhXPu0_aLeYCo/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 5. Strings || [[https://drive.google.com/file/d/17oz8WLoVY-XaSiyZe48i8q55zDNOOoGu| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%205%20-%20strings HTML]] || [[https://drive.google.com/file/d/1LWgVN1_HRF9imYoBTT-oApsXWzCtqdlU/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 6. Tasks on strings || [[https://drive.google.com/file/d/1SQE9WIlXFXLAt9HwstpYbLiZSo17zOGf| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%206%20tasks%20on%20strings HTML]] || [[https://drive.google.com/file/d/1S5Dj9z4RQfrZx26GpRfJNf1VTRCBxWrZ/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| Extra: code style || [[https://drive.google.com/file/d/1KDJ0y0f4m2GjVUnURXBYCVplgXqYHH3c| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%206.%20code%20style.%20strings HTML]] || [[https://drive.google.com/file/d/1ScflFw797otQHv7dLkemNP1kxrhgBjxN/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 7. Lists and tuples || [[https://drive.google.com/file/d/1Hrt-fJlQllybqis75yz7Z8J98SCbyROD| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%207_lists_tuples HTML]] || [[https://drive.google.com/file/d/1vx0G7hd_zCw-cj-AwySJwFTLQ0EwkRSb/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 8. Tasks on lists and tuples || [[https://drive.google.com/file/d/1zGlaGLWZQ8GxjVLOI2arFbM69poj8DaY| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%208%20tasks%20on%20lists%20and%20tuples HTML]] || [[https://drive.google.com/file/d/1AnuIayxEnm4XrtA1h_f6wtyCC8WIgQw5/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 9. Functions || [[https://drive.google.com/file/d/1az-sgSitygmDGMChX2EuhuQRF7sZ8P1T| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%209_functions_and_recursion HTML]] || [[https://drive.google.com/file/d/1CojdOj7mJUOxGk31dGyQtIsbqWIfuD5A/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 10. Tasks on functions || [[https://drive.google.com/file/d/1hCh7NFgIFaQor4HnglfF-Dcgz285JEFy| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2010%20some%20more%20tasks%20on%20functions HTML]] || [[https://drive.google.com/file/d/1lHYfnUBg_3bCyqytJbnph0VO-N14ZHje/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 11. Sets and dictionaries || [[https://drive.google.com/file/d/15g-eKzRayWOIt3ZgPjhfcB0Moefy_Uhk| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2011%20sets_dictionaries HTML]] || [[https://drive.google.com/file/d/1VoLiisI92gKjIzd2e_sy3xvUnmEQQ_tr/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 12. Tasks on sets and dictionaries || [[https://drive.google.com/file/d/14Y4PqEVEDqhcWibSCFmE1XuGqo3VUxh5| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2012.%20tasks%20on%20sets%20and%20dictionaries HTML]] || [[https://drive.google.com/file/d/1EZ0NnyFlabcls1l6uHwgepJ7Op3gIre7/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 13-14. Sorting and searching || [[https://drive.google.com/file/d/14rZvEish6O0uY5NLfm1Z8wlJpaYXvZfS| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2013.%20sorting%20and%20searching HTML]] || [[https://drive.google.com/file/d/1PtqR2-TNiJJ9Vt9zVDNzuzpKZvkGzoqa/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 15. Iterators and generators || [[https://drive.google.com/file/d/1EnkVxx2QJ6UBK6uEgV35rTO7TK_JSh6G| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2015%20iterators%20and%20generators HTML]] || [[https://drive.google.com/file/d/1F4uy9x1Ux1HR6q7FXcighmyR2XW7BuXU/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 16. Tasks on functional programming || [[https://drive.google.com/file/d/1xFiGPwNkJztADLbskVqUpR_iboX8kvn0| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2016%20functional%20tasks HTML]] || [[https://drive.google.com/file/d/1Xode0cKPxe4-Jq6Ywy1DyMLoABIzrAyx/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 17. Abstract data structures || [[https://drive.google.com/file/d/1fRzr5BOQzzLrB3X2p5p6AeeljT1xHcE3| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2017%20abstract%20data%20structures HTML]] || [[https://drive.google.com/file/d/1gvZygA1-29tWFYXxI60E6Ht5UW8j7ZEQ/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| Extra: graphs, search algorithms || [[https://drive.google.com/file/d/1TJbAw_21DfrRpHSeQmOLWA4pWpFYUm0F| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2017.5%20graphs.%20trees.%20practice HTML]] || [[https://drive.google.com/file/d/1-3R9BViqZOWfzTsQ0LdNpa-IHhl-EHM9/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 18. Files and exceptions || [[https://drive.google.com/file/d/1ewXawJhhl6pc8E1ZKrFc2vkZqGQG8yqR| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2018%20files,%20exceptions,%20errors HTML]] || [[https://drive.google.com/file/d/11SeZbzTku5pdiqNnpHFWAEqgk_Eg-Abn/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 19. Test solutions. Practice || [[https://drive.google.com/file/d/1RHo1UV6RWsVow77NjDA5mCUHbRkWiBNk| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2019.%20test%20solutions.%20practice.%20random HTML]] || [[https://drive.google.com/file/d/1KCSUAVRZ-Gjx2gZ0NxwP3CJlHxkO5d_K/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 20. File system || [[https://drive.google.com/file/d/11Uj52_pOlLu_b1TFMgPXf4BpiMYVjuPo| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2020.%20file%20system.%20practice HTML]] || [[https://drive.google.com/file/d/1V9LC4LQSIv14kCsQb3EtKYl-3Q7SsI5v/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 21. Numpy. Pandas || [[https://drive.google.com/file/d/1RYc16Si3KOGjornzRhGG0cR_ldk0upOD| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2021%20numpy%20pandas HTML]] || [[https://drive.google.com/file/d/1Joy4Vl3Orgbo-hfma9usqWUSfvoYtonr/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 22. Pandas || [[https://drive.google.com/file/d/1WqyvV9_h5eD_dDMine4bRYyjEUAzNWQw| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2022%20pandas HTML]] || [[https://drive.google.com/file/d/1ZTRjILBQevf8oKlXUhiheIvKwcGZXH-x/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 23. Data analysis. Visualization || [[https://drive.google.com/file/d/1VXqRxxfI9b1Hp_zi_VccTbO7fLlesH1t| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2023.%20data%20analysis%20examples.%20visualization HTML]] || [[https://drive.google.com/file/d/1mdJOgYckOpJqu82krE8rf9QGZbky-EK-/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 24. Visualization || [[https://drive.google.com/file/d/1rafsGZoSxILN1NbtwZAUvMUoaEGsQ-Cp| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2024.%20visualization. HTML]] || [[https://drive.google.com/file/d/1P9ITSj1ToL_w0gKX4BKF-ZdsrMoHmBTe/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 25-26. Web requests. Scraping. || [[https://drive.google.com/file/d/1PlIMK9UkOCKlyRP-wiFfBnMCm9hIVc3J| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2025-26%20web%20scraping,%20requests HTML]] || [[https://drive.google.com/file/d/1zG03U9HnlZEhoEaIrtZzkpfjqxl2elss/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 27. Flask || [[https://drive.google.com/file/d/19Gg8rmlnlCQmkH7jkA7Ohcc9GGsjoSnQ| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop_27_flask_part_1 HTML]] || [[https://drive.google.com/file/d/15whemE-OqO1xX3Zgla_mM4B46ab48Nmt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 28. Deploying Flask || [[https://drive.google.com/file/d/1gwU27N-Cb98zKIoAIMmiW2gUkZFMZt1G| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop_27_flask_part_2 HTML]] || [[https://drive.google.com/file/d/1T5cElJqCQhFUvJ9NoBaWm3UZ81h-14Mx/view?usp=sharing PDF]]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 16 november 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31586/enter/ Contest 7 (pilot)] || 30 november 2021, 22:00:00  &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31178/enter/ Test] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 12th, 23:59&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Submission format&#039;&#039;&#039;: Jupyter Notebook + Data file. Submit the notebook file and the dataset example via this Google form: https://forms.gle/cvG8tLn2ugjMMAPj8&lt;br /&gt;
&lt;br /&gt;
If your data is larger than 10 MB, please use a subset of data under 10 MB and submit the subset into the form.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dataset selection&#039;&#039;&#039;: After you choose a dataset for the project, submit it to this form: https://forms.gle/hQx7fpaneXKgRAJt9&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it.&lt;br /&gt;
https://docs.google.com/spreadsheets/d/1WQSgOzQdamwSWXexN7EHtVv2sstl6A9yVguQUMCAcZk&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Project description&#039;&#039;&#039;: Find a dataset with text data and analyze it the following way.&lt;br /&gt;
&lt;br /&gt;
* Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
* Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
* Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of column A for different values of column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
* Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
* For pilot students one of the requirements is to set up a web server using the Flask framework. Web Server interface should be one of the following: end users must be able to get required data using get-requests, html page or telegram-bot.&lt;br /&gt;
&lt;br /&gt;
Additional notes:&lt;br /&gt;
&lt;br /&gt;
* Plots for tasks 2 and 3 are counted separately. So, your project has to have at least 5 plots in total.&lt;br /&gt;
* Make sure your plots have proper legends, titles, axis titles, so that it’s easy to understand what the graph represents.&lt;br /&gt;
* Try to format your project as a sequence of problems you’re solving. What the data looks like, what are some questions you can answer with the data. You should try to make a simple analysis project instead of doing exactly the bare minimum of tasks 1-4.&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
The exam is held &#039;&#039;&#039;on December 21st starting at 10:40&#039;&#039;&#039;: you should enter the system at 10:40. The contest starts at 11:00. The total length of the exam is 120 minutes without breaks. After 120 minutes pass from the start of the exam, Yandex.Contest will stop counting your solutions towards the total grade, even though it will still be possible to upload the solutions.&lt;br /&gt;
&lt;br /&gt;
During the exam:&lt;br /&gt;
&lt;br /&gt;
You may use:&lt;br /&gt;
# Lecture and workshop materials. Links: &#039;&#039;&#039;[[Introduction_to_Programming_DSBA_2021/2022#Workshop_notes|Workshop materials]], [[Introduction_to_Programming_DSBA_2021/2022#Lecture_notes|Lecture notes]]&#039;&#039;&#039;&lt;br /&gt;
# Printed lecture and workshop materials.&lt;br /&gt;
# Python documentation at https://docs.python.org&lt;br /&gt;
# Your solutions to tasks from homeworks and the control work. Use Yandex.Contest only to open your previous code. Link: &#039;&#039;&#039;[[Introduction_to_Programming_DSBA_2021/2022#Contests|Contests]]&#039;&#039;&#039;&lt;br /&gt;
# IDE tools. Built-in documentation, automatic code checking tools, debugger and so on.&lt;br /&gt;
&lt;br /&gt;
The page for built-in types (lists, dictionaries) may be hard to find using documentation search. Here it is: https://docs.python.org/3/library/stdtypes.html&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Proctoring requires you to always keep the ProctorEdu tab of your browser open. If you don&#039;t want to get warnings when you switch to another tab, please open another window of your browser.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
You must not use:&lt;br /&gt;
# Internet search. To search Python documentation, use the search tools built into the documentation: https://docs.python.org/3/search.html?q=&amp;amp;check_keywords=yes&amp;amp;area=default&lt;br /&gt;
# Any sites except the ones linked on this page.&lt;br /&gt;
# Any kind of communication except the proctoring chat.&lt;br /&gt;
# Google Colab and other web applications where it&#039;s possible to work collaboratively. Use Jupyter Notebook, Jupyter Labs or similar local software to open workshop materials in .ipynb format. Alternatively, open the materials as HTML or PDF.&lt;br /&gt;
&lt;br /&gt;
You will not be able to enter the exam after 11:15. Students who are late by more than 15 minutes will be considered absent.&lt;br /&gt;
&lt;br /&gt;
If your connection breaks for less than 10 minutes, you may continue working on the exam. The lost time will not be compensated, and you will be asked to defend your work on December 24th. If your connection breaks for more than 10 minutes and it&#039;s confirmed to be a technical issue out of your control, you are considered absent with a valid reason and you may retake the exam during the retake period.&lt;br /&gt;
&lt;br /&gt;
If you encounter any technical issues, send a message to &#039;&#039;&#039;helpexam@hse.ru&#039;&#039;&#039;. Include your &#039;&#039;&#039;last name&#039;&#039;&#039; and the &#039;&#039;&#039;name of the exam&#039;&#039;&#039; (that is, course) in the &#039;&#039;&#039;subject&#039;&#039;&#039; of your email, then briefly explain the problem. Take screenshots of all the issues. If you completely lose your internet connection, please contact your Internet service provider to get confirmation from them.&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=63218</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=63218"/>
		<updated>2021-12-20T16:34:40Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Exam */  Добавлено описание, что делать при технических проблемах&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Sadullaev M., tg: [https://tlgg.ru/samiysamiytochniy @samiysamiytochniy]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The control work will take place on Monday, 08.11 at 12.50 in an online format using asynchronous proctoring&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The contest will start at 13.00. At 12.50 in the zoom on the lecture link there will be an instruction. Also, this zoom will be used to be able to ask a question or make an announcement during the test.&lt;br /&gt;
&lt;br /&gt;
You will have 5 problems for 80 minutes: A, В, С, D - 10 points each, E - 20 points. The points earned on the test are part of Ongoing Assesment.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their seminarist or TA. They will write a supervised test in zoom and should be prepared to further defend their works. Zoom link for such  students:https://zoom.us/j/92446507737 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;All instructions can be read here [[Introduction_to_Programming_DSBA_2021/2022/Control_work_rules | Rules]]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link to the contest:&#039;&#039;&#039; https://official.contest.yandex.com/contest/31178/problems/  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Video download link&#039;&#039;&#039; - form [https://docs.google.com/forms/d/e/1FAIpQLSeG9R8BGosVAO84z2C_lQX-GAcDxsXJ3Cfhys2t2kUo84r8cw/viewform?usp=sf_link]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Who have missed CW ===&lt;br /&gt;
&lt;br /&gt;
Students who have missed the control work for a good reason will be able to write it &#039;&#039;&#039;on Monday, December 6 at 12.50.&#039;&#039;&#039; The rules are the same as for the main attempt (proctoring with the help of OBS system, etc.) The link will be sent before the control work&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link&#039;&#039;&#039; — [https://zoom.us/j/95617319275 here]&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cpQgDzfo0qx3KLi5FqyBql34NEiWnaH5/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Wn8doFKX6QEgthcKNxozIp1vQTzxsbcg/view?usp=sharing Lecture 3. Functional &amp;amp; OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/10oO1lk5BqVHedCY5QDnH0m2eF5JHu8cB/view?usp=sharing Lecture 4. Basic data structures. Graphs.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19nr1z5Mx-cs_06KoNlik6MR2nHlLp9rj/view?usp=sharing Lecture 5. NumPy.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1iLPnPtRKwYoi1V328_1BlBRtiin4bbLv/view?usp=sharing Lecture 6. Pandas. Matplotlib. Seaborn.] &amp;lt;br&amp;gt;&lt;br /&gt;
Lecture 7.Python for data analysis. Examples: Titanic 1 [https://drive.google.com/file/d/1uTpw8kbj8oeexhEqiME1jU-1wNlVGIVK/view?usp=sharing], Titanic 2 [https://drive.google.com/file/d/1U4M_P5h1eTvRZwXL9RmaS4ZvxMgXLzcz/view?usp=sharing]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1xSStI-ObdWE76IJfKikDz7T5e1IvGA6s/view?usp=sharing Tweets] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Topic !! ipynb (Jupyter) !! html !! pdf&lt;br /&gt;
|-&lt;br /&gt;
| 1. Introduction || [[https://drive.google.com/file/d/163k2AVJAOXi5vzuqhLTUbUtXBORDWjJ0| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%201%20-%20introduction HTML]] || [[https://drive.google.com/file/d/1XiWVH77w96t4M-bDcCMQ5yDoHvaDUbJc/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 2. Numeral systems || [[https://drive.google.com/file/d/1SZqOa3szmbJtrGOvqOhOzqIWyN8lvjnO| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%202%20-%20numbering%20systems HTML]] || [[https://drive.google.com/file/d/123wWBNg80z067VBsrxRaNVnVTaxX2eZt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 3. If, while || [[https://drive.google.com/file/d/12dkRJ7DyOxn4u5rgfsD7ulA4VsZGk4_Y| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%203%20-%20if,%20for HTML]] || [[https://drive.google.com/file/d/1yJD7vFi5xLr2QUpQaN-XW2aTtBZwVKCt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 4. Floats and strings || [[https://drive.google.com/file/d/1Q1UAICsnU4nOtUqCC1GmK82Y18p6jdpo| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%204%20-%20real%20numbers%20and%20strings HTML]] || [[https://drive.google.com/file/d/1FHVmsqCxTTU03YZjrooyhXPu0_aLeYCo/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 5. Strings || [[https://drive.google.com/file/d/17oz8WLoVY-XaSiyZe48i8q55zDNOOoGu| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%205%20-%20strings HTML]] || [[https://drive.google.com/file/d/1LWgVN1_HRF9imYoBTT-oApsXWzCtqdlU/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 6. Tasks on strings || [[https://drive.google.com/file/d/1SQE9WIlXFXLAt9HwstpYbLiZSo17zOGf| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%206%20tasks%20on%20strings HTML]] || [[https://drive.google.com/file/d/1S5Dj9z4RQfrZx26GpRfJNf1VTRCBxWrZ/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| Extra: code style || [[https://drive.google.com/file/d/1KDJ0y0f4m2GjVUnURXBYCVplgXqYHH3c| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%206.%20code%20style.%20strings HTML]] || [[https://drive.google.com/file/d/1ScflFw797otQHv7dLkemNP1kxrhgBjxN/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 7. Lists and tuples || [[https://drive.google.com/file/d/1Hrt-fJlQllybqis75yz7Z8J98SCbyROD| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%207_lists_tuples HTML]] || [[https://drive.google.com/file/d/1vx0G7hd_zCw-cj-AwySJwFTLQ0EwkRSb/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 8. Tasks on lists and tuples || [[https://drive.google.com/file/d/1zGlaGLWZQ8GxjVLOI2arFbM69poj8DaY| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%208%20tasks%20on%20lists%20and%20tuples HTML]] || [[https://drive.google.com/file/d/1AnuIayxEnm4XrtA1h_f6wtyCC8WIgQw5/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 9. Functions || [[https://drive.google.com/file/d/1az-sgSitygmDGMChX2EuhuQRF7sZ8P1T| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%209_functions_and_recursion HTML]] || [[https://drive.google.com/file/d/1CojdOj7mJUOxGk31dGyQtIsbqWIfuD5A/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 10. Tasks on functions || [[https://drive.google.com/file/d/1hCh7NFgIFaQor4HnglfF-Dcgz285JEFy| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2010%20some%20more%20tasks%20on%20functions HTML]] || [[https://drive.google.com/file/d/1lHYfnUBg_3bCyqytJbnph0VO-N14ZHje/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 11. Sets and dictionaries || [[https://drive.google.com/file/d/15g-eKzRayWOIt3ZgPjhfcB0Moefy_Uhk| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2011%20sets_dictionaries HTML]] || [[https://drive.google.com/file/d/1VoLiisI92gKjIzd2e_sy3xvUnmEQQ_tr/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 12. Tasks on sets and dictionaries || [[https://drive.google.com/file/d/14Y4PqEVEDqhcWibSCFmE1XuGqo3VUxh5| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2012.%20tasks%20on%20sets%20and%20dictionaries HTML]] || [[https://drive.google.com/file/d/1EZ0NnyFlabcls1l6uHwgepJ7Op3gIre7/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 13-14. Sorting and searching || [[https://drive.google.com/file/d/14rZvEish6O0uY5NLfm1Z8wlJpaYXvZfS| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2013.%20sorting%20and%20searching HTML]] || [[https://drive.google.com/file/d/1PtqR2-TNiJJ9Vt9zVDNzuzpKZvkGzoqa/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 15. Iterators and generators || [[https://drive.google.com/file/d/1EnkVxx2QJ6UBK6uEgV35rTO7TK_JSh6G| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2015%20iterators%20and%20generators HTML]] || [[https://drive.google.com/file/d/1F4uy9x1Ux1HR6q7FXcighmyR2XW7BuXU/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 16. Tasks on functional programming || [[https://drive.google.com/file/d/1xFiGPwNkJztADLbskVqUpR_iboX8kvn0| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2016%20functional%20tasks HTML]] || [[https://drive.google.com/file/d/1Xode0cKPxe4-Jq6Ywy1DyMLoABIzrAyx/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 17. Abstract data structures || [[https://drive.google.com/file/d/1fRzr5BOQzzLrB3X2p5p6AeeljT1xHcE3| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2017%20abstract%20data%20structures HTML]] || [[https://drive.google.com/file/d/1gvZygA1-29tWFYXxI60E6Ht5UW8j7ZEQ/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| Extra: graphs, search algorithms || [[https://drive.google.com/file/d/1TJbAw_21DfrRpHSeQmOLWA4pWpFYUm0F| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2017.5%20graphs.%20trees.%20practice HTML]] || [[https://drive.google.com/file/d/1-3R9BViqZOWfzTsQ0LdNpa-IHhl-EHM9/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 18. Files and exceptions || [[https://drive.google.com/file/d/1ewXawJhhl6pc8E1ZKrFc2vkZqGQG8yqR| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2018%20files,%20exceptions,%20errors HTML]] || [[https://drive.google.com/file/d/11SeZbzTku5pdiqNnpHFWAEqgk_Eg-Abn/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 19. Test solutions. Practice || [[https://drive.google.com/file/d/1RHo1UV6RWsVow77NjDA5mCUHbRkWiBNk| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2019.%20test%20solutions.%20practice.%20random HTML]] || [[https://drive.google.com/file/d/1KCSUAVRZ-Gjx2gZ0NxwP3CJlHxkO5d_K/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 20. File system || [[https://drive.google.com/file/d/11Uj52_pOlLu_b1TFMgPXf4BpiMYVjuPo| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2020.%20file%20system.%20practice HTML]] || [[https://drive.google.com/file/d/1V9LC4LQSIv14kCsQb3EtKYl-3Q7SsI5v/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 21. Numpy. Pandas || [[https://drive.google.com/file/d/1RYc16Si3KOGjornzRhGG0cR_ldk0upOD| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2021%20numpy%20pandas HTML]] || [[https://drive.google.com/file/d/1Joy4Vl3Orgbo-hfma9usqWUSfvoYtonr/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 22. Pandas || [[https://drive.google.com/file/d/1WqyvV9_h5eD_dDMine4bRYyjEUAzNWQw| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2022%20pandas HTML]] || [[https://drive.google.com/file/d/1ZTRjILBQevf8oKlXUhiheIvKwcGZXH-x/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 23. Data analysis. Visualization || [[https://drive.google.com/file/d/1VXqRxxfI9b1Hp_zi_VccTbO7fLlesH1t| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2023.%20data%20analysis%20examples.%20visualization HTML]] || [[https://drive.google.com/file/d/1mdJOgYckOpJqu82krE8rf9QGZbky-EK-/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 24. Visualization || [[https://drive.google.com/file/d/1rafsGZoSxILN1NbtwZAUvMUoaEGsQ-Cp| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2024.%20visualization. HTML]] || [[https://drive.google.com/file/d/1P9ITSj1ToL_w0gKX4BKF-ZdsrMoHmBTe/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 25-26. Web requests. Scraping. || [[https://drive.google.com/file/d/1PlIMK9UkOCKlyRP-wiFfBnMCm9hIVc3J| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2025-26%20web%20scraping,%20requests HTML]] || [[https://drive.google.com/file/d/1zG03U9HnlZEhoEaIrtZzkpfjqxl2elss/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 27. Flask || [[https://drive.google.com/file/d/19Gg8rmlnlCQmkH7jkA7Ohcc9GGsjoSnQ| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop_27_flask_part_1 HTML]] || [[https://drive.google.com/file/d/15whemE-OqO1xX3Zgla_mM4B46ab48Nmt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 28. Deploying Flask || [[https://drive.google.com/file/d/1gwU27N-Cb98zKIoAIMmiW2gUkZFMZt1G| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop_27_flask_part_2 HTML]] || [[https://drive.google.com/file/d/1T5cElJqCQhFUvJ9NoBaWm3UZ81h-14Mx/view?usp=sharing PDF]]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 16 november 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31586/enter/ Contest 7 (pilot)] || 30 november 2021, 22:00:00  &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31178/enter/ Test] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 12th, 23:59&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Submission format&#039;&#039;&#039;: Jupyter Notebook + Data file. Submit the notebook file and the dataset example via this Google form: https://forms.gle/cvG8tLn2ugjMMAPj8&lt;br /&gt;
&lt;br /&gt;
If your data is larger than 10 MB, please use a subset of data under 10 MB and submit the subset into the form.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dataset selection&#039;&#039;&#039;: After you choose a dataset for the project, submit it to this form: https://forms.gle/hQx7fpaneXKgRAJt9&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it.&lt;br /&gt;
https://docs.google.com/spreadsheets/d/1WQSgOzQdamwSWXexN7EHtVv2sstl6A9yVguQUMCAcZk&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Project description&#039;&#039;&#039;: Find a dataset with text data and analyze it the following way.&lt;br /&gt;
&lt;br /&gt;
* Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
* Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
* Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of column A for different values of column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
* Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
* For pilot students one of the requirements is to set up a web server using the Flask framework. Web Server interface should be one of the following: end users must be able to get required data using get-requests, html page or telegram-bot.&lt;br /&gt;
&lt;br /&gt;
Additional notes:&lt;br /&gt;
&lt;br /&gt;
* Plots for tasks 2 and 3 are counted separately. So, your project has to have at least 5 plots in total.&lt;br /&gt;
* Make sure your plots have proper legends, titles, axis titles, so that it’s easy to understand what the graph represents.&lt;br /&gt;
* Try to format your project as a sequence of problems you’re solving. What the data looks like, what are some questions you can answer with the data. You should try to make a simple analysis project instead of doing exactly the bare minimum of tasks 1-4.&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
The exam is held &#039;&#039;&#039;on December 21st starting at 10:40&#039;&#039;&#039;: you should enter the system at 10:40. The contest starts at 11:00. The total length of the exam is 120 minutes without breaks. After 120 minutes pass from the start of the exam, Yandex.Contest will stop counting your solutions towards the total grade, even though it will still be possible to upload the solutions.&lt;br /&gt;
&lt;br /&gt;
During the exam:&lt;br /&gt;
&lt;br /&gt;
You may use:&lt;br /&gt;
# Lecture and workshop materials. Links: &#039;&#039;&#039;[[Introduction_to_Programming_DSBA_2021/2022#Workshop_notes|Workshop materials]], [[Introduction_to_Programming_DSBA_2021/2022#Lecture_notes|Lecture notes]]&#039;&#039;&#039;&lt;br /&gt;
# Printed lecture and workshop materials.&lt;br /&gt;
# Python documentation at https://docs.python.org&lt;br /&gt;
# Your solutions to tasks from homeworks and the control work. Use Yandex.Contest only to open your previous code. Link: &#039;&#039;&#039;[[Introduction_to_Programming_DSBA_2021/2022#Contests|Contests]]&#039;&#039;&#039;&lt;br /&gt;
# IDE tools. Built-in documentation, automatic code checking tools, debugger and so on.&lt;br /&gt;
&lt;br /&gt;
The page for built-in types (lists, dictionaries) may be hard to find using documentation search. Here it is: https://docs.python.org/3/library/stdtypes.html&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Proctoring requires you to always keep the ProctorEdu tab of your browser open. If you don&#039;t want to get warnings when you switch to another tab, please open another window of your browser.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
You must not use:&lt;br /&gt;
# Internet search. To search Python documentation, use the search tools built into the documentation: https://docs.python.org/3/search.html?q=&amp;amp;check_keywords=yes&amp;amp;area=default&lt;br /&gt;
# Any sites except the ones linked on this page.&lt;br /&gt;
# Any kind of communication except the proctoring chat.&lt;br /&gt;
# Google Colab and other web applications where it&#039;s possible to work collaboratively. Use Jupyter Notebook, Jupyter Labs or similar local software to open workshop materials in .ipynb format. Alternatively, open the materials as HTML or PDF.&lt;br /&gt;
&lt;br /&gt;
You will not be able to enter the exam after 11:15. Students who are late by more than 15 minutes will be considered absent.&lt;br /&gt;
&lt;br /&gt;
If your connection breaks for less than 10 minutes, you may continue working on the exam. The lost time will not be compensated, and you will be asked to defend your work on December 24th. If your connection breaks for more than 10 minutes and it&#039;s confirmed to be a technical issue out of your control, you are considered absent with a valid reason and you may retake the exam during the retake period.&lt;br /&gt;
&lt;br /&gt;
If you encounter any technical issues, send a message to &#039;&#039;&#039;helpexam@hse.ru&#039;&#039;&#039;. Include your &#039;&#039;&#039;last name&#039;&#039;&#039; and the &#039;&#039;&#039;name of the exam&#039;&#039;&#039; (that is, course) in the &#039;&#039;&#039;subject&#039;&#039;&#039; of your email, then briefly explain the problem.&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=63217</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=63217"/>
		<updated>2021-12-20T16:23:15Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Exam */  Добавлен комментарий про второе окно браузера&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Sadullaev M., tg: [https://tlgg.ru/samiysamiytochniy @samiysamiytochniy]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The control work will take place on Monday, 08.11 at 12.50 in an online format using asynchronous proctoring&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The contest will start at 13.00. At 12.50 in the zoom on the lecture link there will be an instruction. Also, this zoom will be used to be able to ask a question or make an announcement during the test.&lt;br /&gt;
&lt;br /&gt;
You will have 5 problems for 80 minutes: A, В, С, D - 10 points each, E - 20 points. The points earned on the test are part of Ongoing Assesment.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their seminarist or TA. They will write a supervised test in zoom and should be prepared to further defend their works. Zoom link for such  students:https://zoom.us/j/92446507737 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;All instructions can be read here [[Introduction_to_Programming_DSBA_2021/2022/Control_work_rules | Rules]]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link to the contest:&#039;&#039;&#039; https://official.contest.yandex.com/contest/31178/problems/  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Video download link&#039;&#039;&#039; - form [https://docs.google.com/forms/d/e/1FAIpQLSeG9R8BGosVAO84z2C_lQX-GAcDxsXJ3Cfhys2t2kUo84r8cw/viewform?usp=sf_link]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Who have missed CW ===&lt;br /&gt;
&lt;br /&gt;
Students who have missed the control work for a good reason will be able to write it &#039;&#039;&#039;on Monday, December 6 at 12.50.&#039;&#039;&#039; The rules are the same as for the main attempt (proctoring with the help of OBS system, etc.) The link will be sent before the control work&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link&#039;&#039;&#039; — [https://zoom.us/j/95617319275 here]&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cpQgDzfo0qx3KLi5FqyBql34NEiWnaH5/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Wn8doFKX6QEgthcKNxozIp1vQTzxsbcg/view?usp=sharing Lecture 3. Functional &amp;amp; OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/10oO1lk5BqVHedCY5QDnH0m2eF5JHu8cB/view?usp=sharing Lecture 4. Basic data structures. Graphs.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19nr1z5Mx-cs_06KoNlik6MR2nHlLp9rj/view?usp=sharing Lecture 5. NumPy.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1iLPnPtRKwYoi1V328_1BlBRtiin4bbLv/view?usp=sharing Lecture 6. Pandas. Matplotlib. Seaborn.] &amp;lt;br&amp;gt;&lt;br /&gt;
Lecture 7.Python for data analysis. Examples: Titanic 1 [https://drive.google.com/file/d/1uTpw8kbj8oeexhEqiME1jU-1wNlVGIVK/view?usp=sharing], Titanic 2 [https://drive.google.com/file/d/1U4M_P5h1eTvRZwXL9RmaS4ZvxMgXLzcz/view?usp=sharing]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1xSStI-ObdWE76IJfKikDz7T5e1IvGA6s/view?usp=sharing Tweets] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Topic !! ipynb (Jupyter) !! html !! pdf&lt;br /&gt;
|-&lt;br /&gt;
| 1. Introduction || [[https://drive.google.com/file/d/163k2AVJAOXi5vzuqhLTUbUtXBORDWjJ0| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%201%20-%20introduction HTML]] || [[https://drive.google.com/file/d/1XiWVH77w96t4M-bDcCMQ5yDoHvaDUbJc/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 2. Numeral systems || [[https://drive.google.com/file/d/1SZqOa3szmbJtrGOvqOhOzqIWyN8lvjnO| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%202%20-%20numbering%20systems HTML]] || [[https://drive.google.com/file/d/123wWBNg80z067VBsrxRaNVnVTaxX2eZt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 3. If, while || [[https://drive.google.com/file/d/12dkRJ7DyOxn4u5rgfsD7ulA4VsZGk4_Y| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%203%20-%20if,%20for HTML]] || [[https://drive.google.com/file/d/1yJD7vFi5xLr2QUpQaN-XW2aTtBZwVKCt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 4. Floats and strings || [[https://drive.google.com/file/d/1Q1UAICsnU4nOtUqCC1GmK82Y18p6jdpo| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%204%20-%20real%20numbers%20and%20strings HTML]] || [[https://drive.google.com/file/d/1FHVmsqCxTTU03YZjrooyhXPu0_aLeYCo/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 5. Strings || [[https://drive.google.com/file/d/17oz8WLoVY-XaSiyZe48i8q55zDNOOoGu| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%205%20-%20strings HTML]] || [[https://drive.google.com/file/d/1LWgVN1_HRF9imYoBTT-oApsXWzCtqdlU/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 6. Tasks on strings || [[https://drive.google.com/file/d/1SQE9WIlXFXLAt9HwstpYbLiZSo17zOGf| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%206%20tasks%20on%20strings HTML]] || [[https://drive.google.com/file/d/1S5Dj9z4RQfrZx26GpRfJNf1VTRCBxWrZ/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| Extra: code style || [[https://drive.google.com/file/d/1KDJ0y0f4m2GjVUnURXBYCVplgXqYHH3c| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%206.%20code%20style.%20strings HTML]] || [[https://drive.google.com/file/d/1ScflFw797otQHv7dLkemNP1kxrhgBjxN/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 7. Lists and tuples || [[https://drive.google.com/file/d/1Hrt-fJlQllybqis75yz7Z8J98SCbyROD| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%207_lists_tuples HTML]] || [[https://drive.google.com/file/d/1vx0G7hd_zCw-cj-AwySJwFTLQ0EwkRSb/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 8. Tasks on lists and tuples || [[https://drive.google.com/file/d/1zGlaGLWZQ8GxjVLOI2arFbM69poj8DaY| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%208%20tasks%20on%20lists%20and%20tuples HTML]] || [[https://drive.google.com/file/d/1AnuIayxEnm4XrtA1h_f6wtyCC8WIgQw5/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 9. Functions || [[https://drive.google.com/file/d/1az-sgSitygmDGMChX2EuhuQRF7sZ8P1T| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%209_functions_and_recursion HTML]] || [[https://drive.google.com/file/d/1CojdOj7mJUOxGk31dGyQtIsbqWIfuD5A/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 10. Tasks on functions || [[https://drive.google.com/file/d/1hCh7NFgIFaQor4HnglfF-Dcgz285JEFy| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2010%20some%20more%20tasks%20on%20functions HTML]] || [[https://drive.google.com/file/d/1lHYfnUBg_3bCyqytJbnph0VO-N14ZHje/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 11. Sets and dictionaries || [[https://drive.google.com/file/d/15g-eKzRayWOIt3ZgPjhfcB0Moefy_Uhk| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2011%20sets_dictionaries HTML]] || [[https://drive.google.com/file/d/1VoLiisI92gKjIzd2e_sy3xvUnmEQQ_tr/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 12. Tasks on sets and dictionaries || [[https://drive.google.com/file/d/14Y4PqEVEDqhcWibSCFmE1XuGqo3VUxh5| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2012.%20tasks%20on%20sets%20and%20dictionaries HTML]] || [[https://drive.google.com/file/d/1EZ0NnyFlabcls1l6uHwgepJ7Op3gIre7/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 13-14. Sorting and searching || [[https://drive.google.com/file/d/14rZvEish6O0uY5NLfm1Z8wlJpaYXvZfS| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2013.%20sorting%20and%20searching HTML]] || [[https://drive.google.com/file/d/1PtqR2-TNiJJ9Vt9zVDNzuzpKZvkGzoqa/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 15. Iterators and generators || [[https://drive.google.com/file/d/1EnkVxx2QJ6UBK6uEgV35rTO7TK_JSh6G| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2015%20iterators%20and%20generators HTML]] || [[https://drive.google.com/file/d/1F4uy9x1Ux1HR6q7FXcighmyR2XW7BuXU/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 16. Tasks on functional programming || [[https://drive.google.com/file/d/1xFiGPwNkJztADLbskVqUpR_iboX8kvn0| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2016%20functional%20tasks HTML]] || [[https://drive.google.com/file/d/1Xode0cKPxe4-Jq6Ywy1DyMLoABIzrAyx/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 17. Abstract data structures || [[https://drive.google.com/file/d/1fRzr5BOQzzLrB3X2p5p6AeeljT1xHcE3| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2017%20abstract%20data%20structures HTML]] || [[https://drive.google.com/file/d/1gvZygA1-29tWFYXxI60E6Ht5UW8j7ZEQ/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| Extra: graphs, search algorithms || [[https://drive.google.com/file/d/1TJbAw_21DfrRpHSeQmOLWA4pWpFYUm0F| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2017.5%20graphs.%20trees.%20practice HTML]] || [[https://drive.google.com/file/d/1-3R9BViqZOWfzTsQ0LdNpa-IHhl-EHM9/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 18. Files and exceptions || [[https://drive.google.com/file/d/1ewXawJhhl6pc8E1ZKrFc2vkZqGQG8yqR| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2018%20files,%20exceptions,%20errors HTML]] || [[https://drive.google.com/file/d/11SeZbzTku5pdiqNnpHFWAEqgk_Eg-Abn/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 19. Test solutions. Practice || [[https://drive.google.com/file/d/1RHo1UV6RWsVow77NjDA5mCUHbRkWiBNk| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2019.%20test%20solutions.%20practice.%20random HTML]] || [[https://drive.google.com/file/d/1KCSUAVRZ-Gjx2gZ0NxwP3CJlHxkO5d_K/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 20. File system || [[https://drive.google.com/file/d/11Uj52_pOlLu_b1TFMgPXf4BpiMYVjuPo| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2020.%20file%20system.%20practice HTML]] || [[https://drive.google.com/file/d/1V9LC4LQSIv14kCsQb3EtKYl-3Q7SsI5v/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 21. Numpy. Pandas || [[https://drive.google.com/file/d/1RYc16Si3KOGjornzRhGG0cR_ldk0upOD| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2021%20numpy%20pandas HTML]] || [[https://drive.google.com/file/d/1Joy4Vl3Orgbo-hfma9usqWUSfvoYtonr/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 22. Pandas || [[https://drive.google.com/file/d/1WqyvV9_h5eD_dDMine4bRYyjEUAzNWQw| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2022%20pandas HTML]] || [[https://drive.google.com/file/d/1ZTRjILBQevf8oKlXUhiheIvKwcGZXH-x/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 23. Data analysis. Visualization || [[https://drive.google.com/file/d/1VXqRxxfI9b1Hp_zi_VccTbO7fLlesH1t| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2023.%20data%20analysis%20examples.%20visualization HTML]] || [[https://drive.google.com/file/d/1mdJOgYckOpJqu82krE8rf9QGZbky-EK-/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 24. Visualization || [[https://drive.google.com/file/d/1rafsGZoSxILN1NbtwZAUvMUoaEGsQ-Cp| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2024.%20visualization. HTML]] || [[https://drive.google.com/file/d/1P9ITSj1ToL_w0gKX4BKF-ZdsrMoHmBTe/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 25-26. Web requests. Scraping. || [[https://drive.google.com/file/d/1PlIMK9UkOCKlyRP-wiFfBnMCm9hIVc3J| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2025-26%20web%20scraping,%20requests HTML]] || [[https://drive.google.com/file/d/1zG03U9HnlZEhoEaIrtZzkpfjqxl2elss/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 27. Flask || [[https://drive.google.com/file/d/19Gg8rmlnlCQmkH7jkA7Ohcc9GGsjoSnQ| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop_27_flask_part_1 HTML]] || [[https://drive.google.com/file/d/15whemE-OqO1xX3Zgla_mM4B46ab48Nmt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 28. Deploying Flask || [[https://drive.google.com/file/d/1gwU27N-Cb98zKIoAIMmiW2gUkZFMZt1G| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop_27_flask_part_2 HTML]] || [[https://drive.google.com/file/d/1T5cElJqCQhFUvJ9NoBaWm3UZ81h-14Mx/view?usp=sharing PDF]]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 16 november 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31586/enter/ Contest 7 (pilot)] || 30 november 2021, 22:00:00  &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31178/enter/ Test] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 12th, 23:59&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Submission format&#039;&#039;&#039;: Jupyter Notebook + Data file. Submit the notebook file and the dataset example via this Google form: https://forms.gle/cvG8tLn2ugjMMAPj8&lt;br /&gt;
&lt;br /&gt;
If your data is larger than 10 MB, please use a subset of data under 10 MB and submit the subset into the form.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dataset selection&#039;&#039;&#039;: After you choose a dataset for the project, submit it to this form: https://forms.gle/hQx7fpaneXKgRAJt9&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it.&lt;br /&gt;
https://docs.google.com/spreadsheets/d/1WQSgOzQdamwSWXexN7EHtVv2sstl6A9yVguQUMCAcZk&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Project description&#039;&#039;&#039;: Find a dataset with text data and analyze it the following way.&lt;br /&gt;
&lt;br /&gt;
* Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
* Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
* Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of column A for different values of column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
* Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
* For pilot students one of the requirements is to set up a web server using the Flask framework. Web Server interface should be one of the following: end users must be able to get required data using get-requests, html page or telegram-bot.&lt;br /&gt;
&lt;br /&gt;
Additional notes:&lt;br /&gt;
&lt;br /&gt;
* Plots for tasks 2 and 3 are counted separately. So, your project has to have at least 5 plots in total.&lt;br /&gt;
* Make sure your plots have proper legends, titles, axis titles, so that it’s easy to understand what the graph represents.&lt;br /&gt;
* Try to format your project as a sequence of problems you’re solving. What the data looks like, what are some questions you can answer with the data. You should try to make a simple analysis project instead of doing exactly the bare minimum of tasks 1-4.&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
The exam is held &#039;&#039;&#039;on December 21st starting at 10:40&#039;&#039;&#039;: you should enter the system at 10:40. The contest starts at 11:00. The total length of the exam is 120 minutes without breaks. After 120 minutes pass from the start of the exam, Yandex.Contest will stop counting your solutions towards the total grade, even though it will still be possible to upload the solutions.&lt;br /&gt;
&lt;br /&gt;
During the exam:&lt;br /&gt;
&lt;br /&gt;
You may use:&lt;br /&gt;
# Lecture and workshop materials. Links: &#039;&#039;&#039;[[Introduction_to_Programming_DSBA_2021/2022#Workshop_notes|Workshop materials]], [[Introduction_to_Programming_DSBA_2021/2022#Lecture_notes|Lecture notes]]&#039;&#039;&#039;&lt;br /&gt;
# Printed lecture and workshop materials.&lt;br /&gt;
# Python documentation at https://docs.python.org&lt;br /&gt;
# Your solutions to tasks from homeworks and the control work. Use Yandex.Contest only to open your previous code. Link: &#039;&#039;&#039;[[Introduction_to_Programming_DSBA_2021/2022#Contests|Contests]]&#039;&#039;&#039;&lt;br /&gt;
# IDE tools. Built-in documentation, automatic code checking tools, debugger and so on.&lt;br /&gt;
&lt;br /&gt;
The page for built-in types (lists, dictionaries) may be hard to find using documentation search. Here it is: https://docs.python.org/3/library/stdtypes.html&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Proctoring requires you to always keep the ProctorEdu tab of your browser open. If you don&#039;t want to get warnings when you switch to another tab, please open another window of your browser.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
You must not use:&lt;br /&gt;
# Internet search. To search Python documentation, use the search tools built into the documentation: https://docs.python.org/3/search.html?q=&amp;amp;check_keywords=yes&amp;amp;area=default&lt;br /&gt;
# Any sites except the ones linked on this page.&lt;br /&gt;
# Any kind of communication except the proctoring chat.&lt;br /&gt;
# Google Colab and other web applications where it&#039;s possible to work collaboratively. Use Jupyter Notebook, Jupyter Labs or similar local software to open workshop materials in .ipynb format. Alternatively, open the materials as HTML or PDF.&lt;br /&gt;
&lt;br /&gt;
You will not be able to enter the exam after 11:15. Students who are late by more than 15 minutes will be considered absent.&lt;br /&gt;
&lt;br /&gt;
If your connection breaks for less than 10 minutes, you may continue working on the exam. The lost time will not be compensated, and you will be asked to defend your work on December 24th. If your connection breaks for more than 10 minutes and it&#039;s confirmed to be a technical issue out of your control, you are considered absent with a valid reason and you may retake the exam during the retake period.&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=63216</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=63216"/>
		<updated>2021-12-20T15:26:51Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Exam */  Добавлена ссылка на полезную страницу документации, которая часто не появляется в результатах поиска.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Sadullaev M., tg: [https://tlgg.ru/samiysamiytochniy @samiysamiytochniy]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The control work will take place on Monday, 08.11 at 12.50 in an online format using asynchronous proctoring&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The contest will start at 13.00. At 12.50 in the zoom on the lecture link there will be an instruction. Also, this zoom will be used to be able to ask a question or make an announcement during the test.&lt;br /&gt;
&lt;br /&gt;
You will have 5 problems for 80 minutes: A, В, С, D - 10 points each, E - 20 points. The points earned on the test are part of Ongoing Assesment.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their seminarist or TA. They will write a supervised test in zoom and should be prepared to further defend their works. Zoom link for such  students:https://zoom.us/j/92446507737 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;All instructions can be read here [[Introduction_to_Programming_DSBA_2021/2022/Control_work_rules | Rules]]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link to the contest:&#039;&#039;&#039; https://official.contest.yandex.com/contest/31178/problems/  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Video download link&#039;&#039;&#039; - form [https://docs.google.com/forms/d/e/1FAIpQLSeG9R8BGosVAO84z2C_lQX-GAcDxsXJ3Cfhys2t2kUo84r8cw/viewform?usp=sf_link]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Who have missed CW ===&lt;br /&gt;
&lt;br /&gt;
Students who have missed the control work for a good reason will be able to write it &#039;&#039;&#039;on Monday, December 6 at 12.50.&#039;&#039;&#039; The rules are the same as for the main attempt (proctoring with the help of OBS system, etc.) The link will be sent before the control work&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link&#039;&#039;&#039; — [https://zoom.us/j/95617319275 here]&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cpQgDzfo0qx3KLi5FqyBql34NEiWnaH5/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Wn8doFKX6QEgthcKNxozIp1vQTzxsbcg/view?usp=sharing Lecture 3. Functional &amp;amp; OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/10oO1lk5BqVHedCY5QDnH0m2eF5JHu8cB/view?usp=sharing Lecture 4. Basic data structures. Graphs.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19nr1z5Mx-cs_06KoNlik6MR2nHlLp9rj/view?usp=sharing Lecture 5. NumPy.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1iLPnPtRKwYoi1V328_1BlBRtiin4bbLv/view?usp=sharing Lecture 6. Pandas. Matplotlib. Seaborn.] &amp;lt;br&amp;gt;&lt;br /&gt;
Lecture 7.Python for data analysis. Examples: Titanic 1 [https://drive.google.com/file/d/1uTpw8kbj8oeexhEqiME1jU-1wNlVGIVK/view?usp=sharing], Titanic 2 [https://drive.google.com/file/d/1U4M_P5h1eTvRZwXL9RmaS4ZvxMgXLzcz/view?usp=sharing]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1xSStI-ObdWE76IJfKikDz7T5e1IvGA6s/view?usp=sharing Tweets] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Topic !! ipynb (Jupyter) !! html !! pdf&lt;br /&gt;
|-&lt;br /&gt;
| 1. Introduction || [[https://drive.google.com/file/d/163k2AVJAOXi5vzuqhLTUbUtXBORDWjJ0| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%201%20-%20introduction HTML]] || [[https://drive.google.com/file/d/1XiWVH77w96t4M-bDcCMQ5yDoHvaDUbJc/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 2. Numeral systems || [[https://drive.google.com/file/d/1SZqOa3szmbJtrGOvqOhOzqIWyN8lvjnO| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%202%20-%20numbering%20systems HTML]] || [[https://drive.google.com/file/d/123wWBNg80z067VBsrxRaNVnVTaxX2eZt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 3. If, while || [[https://drive.google.com/file/d/12dkRJ7DyOxn4u5rgfsD7ulA4VsZGk4_Y| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%203%20-%20if,%20for HTML]] || [[https://drive.google.com/file/d/1yJD7vFi5xLr2QUpQaN-XW2aTtBZwVKCt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 4. Floats and strings || [[https://drive.google.com/file/d/1Q1UAICsnU4nOtUqCC1GmK82Y18p6jdpo| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%204%20-%20real%20numbers%20and%20strings HTML]] || [[https://drive.google.com/file/d/1FHVmsqCxTTU03YZjrooyhXPu0_aLeYCo/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 5. Strings || [[https://drive.google.com/file/d/17oz8WLoVY-XaSiyZe48i8q55zDNOOoGu| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%205%20-%20strings HTML]] || [[https://drive.google.com/file/d/1LWgVN1_HRF9imYoBTT-oApsXWzCtqdlU/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 6. Tasks on strings || [[https://drive.google.com/file/d/1SQE9WIlXFXLAt9HwstpYbLiZSo17zOGf| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%206%20tasks%20on%20strings HTML]] || [[https://drive.google.com/file/d/1S5Dj9z4RQfrZx26GpRfJNf1VTRCBxWrZ/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| Extra: code style || [[https://drive.google.com/file/d/1KDJ0y0f4m2GjVUnURXBYCVplgXqYHH3c| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%206.%20code%20style.%20strings HTML]] || [[https://drive.google.com/file/d/1ScflFw797otQHv7dLkemNP1kxrhgBjxN/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 7. Lists and tuples || [[https://drive.google.com/file/d/1Hrt-fJlQllybqis75yz7Z8J98SCbyROD| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%207_lists_tuples HTML]] || [[https://drive.google.com/file/d/1vx0G7hd_zCw-cj-AwySJwFTLQ0EwkRSb/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 8. Tasks on lists and tuples || [[https://drive.google.com/file/d/1zGlaGLWZQ8GxjVLOI2arFbM69poj8DaY| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%208%20tasks%20on%20lists%20and%20tuples HTML]] || [[https://drive.google.com/file/d/1AnuIayxEnm4XrtA1h_f6wtyCC8WIgQw5/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 9. Functions || [[https://drive.google.com/file/d/1az-sgSitygmDGMChX2EuhuQRF7sZ8P1T| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%209_functions_and_recursion HTML]] || [[https://drive.google.com/file/d/1CojdOj7mJUOxGk31dGyQtIsbqWIfuD5A/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 10. Tasks on functions || [[https://drive.google.com/file/d/1hCh7NFgIFaQor4HnglfF-Dcgz285JEFy| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2010%20some%20more%20tasks%20on%20functions HTML]] || [[https://drive.google.com/file/d/1lHYfnUBg_3bCyqytJbnph0VO-N14ZHje/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 11. Sets and dictionaries || [[https://drive.google.com/file/d/15g-eKzRayWOIt3ZgPjhfcB0Moefy_Uhk| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2011%20sets_dictionaries HTML]] || [[https://drive.google.com/file/d/1VoLiisI92gKjIzd2e_sy3xvUnmEQQ_tr/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 12. Tasks on sets and dictionaries || [[https://drive.google.com/file/d/14Y4PqEVEDqhcWibSCFmE1XuGqo3VUxh5| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2012.%20tasks%20on%20sets%20and%20dictionaries HTML]] || [[https://drive.google.com/file/d/1EZ0NnyFlabcls1l6uHwgepJ7Op3gIre7/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 13-14. Sorting and searching || [[https://drive.google.com/file/d/14rZvEish6O0uY5NLfm1Z8wlJpaYXvZfS| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2013.%20sorting%20and%20searching HTML]] || [[https://drive.google.com/file/d/1PtqR2-TNiJJ9Vt9zVDNzuzpKZvkGzoqa/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 15. Iterators and generators || [[https://drive.google.com/file/d/1EnkVxx2QJ6UBK6uEgV35rTO7TK_JSh6G| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2015%20iterators%20and%20generators HTML]] || [[https://drive.google.com/file/d/1F4uy9x1Ux1HR6q7FXcighmyR2XW7BuXU/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 16. Tasks on functional programming || [[https://drive.google.com/file/d/1xFiGPwNkJztADLbskVqUpR_iboX8kvn0| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2016%20functional%20tasks HTML]] || [[https://drive.google.com/file/d/1Xode0cKPxe4-Jq6Ywy1DyMLoABIzrAyx/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 17. Abstract data structures || [[https://drive.google.com/file/d/1fRzr5BOQzzLrB3X2p5p6AeeljT1xHcE3| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2017%20abstract%20data%20structures HTML]] || [[https://drive.google.com/file/d/1gvZygA1-29tWFYXxI60E6Ht5UW8j7ZEQ/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| Extra: graphs, search algorithms || [[https://drive.google.com/file/d/1TJbAw_21DfrRpHSeQmOLWA4pWpFYUm0F| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2017.5%20graphs.%20trees.%20practice HTML]] || [[https://drive.google.com/file/d/1-3R9BViqZOWfzTsQ0LdNpa-IHhl-EHM9/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 18. Files and exceptions || [[https://drive.google.com/file/d/1ewXawJhhl6pc8E1ZKrFc2vkZqGQG8yqR| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2018%20files,%20exceptions,%20errors HTML]] || [[https://drive.google.com/file/d/11SeZbzTku5pdiqNnpHFWAEqgk_Eg-Abn/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 19. Test solutions. Practice || [[https://drive.google.com/file/d/1RHo1UV6RWsVow77NjDA5mCUHbRkWiBNk| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2019.%20test%20solutions.%20practice.%20random HTML]] || [[https://drive.google.com/file/d/1KCSUAVRZ-Gjx2gZ0NxwP3CJlHxkO5d_K/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 20. File system || [[https://drive.google.com/file/d/11Uj52_pOlLu_b1TFMgPXf4BpiMYVjuPo| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2020.%20file%20system.%20practice HTML]] || [[https://drive.google.com/file/d/1V9LC4LQSIv14kCsQb3EtKYl-3Q7SsI5v/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 21. Numpy. Pandas || [[https://drive.google.com/file/d/1RYc16Si3KOGjornzRhGG0cR_ldk0upOD| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2021%20numpy%20pandas HTML]] || [[https://drive.google.com/file/d/1Joy4Vl3Orgbo-hfma9usqWUSfvoYtonr/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 22. Pandas || [[https://drive.google.com/file/d/1WqyvV9_h5eD_dDMine4bRYyjEUAzNWQw| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2022%20pandas HTML]] || [[https://drive.google.com/file/d/1ZTRjILBQevf8oKlXUhiheIvKwcGZXH-x/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 23. Data analysis. Visualization || [[https://drive.google.com/file/d/1VXqRxxfI9b1Hp_zi_VccTbO7fLlesH1t| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2023.%20data%20analysis%20examples.%20visualization HTML]] || [[https://drive.google.com/file/d/1mdJOgYckOpJqu82krE8rf9QGZbky-EK-/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 24. Visualization || [[https://drive.google.com/file/d/1rafsGZoSxILN1NbtwZAUvMUoaEGsQ-Cp| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2024.%20visualization. HTML]] || [[https://drive.google.com/file/d/1P9ITSj1ToL_w0gKX4BKF-ZdsrMoHmBTe/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 25-26. Web requests. Scraping. || [[https://drive.google.com/file/d/1PlIMK9UkOCKlyRP-wiFfBnMCm9hIVc3J| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2025-26%20web%20scraping,%20requests HTML]] || [[https://drive.google.com/file/d/1zG03U9HnlZEhoEaIrtZzkpfjqxl2elss/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 27. Flask || [[https://drive.google.com/file/d/19Gg8rmlnlCQmkH7jkA7Ohcc9GGsjoSnQ| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop_27_flask_part_1 HTML]] || [[https://drive.google.com/file/d/15whemE-OqO1xX3Zgla_mM4B46ab48Nmt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 28. Deploying Flask || [[https://drive.google.com/file/d/1gwU27N-Cb98zKIoAIMmiW2gUkZFMZt1G| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop_27_flask_part_2 HTML]] || [[https://drive.google.com/file/d/1T5cElJqCQhFUvJ9NoBaWm3UZ81h-14Mx/view?usp=sharing PDF]]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 16 november 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31586/enter/ Contest 7 (pilot)] || 30 november 2021, 22:00:00  &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31178/enter/ Test] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 12th, 23:59&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Submission format&#039;&#039;&#039;: Jupyter Notebook + Data file. Submit the notebook file and the dataset example via this Google form: https://forms.gle/cvG8tLn2ugjMMAPj8&lt;br /&gt;
&lt;br /&gt;
If your data is larger than 10 MB, please use a subset of data under 10 MB and submit the subset into the form.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dataset selection&#039;&#039;&#039;: After you choose a dataset for the project, submit it to this form: https://forms.gle/hQx7fpaneXKgRAJt9&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it.&lt;br /&gt;
https://docs.google.com/spreadsheets/d/1WQSgOzQdamwSWXexN7EHtVv2sstl6A9yVguQUMCAcZk&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Project description&#039;&#039;&#039;: Find a dataset with text data and analyze it the following way.&lt;br /&gt;
&lt;br /&gt;
* Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
* Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
* Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of column A for different values of column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
* Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
* For pilot students one of the requirements is to set up a web server using the Flask framework. Web Server interface should be one of the following: end users must be able to get required data using get-requests, html page or telegram-bot.&lt;br /&gt;
&lt;br /&gt;
Additional notes:&lt;br /&gt;
&lt;br /&gt;
* Plots for tasks 2 and 3 are counted separately. So, your project has to have at least 5 plots in total.&lt;br /&gt;
* Make sure your plots have proper legends, titles, axis titles, so that it’s easy to understand what the graph represents.&lt;br /&gt;
* Try to format your project as a sequence of problems you’re solving. What the data looks like, what are some questions you can answer with the data. You should try to make a simple analysis project instead of doing exactly the bare minimum of tasks 1-4.&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
The exam is held &#039;&#039;&#039;on December 21st starting at 10:40&#039;&#039;&#039;: you should enter the system at 10:40. The contest starts at 11:00. The total length of the exam is 120 minutes without breaks. After 120 minutes pass from the start of the exam, Yandex.Contest will stop counting your solutions towards the total grade, even though it will still be possible to upload the solutions.&lt;br /&gt;
&lt;br /&gt;
During the exam:&lt;br /&gt;
&lt;br /&gt;
You may use:&lt;br /&gt;
# Lecture and workshop materials. Links: &#039;&#039;&#039;[[Introduction_to_Programming_DSBA_2021/2022#Workshop_notes|Workshop materials]], [[Introduction_to_Programming_DSBA_2021/2022#Lecture_notes|Lecture notes]]&#039;&#039;&#039;&lt;br /&gt;
# Printed lecture and workshop materials.&lt;br /&gt;
# Python documentation at https://docs.python.org&lt;br /&gt;
# Your solutions to tasks from homeworks and the control work. Use Yandex.Contest only to open your previous code. Link: &#039;&#039;&#039;[[Introduction_to_Programming_DSBA_2021/2022#Contests|Contests]]&#039;&#039;&#039;&lt;br /&gt;
# IDE tools. Built-in documentation, automatic code checking tools, debugger and so on.&lt;br /&gt;
&lt;br /&gt;
The page for built-in types (lists, dictionaries) may be hard to find using documentation search. Here it is: https://docs.python.org/3/library/stdtypes.html&lt;br /&gt;
&lt;br /&gt;
You must not use:&lt;br /&gt;
# Internet search. To search Python documentation, use the search tools built into the documentation: https://docs.python.org/3/search.html?q=&amp;amp;check_keywords=yes&amp;amp;area=default&lt;br /&gt;
# Any sites except the ones linked on this page.&lt;br /&gt;
# Any kind of communication except the proctoring chat.&lt;br /&gt;
# Google Colab and other web applications where it&#039;s possible to work collaboratively. Use Jupyter Notebook, Jupyter Labs or similar local software to open workshop materials in .ipynb format. Alternatively, open the materials as HTML or PDF.&lt;br /&gt;
&lt;br /&gt;
You will not be able to enter the exam after 11:15. Students who are late by more than 15 minutes will be considered absent.&lt;br /&gt;
&lt;br /&gt;
If your connection breaks for less than 10 minutes, you may continue working on the exam. The lost time will not be compensated, and you will be asked to defend your work on December 24th. If your connection breaks for more than 10 minutes and it&#039;s confirmed to be a technical issue out of your control, you are considered absent with a valid reason and you may retake the exam during the retake period.&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=63211</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=63211"/>
		<updated>2021-12-20T14:56:39Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Exam */ Добавлены описание и правила экзамена&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Sadullaev M., tg: [https://tlgg.ru/samiysamiytochniy @samiysamiytochniy]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The control work will take place on Monday, 08.11 at 12.50 in an online format using asynchronous proctoring&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The contest will start at 13.00. At 12.50 in the zoom on the lecture link there will be an instruction. Also, this zoom will be used to be able to ask a question or make an announcement during the test.&lt;br /&gt;
&lt;br /&gt;
You will have 5 problems for 80 minutes: A, В, С, D - 10 points each, E - 20 points. The points earned on the test are part of Ongoing Assesment.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their seminarist or TA. They will write a supervised test in zoom and should be prepared to further defend their works. Zoom link for such  students:https://zoom.us/j/92446507737 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;All instructions can be read here [[Introduction_to_Programming_DSBA_2021/2022/Control_work_rules | Rules]]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link to the contest:&#039;&#039;&#039; https://official.contest.yandex.com/contest/31178/problems/  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Video download link&#039;&#039;&#039; - form [https://docs.google.com/forms/d/e/1FAIpQLSeG9R8BGosVAO84z2C_lQX-GAcDxsXJ3Cfhys2t2kUo84r8cw/viewform?usp=sf_link]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Who have missed CW ===&lt;br /&gt;
&lt;br /&gt;
Students who have missed the control work for a good reason will be able to write it &#039;&#039;&#039;on Monday, December 6 at 12.50.&#039;&#039;&#039; The rules are the same as for the main attempt (proctoring with the help of OBS system, etc.) The link will be sent before the control work&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link&#039;&#039;&#039; — [https://zoom.us/j/95617319275 here]&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cpQgDzfo0qx3KLi5FqyBql34NEiWnaH5/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Wn8doFKX6QEgthcKNxozIp1vQTzxsbcg/view?usp=sharing Lecture 3. Functional &amp;amp; OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/10oO1lk5BqVHedCY5QDnH0m2eF5JHu8cB/view?usp=sharing Lecture 4. Basic data structures. Graphs.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19nr1z5Mx-cs_06KoNlik6MR2nHlLp9rj/view?usp=sharing Lecture 5. NumPy.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1iLPnPtRKwYoi1V328_1BlBRtiin4bbLv/view?usp=sharing Lecture 6. Pandas. Matplotlib. Seaborn.] &amp;lt;br&amp;gt;&lt;br /&gt;
Lecture 7.Python for data analysis. Examples: Titanic 1 [https://drive.google.com/file/d/1uTpw8kbj8oeexhEqiME1jU-1wNlVGIVK/view?usp=sharing], Titanic 2 [https://drive.google.com/file/d/1U4M_P5h1eTvRZwXL9RmaS4ZvxMgXLzcz/view?usp=sharing]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1xSStI-ObdWE76IJfKikDz7T5e1IvGA6s/view?usp=sharing Tweets] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Topic !! ipynb (Jupyter) !! html !! pdf&lt;br /&gt;
|-&lt;br /&gt;
| 1. Introduction || [[https://drive.google.com/file/d/163k2AVJAOXi5vzuqhLTUbUtXBORDWjJ0| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%201%20-%20introduction HTML]] || [[https://drive.google.com/file/d/1XiWVH77w96t4M-bDcCMQ5yDoHvaDUbJc/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 2. Numeral systems || [[https://drive.google.com/file/d/1SZqOa3szmbJtrGOvqOhOzqIWyN8lvjnO| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%202%20-%20numbering%20systems HTML]] || [[https://drive.google.com/file/d/123wWBNg80z067VBsrxRaNVnVTaxX2eZt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 3. If, while || [[https://drive.google.com/file/d/12dkRJ7DyOxn4u5rgfsD7ulA4VsZGk4_Y| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%203%20-%20if,%20for HTML]] || [[https://drive.google.com/file/d/1yJD7vFi5xLr2QUpQaN-XW2aTtBZwVKCt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 4. Floats and strings || [[https://drive.google.com/file/d/1Q1UAICsnU4nOtUqCC1GmK82Y18p6jdpo| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%204%20-%20real%20numbers%20and%20strings HTML]] || [[https://drive.google.com/file/d/1FHVmsqCxTTU03YZjrooyhXPu0_aLeYCo/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 5. Strings || [[https://drive.google.com/file/d/17oz8WLoVY-XaSiyZe48i8q55zDNOOoGu| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%205%20-%20strings HTML]] || [[https://drive.google.com/file/d/1LWgVN1_HRF9imYoBTT-oApsXWzCtqdlU/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 6. Tasks on strings || [[https://drive.google.com/file/d/1SQE9WIlXFXLAt9HwstpYbLiZSo17zOGf| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%206%20tasks%20on%20strings HTML]] || [[https://drive.google.com/file/d/1S5Dj9z4RQfrZx26GpRfJNf1VTRCBxWrZ/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| Extra: code style || [[https://drive.google.com/file/d/1KDJ0y0f4m2GjVUnURXBYCVplgXqYHH3c| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%206.%20code%20style.%20strings HTML]] || [[https://drive.google.com/file/d/1ScflFw797otQHv7dLkemNP1kxrhgBjxN/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 7. Lists and tuples || [[https://drive.google.com/file/d/1Hrt-fJlQllybqis75yz7Z8J98SCbyROD| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%207_lists_tuples HTML]] || [[https://drive.google.com/file/d/1vx0G7hd_zCw-cj-AwySJwFTLQ0EwkRSb/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 8. Tasks on lists and tuples || [[https://drive.google.com/file/d/1zGlaGLWZQ8GxjVLOI2arFbM69poj8DaY| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%208%20tasks%20on%20lists%20and%20tuples HTML]] || [[https://drive.google.com/file/d/1AnuIayxEnm4XrtA1h_f6wtyCC8WIgQw5/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 9. Functions || [[https://drive.google.com/file/d/1az-sgSitygmDGMChX2EuhuQRF7sZ8P1T| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%209_functions_and_recursion HTML]] || [[https://drive.google.com/file/d/1CojdOj7mJUOxGk31dGyQtIsbqWIfuD5A/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 10. Tasks on functions || [[https://drive.google.com/file/d/1hCh7NFgIFaQor4HnglfF-Dcgz285JEFy| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2010%20some%20more%20tasks%20on%20functions HTML]] || [[https://drive.google.com/file/d/1lHYfnUBg_3bCyqytJbnph0VO-N14ZHje/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 11. Sets and dictionaries || [[https://drive.google.com/file/d/15g-eKzRayWOIt3ZgPjhfcB0Moefy_Uhk| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2011%20sets_dictionaries HTML]] || [[https://drive.google.com/file/d/1VoLiisI92gKjIzd2e_sy3xvUnmEQQ_tr/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 12. Tasks on sets and dictionaries || [[https://drive.google.com/file/d/14Y4PqEVEDqhcWibSCFmE1XuGqo3VUxh5| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2012.%20tasks%20on%20sets%20and%20dictionaries HTML]] || [[https://drive.google.com/file/d/1EZ0NnyFlabcls1l6uHwgepJ7Op3gIre7/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 13-14. Sorting and searching || [[https://drive.google.com/file/d/14rZvEish6O0uY5NLfm1Z8wlJpaYXvZfS| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2013.%20sorting%20and%20searching HTML]] || [[https://drive.google.com/file/d/1PtqR2-TNiJJ9Vt9zVDNzuzpKZvkGzoqa/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 15. Iterators and generators || [[https://drive.google.com/file/d/1EnkVxx2QJ6UBK6uEgV35rTO7TK_JSh6G| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2015%20iterators%20and%20generators HTML]] || [[https://drive.google.com/file/d/1F4uy9x1Ux1HR6q7FXcighmyR2XW7BuXU/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 16. Tasks on functional programming || [[https://drive.google.com/file/d/1xFiGPwNkJztADLbskVqUpR_iboX8kvn0| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2016%20functional%20tasks HTML]] || [[https://drive.google.com/file/d/1Xode0cKPxe4-Jq6Ywy1DyMLoABIzrAyx/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 17. Abstract data structures || [[https://drive.google.com/file/d/1fRzr5BOQzzLrB3X2p5p6AeeljT1xHcE3| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2017%20abstract%20data%20structures HTML]] || [[https://drive.google.com/file/d/1gvZygA1-29tWFYXxI60E6Ht5UW8j7ZEQ/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| Extra: graphs, search algorithms || [[https://drive.google.com/file/d/1TJbAw_21DfrRpHSeQmOLWA4pWpFYUm0F| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2017.5%20graphs.%20trees.%20practice HTML]] || [[https://drive.google.com/file/d/1-3R9BViqZOWfzTsQ0LdNpa-IHhl-EHM9/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 18. Files and exceptions || [[https://drive.google.com/file/d/1ewXawJhhl6pc8E1ZKrFc2vkZqGQG8yqR| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2018%20files,%20exceptions,%20errors HTML]] || [[https://drive.google.com/file/d/11SeZbzTku5pdiqNnpHFWAEqgk_Eg-Abn/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 19. Test solutions. Practice || [[https://drive.google.com/file/d/1RHo1UV6RWsVow77NjDA5mCUHbRkWiBNk| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2019.%20test%20solutions.%20practice.%20random HTML]] || [[https://drive.google.com/file/d/1KCSUAVRZ-Gjx2gZ0NxwP3CJlHxkO5d_K/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 20. File system || [[https://drive.google.com/file/d/11Uj52_pOlLu_b1TFMgPXf4BpiMYVjuPo| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2020.%20file%20system.%20practice HTML]] || [[https://drive.google.com/file/d/1V9LC4LQSIv14kCsQb3EtKYl-3Q7SsI5v/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 21. Numpy. Pandas || [[https://drive.google.com/file/d/1RYc16Si3KOGjornzRhGG0cR_ldk0upOD| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2021%20numpy%20pandas HTML]] || [[https://drive.google.com/file/d/1Joy4Vl3Orgbo-hfma9usqWUSfvoYtonr/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 22. Pandas || [[https://drive.google.com/file/d/1WqyvV9_h5eD_dDMine4bRYyjEUAzNWQw| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2022%20pandas HTML]] || [[https://drive.google.com/file/d/1ZTRjILBQevf8oKlXUhiheIvKwcGZXH-x/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 23. Data analysis. Visualization || [[https://drive.google.com/file/d/1VXqRxxfI9b1Hp_zi_VccTbO7fLlesH1t| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2023.%20data%20analysis%20examples.%20visualization HTML]] || [[https://drive.google.com/file/d/1mdJOgYckOpJqu82krE8rf9QGZbky-EK-/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 24. Visualization || [[https://drive.google.com/file/d/1rafsGZoSxILN1NbtwZAUvMUoaEGsQ-Cp| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2024.%20visualization. HTML]] || [[https://drive.google.com/file/d/1P9ITSj1ToL_w0gKX4BKF-ZdsrMoHmBTe/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 25-26. Web requests. Scraping. || [[https://drive.google.com/file/d/1PlIMK9UkOCKlyRP-wiFfBnMCm9hIVc3J| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2025-26%20web%20scraping,%20requests HTML]] || [[https://drive.google.com/file/d/1zG03U9HnlZEhoEaIrtZzkpfjqxl2elss/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 27. Flask || [[https://drive.google.com/file/d/19Gg8rmlnlCQmkH7jkA7Ohcc9GGsjoSnQ| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop_27_flask_part_1 HTML]] || [[https://drive.google.com/file/d/15whemE-OqO1xX3Zgla_mM4B46ab48Nmt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 28. Deploying Flask || [[https://drive.google.com/file/d/1gwU27N-Cb98zKIoAIMmiW2gUkZFMZt1G| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop_27_flask_part_2 HTML]] || [[https://drive.google.com/file/d/1T5cElJqCQhFUvJ9NoBaWm3UZ81h-14Mx/view?usp=sharing PDF]]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 16 november 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31586/enter/ Contest 7 (pilot)] || 30 november 2021, 22:00:00  &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31178/enter/ Test] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 12th, 23:59&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Submission format&#039;&#039;&#039;: Jupyter Notebook + Data file. Submit the notebook file and the dataset example via this Google form: https://forms.gle/cvG8tLn2ugjMMAPj8&lt;br /&gt;
&lt;br /&gt;
If your data is larger than 10 MB, please use a subset of data under 10 MB and submit the subset into the form.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dataset selection&#039;&#039;&#039;: After you choose a dataset for the project, submit it to this form: https://forms.gle/hQx7fpaneXKgRAJt9&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it.&lt;br /&gt;
https://docs.google.com/spreadsheets/d/1WQSgOzQdamwSWXexN7EHtVv2sstl6A9yVguQUMCAcZk&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Project description&#039;&#039;&#039;: Find a dataset with text data and analyze it the following way.&lt;br /&gt;
&lt;br /&gt;
* Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
* Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
* Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of column A for different values of column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
* Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
* For pilot students one of the requirements is to set up a web server using the Flask framework. Web Server interface should be one of the following: end users must be able to get required data using get-requests, html page or telegram-bot.&lt;br /&gt;
&lt;br /&gt;
Additional notes:&lt;br /&gt;
&lt;br /&gt;
* Plots for tasks 2 and 3 are counted separately. So, your project has to have at least 5 plots in total.&lt;br /&gt;
* Make sure your plots have proper legends, titles, axis titles, so that it’s easy to understand what the graph represents.&lt;br /&gt;
* Try to format your project as a sequence of problems you’re solving. What the data looks like, what are some questions you can answer with the data. You should try to make a simple analysis project instead of doing exactly the bare minimum of tasks 1-4.&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
The exam is held on December 21st starting at 10:40: you should enter the system at 10:40. The contest starts at 11:00. The total length of the exam is 120 minutes without breaks. The time for uploading solutions is included in the total exam time. After 120 minutes pass from the start of the exam, Yandex.Contest will stop counting your solutions towards the total grade, even though it will still be possible to upload the solutions.&lt;br /&gt;
&lt;br /&gt;
During the exam you can use any resources linked on this page.&lt;br /&gt;
&lt;br /&gt;
You may use:&lt;br /&gt;
# Lecture and workshop materials. Links: &#039;&#039;&#039;[[Introduction_to_Programming_DSBA_2021/2022#Workshop_notes|Workshop materials]], [[Introduction_to_Programming_DSBA_2021/2022#Lecture_notes|Lecture notes]]&#039;&#039;&#039;&lt;br /&gt;
# Printed lecture and workshop materials.&lt;br /&gt;
# Python documentation at https://docs.python.org&lt;br /&gt;
# Your solutions to tasks from homeworks and the control work. Use Yandex.Contest to open your previous code. Link: &#039;&#039;&#039;[[Introduction_to_Programming_DSBA_2021/2022#Contests|Contests]]&#039;&#039;&#039;&lt;br /&gt;
# IDE tools. Built-in documentation, automatic code checking tools, debugger and so on.&lt;br /&gt;
&lt;br /&gt;
You must not use:&lt;br /&gt;
# Internet search. To search Python documentation, use the search tools built into the documentation: https://docs.python.org/3/search.html?q=&amp;amp;check_keywords=yes&amp;amp;area=default&lt;br /&gt;
# Any sites except the ones linked on this page.&lt;br /&gt;
# Any kind of communication except the proctoring chat.&lt;br /&gt;
# Google Colab and other web applications where it&#039;s possible to work collaboratively. Use Jupyter Notebook, Jupyter Labs or similar local software to open workshop materials in .ipynb format. Alternatively, open the materials as HTML or PDF.&lt;br /&gt;
&lt;br /&gt;
You will not be able to enter the exam after 11:15. Students who are late by more than 15 minutes will be considered absent.&lt;br /&gt;
&lt;br /&gt;
If your connection breaks for less than 10 minutes, you may continue working on the exam. The lost time will not be compensated, and you will be asked to defend your work on December 24th. If your connection breaks for more than 10 minutes and it&#039;s confirmed to be a technical issue out of your control, you are considered absent with a valid reason and you may retake the exam during the retake period.&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=63210</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=63210"/>
		<updated>2021-12-20T14:52:56Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Contests */  Добавлена ссылка на контрольную, чтобы её можно было проще найти во время экзамена&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Sadullaev M., tg: [https://tlgg.ru/samiysamiytochniy @samiysamiytochniy]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The control work will take place on Monday, 08.11 at 12.50 in an online format using asynchronous proctoring&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The contest will start at 13.00. At 12.50 in the zoom on the lecture link there will be an instruction. Also, this zoom will be used to be able to ask a question or make an announcement during the test.&lt;br /&gt;
&lt;br /&gt;
You will have 5 problems for 80 minutes: A, В, С, D - 10 points each, E - 20 points. The points earned on the test are part of Ongoing Assesment.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their seminarist or TA. They will write a supervised test in zoom and should be prepared to further defend their works. Zoom link for such  students:https://zoom.us/j/92446507737 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;All instructions can be read here [[Introduction_to_Programming_DSBA_2021/2022/Control_work_rules | Rules]]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link to the contest:&#039;&#039;&#039; https://official.contest.yandex.com/contest/31178/problems/  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Video download link&#039;&#039;&#039; - form [https://docs.google.com/forms/d/e/1FAIpQLSeG9R8BGosVAO84z2C_lQX-GAcDxsXJ3Cfhys2t2kUo84r8cw/viewform?usp=sf_link]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Who have missed CW ===&lt;br /&gt;
&lt;br /&gt;
Students who have missed the control work for a good reason will be able to write it &#039;&#039;&#039;on Monday, December 6 at 12.50.&#039;&#039;&#039; The rules are the same as for the main attempt (proctoring with the help of OBS system, etc.) The link will be sent before the control work&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link&#039;&#039;&#039; — [https://zoom.us/j/95617319275 here]&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cpQgDzfo0qx3KLi5FqyBql34NEiWnaH5/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Wn8doFKX6QEgthcKNxozIp1vQTzxsbcg/view?usp=sharing Lecture 3. Functional &amp;amp; OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/10oO1lk5BqVHedCY5QDnH0m2eF5JHu8cB/view?usp=sharing Lecture 4. Basic data structures. Graphs.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19nr1z5Mx-cs_06KoNlik6MR2nHlLp9rj/view?usp=sharing Lecture 5. NumPy.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1iLPnPtRKwYoi1V328_1BlBRtiin4bbLv/view?usp=sharing Lecture 6. Pandas. Matplotlib. Seaborn.] &amp;lt;br&amp;gt;&lt;br /&gt;
Lecture 7.Python for data analysis. Examples: Titanic 1 [https://drive.google.com/file/d/1uTpw8kbj8oeexhEqiME1jU-1wNlVGIVK/view?usp=sharing], Titanic 2 [https://drive.google.com/file/d/1U4M_P5h1eTvRZwXL9RmaS4ZvxMgXLzcz/view?usp=sharing]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1xSStI-ObdWE76IJfKikDz7T5e1IvGA6s/view?usp=sharing Tweets] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Topic !! ipynb (Jupyter) !! html !! pdf&lt;br /&gt;
|-&lt;br /&gt;
| 1. Introduction || [[https://drive.google.com/file/d/163k2AVJAOXi5vzuqhLTUbUtXBORDWjJ0| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%201%20-%20introduction HTML]] || [[https://drive.google.com/file/d/1XiWVH77w96t4M-bDcCMQ5yDoHvaDUbJc/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 2. Numeral systems || [[https://drive.google.com/file/d/1SZqOa3szmbJtrGOvqOhOzqIWyN8lvjnO| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%202%20-%20numbering%20systems HTML]] || [[https://drive.google.com/file/d/123wWBNg80z067VBsrxRaNVnVTaxX2eZt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 3. If, while || [[https://drive.google.com/file/d/12dkRJ7DyOxn4u5rgfsD7ulA4VsZGk4_Y| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%203%20-%20if,%20for HTML]] || [[https://drive.google.com/file/d/1yJD7vFi5xLr2QUpQaN-XW2aTtBZwVKCt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 4. Floats and strings || [[https://drive.google.com/file/d/1Q1UAICsnU4nOtUqCC1GmK82Y18p6jdpo| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%204%20-%20real%20numbers%20and%20strings HTML]] || [[https://drive.google.com/file/d/1FHVmsqCxTTU03YZjrooyhXPu0_aLeYCo/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 5. Strings || [[https://drive.google.com/file/d/17oz8WLoVY-XaSiyZe48i8q55zDNOOoGu| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%205%20-%20strings HTML]] || [[https://drive.google.com/file/d/1LWgVN1_HRF9imYoBTT-oApsXWzCtqdlU/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 6. Tasks on strings || [[https://drive.google.com/file/d/1SQE9WIlXFXLAt9HwstpYbLiZSo17zOGf| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%206%20tasks%20on%20strings HTML]] || [[https://drive.google.com/file/d/1S5Dj9z4RQfrZx26GpRfJNf1VTRCBxWrZ/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| Extra: code style || [[https://drive.google.com/file/d/1KDJ0y0f4m2GjVUnURXBYCVplgXqYHH3c| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%206.%20code%20style.%20strings HTML]] || [[https://drive.google.com/file/d/1ScflFw797otQHv7dLkemNP1kxrhgBjxN/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 7. Lists and tuples || [[https://drive.google.com/file/d/1Hrt-fJlQllybqis75yz7Z8J98SCbyROD| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%207_lists_tuples HTML]] || [[https://drive.google.com/file/d/1vx0G7hd_zCw-cj-AwySJwFTLQ0EwkRSb/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 8. Tasks on lists and tuples || [[https://drive.google.com/file/d/1zGlaGLWZQ8GxjVLOI2arFbM69poj8DaY| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%208%20tasks%20on%20lists%20and%20tuples HTML]] || [[https://drive.google.com/file/d/1AnuIayxEnm4XrtA1h_f6wtyCC8WIgQw5/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 9. Functions || [[https://drive.google.com/file/d/1az-sgSitygmDGMChX2EuhuQRF7sZ8P1T| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%209_functions_and_recursion HTML]] || [[https://drive.google.com/file/d/1CojdOj7mJUOxGk31dGyQtIsbqWIfuD5A/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 10. Tasks on functions || [[https://drive.google.com/file/d/1hCh7NFgIFaQor4HnglfF-Dcgz285JEFy| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2010%20some%20more%20tasks%20on%20functions HTML]] || [[https://drive.google.com/file/d/1lHYfnUBg_3bCyqytJbnph0VO-N14ZHje/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 11. Sets and dictionaries || [[https://drive.google.com/file/d/15g-eKzRayWOIt3ZgPjhfcB0Moefy_Uhk| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2011%20sets_dictionaries HTML]] || [[https://drive.google.com/file/d/1VoLiisI92gKjIzd2e_sy3xvUnmEQQ_tr/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 12. Tasks on sets and dictionaries || [[https://drive.google.com/file/d/14Y4PqEVEDqhcWibSCFmE1XuGqo3VUxh5| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2012.%20tasks%20on%20sets%20and%20dictionaries HTML]] || [[https://drive.google.com/file/d/1EZ0NnyFlabcls1l6uHwgepJ7Op3gIre7/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 13-14. Sorting and searching || [[https://drive.google.com/file/d/14rZvEish6O0uY5NLfm1Z8wlJpaYXvZfS| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2013.%20sorting%20and%20searching HTML]] || [[https://drive.google.com/file/d/1PtqR2-TNiJJ9Vt9zVDNzuzpKZvkGzoqa/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 15. Iterators and generators || [[https://drive.google.com/file/d/1EnkVxx2QJ6UBK6uEgV35rTO7TK_JSh6G| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2015%20iterators%20and%20generators HTML]] || [[https://drive.google.com/file/d/1F4uy9x1Ux1HR6q7FXcighmyR2XW7BuXU/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 16. Tasks on functional programming || [[https://drive.google.com/file/d/1xFiGPwNkJztADLbskVqUpR_iboX8kvn0| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2016%20functional%20tasks HTML]] || [[https://drive.google.com/file/d/1Xode0cKPxe4-Jq6Ywy1DyMLoABIzrAyx/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 17. Abstract data structures || [[https://drive.google.com/file/d/1fRzr5BOQzzLrB3X2p5p6AeeljT1xHcE3| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2017%20abstract%20data%20structures HTML]] || [[https://drive.google.com/file/d/1gvZygA1-29tWFYXxI60E6Ht5UW8j7ZEQ/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| Extra: graphs, search algorithms || [[https://drive.google.com/file/d/1TJbAw_21DfrRpHSeQmOLWA4pWpFYUm0F| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2017.5%20graphs.%20trees.%20practice HTML]] || [[https://drive.google.com/file/d/1-3R9BViqZOWfzTsQ0LdNpa-IHhl-EHM9/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 18. Files and exceptions || [[https://drive.google.com/file/d/1ewXawJhhl6pc8E1ZKrFc2vkZqGQG8yqR| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2018%20files,%20exceptions,%20errors HTML]] || [[https://drive.google.com/file/d/11SeZbzTku5pdiqNnpHFWAEqgk_Eg-Abn/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 19. Test solutions. Practice || [[https://drive.google.com/file/d/1RHo1UV6RWsVow77NjDA5mCUHbRkWiBNk| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2019.%20test%20solutions.%20practice.%20random HTML]] || [[https://drive.google.com/file/d/1KCSUAVRZ-Gjx2gZ0NxwP3CJlHxkO5d_K/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 20. File system || [[https://drive.google.com/file/d/11Uj52_pOlLu_b1TFMgPXf4BpiMYVjuPo| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2020.%20file%20system.%20practice HTML]] || [[https://drive.google.com/file/d/1V9LC4LQSIv14kCsQb3EtKYl-3Q7SsI5v/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 21. Numpy. Pandas || [[https://drive.google.com/file/d/1RYc16Si3KOGjornzRhGG0cR_ldk0upOD| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2021%20numpy%20pandas HTML]] || [[https://drive.google.com/file/d/1Joy4Vl3Orgbo-hfma9usqWUSfvoYtonr/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 22. Pandas || [[https://drive.google.com/file/d/1WqyvV9_h5eD_dDMine4bRYyjEUAzNWQw| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2022%20pandas HTML]] || [[https://drive.google.com/file/d/1ZTRjILBQevf8oKlXUhiheIvKwcGZXH-x/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 23. Data analysis. Visualization || [[https://drive.google.com/file/d/1VXqRxxfI9b1Hp_zi_VccTbO7fLlesH1t| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2023.%20data%20analysis%20examples.%20visualization HTML]] || [[https://drive.google.com/file/d/1mdJOgYckOpJqu82krE8rf9QGZbky-EK-/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 24. Visualization || [[https://drive.google.com/file/d/1rafsGZoSxILN1NbtwZAUvMUoaEGsQ-Cp| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2024.%20visualization. HTML]] || [[https://drive.google.com/file/d/1P9ITSj1ToL_w0gKX4BKF-ZdsrMoHmBTe/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 25-26. Web requests. Scraping. || [[https://drive.google.com/file/d/1PlIMK9UkOCKlyRP-wiFfBnMCm9hIVc3J| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2025-26%20web%20scraping,%20requests HTML]] || [[https://drive.google.com/file/d/1zG03U9HnlZEhoEaIrtZzkpfjqxl2elss/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 27. Flask || [[https://drive.google.com/file/d/19Gg8rmlnlCQmkH7jkA7Ohcc9GGsjoSnQ| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop_27_flask_part_1 HTML]] || [[https://drive.google.com/file/d/15whemE-OqO1xX3Zgla_mM4B46ab48Nmt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 28. Deploying Flask || [[https://drive.google.com/file/d/1gwU27N-Cb98zKIoAIMmiW2gUkZFMZt1G| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop_27_flask_part_2 HTML]] || [[https://drive.google.com/file/d/1T5cElJqCQhFUvJ9NoBaWm3UZ81h-14Mx/view?usp=sharing PDF]]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 16 november 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31586/enter/ Contest 7 (pilot)] || 30 november 2021, 22:00:00  &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31178/enter/ Test] || &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 12th, 23:59&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Submission format&#039;&#039;&#039;: Jupyter Notebook + Data file. Submit the notebook file and the dataset example via this Google form: https://forms.gle/cvG8tLn2ugjMMAPj8&lt;br /&gt;
&lt;br /&gt;
If your data is larger than 10 MB, please use a subset of data under 10 MB and submit the subset into the form.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dataset selection&#039;&#039;&#039;: After you choose a dataset for the project, submit it to this form: https://forms.gle/hQx7fpaneXKgRAJt9&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it.&lt;br /&gt;
https://docs.google.com/spreadsheets/d/1WQSgOzQdamwSWXexN7EHtVv2sstl6A9yVguQUMCAcZk&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Project description&#039;&#039;&#039;: Find a dataset with text data and analyze it the following way.&lt;br /&gt;
&lt;br /&gt;
* Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
* Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
* Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of column A for different values of column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
* Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
* For pilot students one of the requirements is to set up a web server using the Flask framework. Web Server interface should be one of the following: end users must be able to get required data using get-requests, html page or telegram-bot.&lt;br /&gt;
&lt;br /&gt;
Additional notes:&lt;br /&gt;
&lt;br /&gt;
* Plots for tasks 2 and 3 are counted separately. So, your project has to have at least 5 plots in total.&lt;br /&gt;
* Make sure your plots have proper legends, titles, axis titles, so that it’s easy to understand what the graph represents.&lt;br /&gt;
* Try to format your project as a sequence of problems you’re solving. What the data looks like, what are some questions you can answer with the data. You should try to make a simple analysis project instead of doing exactly the bare minimum of tasks 1-4.&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=63140</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=63140"/>
		<updated>2021-12-18T11:33:09Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Workshop notes */  Добавлена таблица с html/pdf вариантами&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Sadullaev M., tg: [https://tlgg.ru/samiysamiytochniy @samiysamiytochniy]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The control work will take place on Monday, 08.11 at 12.50 in an online format using asynchronous proctoring&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The contest will start at 13.00. At 12.50 in the zoom on the lecture link there will be an instruction. Also, this zoom will be used to be able to ask a question or make an announcement during the test.&lt;br /&gt;
&lt;br /&gt;
You will have 5 problems for 80 minutes: A, В, С, D - 10 points each, E - 20 points. The points earned on the test are part of Ongoing Assesment.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their seminarist or TA. They will write a supervised test in zoom and should be prepared to further defend their works. Zoom link for such  students:https://zoom.us/j/92446507737 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;All instructions can be read here [[Introduction_to_Programming_DSBA_2021/2022/Control_work_rules | Rules]]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link to the contest:&#039;&#039;&#039; https://official.contest.yandex.com/contest/31178/problems/  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Video download link&#039;&#039;&#039; - form [https://docs.google.com/forms/d/e/1FAIpQLSeG9R8BGosVAO84z2C_lQX-GAcDxsXJ3Cfhys2t2kUo84r8cw/viewform?usp=sf_link]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Who have missed CW ===&lt;br /&gt;
&lt;br /&gt;
Students who have missed the control work for a good reason will be able to write it &#039;&#039;&#039;on Monday, December 6 at 12.50.&#039;&#039;&#039; The rules are the same as for the main attempt (proctoring with the help of OBS system, etc.) The link will be sent before the control work&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link&#039;&#039;&#039; — [https://zoom.us/j/95617319275 here]&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cpQgDzfo0qx3KLi5FqyBql34NEiWnaH5/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Wn8doFKX6QEgthcKNxozIp1vQTzxsbcg/view?usp=sharing Lecture 3. Functional &amp;amp; OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/10oO1lk5BqVHedCY5QDnH0m2eF5JHu8cB/view?usp=sharing Lecture 4. Basic data structures. Graphs.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19nr1z5Mx-cs_06KoNlik6MR2nHlLp9rj/view?usp=sharing Lecture 5. NumPy.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1iLPnPtRKwYoi1V328_1BlBRtiin4bbLv/view?usp=sharing Lecture 6. Pandas. Matplotlib. Seaborn.] &amp;lt;br&amp;gt;&lt;br /&gt;
Lecture 7.Python for data analysis. Examples: Titanic 1 [https://drive.google.com/file/d/1uTpw8kbj8oeexhEqiME1jU-1wNlVGIVK/view?usp=sharing], Titanic 2 [https://drive.google.com/file/d/1U4M_P5h1eTvRZwXL9RmaS4ZvxMgXLzcz/view?usp=sharing]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1xSStI-ObdWE76IJfKikDz7T5e1IvGA6s/view?usp=sharing Tweets] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Topic !! ipynb (Jupyter) !! html !! pdf&lt;br /&gt;
|-&lt;br /&gt;
| 1. Introduction || [[https://drive.google.com/file/d/163k2AVJAOXi5vzuqhLTUbUtXBORDWjJ0| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%201%20-%20introduction HTML]] || [[https://drive.google.com/file/d/1XiWVH77w96t4M-bDcCMQ5yDoHvaDUbJc/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 2. Numeral systems || [[https://drive.google.com/file/d/1SZqOa3szmbJtrGOvqOhOzqIWyN8lvjnO| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%202%20-%20numbering%20systems HTML]] || [[https://drive.google.com/file/d/123wWBNg80z067VBsrxRaNVnVTaxX2eZt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 3. If, while || [[https://drive.google.com/file/d/12dkRJ7DyOxn4u5rgfsD7ulA4VsZGk4_Y| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%203%20-%20if,%20for HTML]] || [[https://drive.google.com/file/d/1yJD7vFi5xLr2QUpQaN-XW2aTtBZwVKCt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 4. Floats and strings || [[https://drive.google.com/file/d/1Q1UAICsnU4nOtUqCC1GmK82Y18p6jdpo| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%204%20-%20real%20numbers%20and%20strings HTML]] || [[https://drive.google.com/file/d/1FHVmsqCxTTU03YZjrooyhXPu0_aLeYCo/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 5. Strings || [[https://drive.google.com/file/d/17oz8WLoVY-XaSiyZe48i8q55zDNOOoGu| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%205%20-%20strings HTML]] || [[https://drive.google.com/file/d/1LWgVN1_HRF9imYoBTT-oApsXWzCtqdlU/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 6. Tasks on strings || [[https://drive.google.com/file/d/1SQE9WIlXFXLAt9HwstpYbLiZSo17zOGf| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%206%20tasks%20on%20strings HTML]] || [[https://drive.google.com/file/d/1S5Dj9z4RQfrZx26GpRfJNf1VTRCBxWrZ/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| Extra: code style || [[https://drive.google.com/file/d/1KDJ0y0f4m2GjVUnURXBYCVplgXqYHH3c| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%206.%20code%20style.%20strings HTML]] || [[https://drive.google.com/file/d/1ScflFw797otQHv7dLkemNP1kxrhgBjxN/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 7. Lists and tuples || [[https://drive.google.com/file/d/1Hrt-fJlQllybqis75yz7Z8J98SCbyROD| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%207_lists_tuples HTML]] || [[https://drive.google.com/file/d/1vx0G7hd_zCw-cj-AwySJwFTLQ0EwkRSb/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 8. Tasks on lists and tuples || [[https://drive.google.com/file/d/1zGlaGLWZQ8GxjVLOI2arFbM69poj8DaY| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%208%20tasks%20on%20lists%20and%20tuples HTML]] || [[https://drive.google.com/file/d/1AnuIayxEnm4XrtA1h_f6wtyCC8WIgQw5/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 9. Functions || [[https://drive.google.com/file/d/1az-sgSitygmDGMChX2EuhuQRF7sZ8P1T| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%209_functions_and_recursion HTML]] || [[https://drive.google.com/file/d/1CojdOj7mJUOxGk31dGyQtIsbqWIfuD5A/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 10. Tasks on functions || [[https://drive.google.com/file/d/1hCh7NFgIFaQor4HnglfF-Dcgz285JEFy| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2010%20some%20more%20tasks%20on%20functions HTML]] || [[https://drive.google.com/file/d/1lHYfnUBg_3bCyqytJbnph0VO-N14ZHje/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 11. Sets and dictionaries || [[https://drive.google.com/file/d/15g-eKzRayWOIt3ZgPjhfcB0Moefy_Uhk| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2011%20sets_dictionaries HTML]] || [[https://drive.google.com/file/d/1VoLiisI92gKjIzd2e_sy3xvUnmEQQ_tr/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 12. Tasks on sets and dictionaries || [[https://drive.google.com/file/d/14Y4PqEVEDqhcWibSCFmE1XuGqo3VUxh5| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2012.%20tasks%20on%20sets%20and%20dictionaries HTML]] || [[https://drive.google.com/file/d/1EZ0NnyFlabcls1l6uHwgepJ7Op3gIre7/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 13-14. Sorting and searching || [[https://drive.google.com/file/d/14rZvEish6O0uY5NLfm1Z8wlJpaYXvZfS| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2013.%20sorting%20and%20searching HTML]] || [[https://drive.google.com/file/d/1PtqR2-TNiJJ9Vt9zVDNzuzpKZvkGzoqa/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 15. Iterators and generators || [[https://drive.google.com/file/d/1EnkVxx2QJ6UBK6uEgV35rTO7TK_JSh6G| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2015%20iterators%20and%20generators HTML]] || [[https://drive.google.com/file/d/1F4uy9x1Ux1HR6q7FXcighmyR2XW7BuXU/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 16. Tasks on functional programming || [[https://drive.google.com/file/d/1xFiGPwNkJztADLbskVqUpR_iboX8kvn0| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2016%20functional%20tasks HTML]] || [[https://drive.google.com/file/d/1Xode0cKPxe4-Jq6Ywy1DyMLoABIzrAyx/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 17. Abstract data structures || [[https://drive.google.com/file/d/1fRzr5BOQzzLrB3X2p5p6AeeljT1xHcE3| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2017%20abstract%20data%20structures HTML]] || [[https://drive.google.com/file/d/1gvZygA1-29tWFYXxI60E6Ht5UW8j7ZEQ/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| Extra: graphs, search algorithms || [[https://drive.google.com/file/d/1TJbAw_21DfrRpHSeQmOLWA4pWpFYUm0F| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2017.5%20graphs.%20trees.%20practice HTML]] || [[https://drive.google.com/file/d/1-3R9BViqZOWfzTsQ0LdNpa-IHhl-EHM9/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 18. Files and exceptions || [[https://drive.google.com/file/d/1ewXawJhhl6pc8E1ZKrFc2vkZqGQG8yqR| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2018%20files,%20exceptions,%20errors HTML]] || [[https://drive.google.com/file/d/11SeZbzTku5pdiqNnpHFWAEqgk_Eg-Abn/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 19. Test solutions. Practice || [[https://drive.google.com/file/d/1RHo1UV6RWsVow77NjDA5mCUHbRkWiBNk| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2019.%20test%20solutions.%20practice.%20random HTML]] || [[https://drive.google.com/file/d/1KCSUAVRZ-Gjx2gZ0NxwP3CJlHxkO5d_K/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 20. File system || [[https://drive.google.com/file/d/11Uj52_pOlLu_b1TFMgPXf4BpiMYVjuPo| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2020.%20file%20system.%20practice HTML]] || [[https://drive.google.com/file/d/1V9LC4LQSIv14kCsQb3EtKYl-3Q7SsI5v/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 21. Numpy. Pandas || [[https://drive.google.com/file/d/1RYc16Si3KOGjornzRhGG0cR_ldk0upOD| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2021%20numpy%20pandas HTML]] || [[https://drive.google.com/file/d/1Joy4Vl3Orgbo-hfma9usqWUSfvoYtonr/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 22. Pandas || [[https://drive.google.com/file/d/1WqyvV9_h5eD_dDMine4bRYyjEUAzNWQw| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2022%20pandas HTML]] || [[https://drive.google.com/file/d/1ZTRjILBQevf8oKlXUhiheIvKwcGZXH-x/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 23. Data analysis. Visualization || [[https://drive.google.com/file/d/1VXqRxxfI9b1Hp_zi_VccTbO7fLlesH1t| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2023.%20data%20analysis%20examples.%20visualization HTML]] || [[https://drive.google.com/file/d/1mdJOgYckOpJqu82krE8rf9QGZbky-EK-/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 24. Visualization || [[https://drive.google.com/file/d/1rafsGZoSxILN1NbtwZAUvMUoaEGsQ-Cp| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2024.%20visualization. HTML]] || [[https://drive.google.com/file/d/1P9ITSj1ToL_w0gKX4BKF-ZdsrMoHmBTe/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 25-26. Web requests. Scraping. || [[https://drive.google.com/file/d/1PlIMK9UkOCKlyRP-wiFfBnMCm9hIVc3J| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop%2025-26%20web%20scraping,%20requests HTML]] || [[https://drive.google.com/file/d/1zG03U9HnlZEhoEaIrtZzkpfjqxl2elss/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 27. Flask || [[https://drive.google.com/file/d/19Gg8rmlnlCQmkH7jkA7Ohcc9GGsjoSnQ| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop_27_flask_part_1 HTML]] || [[https://drive.google.com/file/d/15whemE-OqO1xX3Zgla_mM4B46ab48Nmt/view?usp=sharing PDF]]&lt;br /&gt;
|-&lt;br /&gt;
| 28. Deploying Flask || [[https://drive.google.com/file/d/1gwU27N-Cb98zKIoAIMmiW2gUkZFMZt1G| Jupyter]] || [[https://vigorous-northcutt-59e55f.netlify.app/workshop_27_flask_part_2 HTML]] || [[https://drive.google.com/file/d/1T5cElJqCQhFUvJ9NoBaWm3UZ81h-14Mx/view?usp=sharing PDF]]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 16 november 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31586/enter/ Contest 7 (pilot)] || 30 november 2021, 22:00:00  &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 12th, 23:59&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Submission format&#039;&#039;&#039;: Jupyter Notebook + Data file. Submit the notebook file and the dataset example via this Google form: https://forms.gle/cvG8tLn2ugjMMAPj8&lt;br /&gt;
&lt;br /&gt;
If your data is larger than 10 MB, please use a subset of data under 10 MB and submit the subset into the form.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dataset selection&#039;&#039;&#039;: After you choose a dataset for the project, submit it to this form: https://forms.gle/hQx7fpaneXKgRAJt9&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it.&lt;br /&gt;
https://docs.google.com/spreadsheets/d/1WQSgOzQdamwSWXexN7EHtVv2sstl6A9yVguQUMCAcZk&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Project description&#039;&#039;&#039;: Find a dataset with text data and analyze it the following way.&lt;br /&gt;
&lt;br /&gt;
* Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
* Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
* Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of column A for different values of column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
* Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
* For pilot students one of the requirements is to set up a web server using the Flask framework. Web Server interface should be one of the following: end users must be able to get required data using get-requests, html page or telegram-bot.&lt;br /&gt;
&lt;br /&gt;
Additional notes:&lt;br /&gt;
&lt;br /&gt;
* Plots for tasks 2 and 3 are counted separately. So, your project has to have at least 5 plots in total.&lt;br /&gt;
* Make sure your plots have proper legends, titles, axis titles, so that it’s easy to understand what the graph represents.&lt;br /&gt;
* Try to format your project as a sequence of problems you’re solving. What the data looks like, what are some questions you can answer with the data. You should try to make a simple analysis project instead of doing exactly the bare minimum of tasks 1-4.&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022/Control_work_rules&amp;diff=62711</id>
		<title>Introduction to Programming DSBA 2021/2022/Control work rules</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022/Control_work_rules&amp;diff=62711"/>
		<updated>2021-12-09T18:08:51Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: Скопированы правила проведения контрольной с прошлой страницы с неправильном адресом&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Test is carried out using asynchronous proctoring. Each student needs to record the process of programming using OBS Studio, upload the result to the cloud storage and provide a link to the recording.&lt;br /&gt;
To participate, you will need a computer with a webcam and microphone (in particular, all modern laptops are equipped with them) and Internet access.&lt;br /&gt;
&lt;br /&gt;
You need to install OBS Studio via the link &#039;&#039;&#039;https://obsproject.com/ru&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
You need to configure three input stream sources: microphone, webcam and screen capture. Learn more about the setup in the video:&lt;br /&gt;
&#039;&#039;&#039;https://www.youtube.com/watch?v=KVKrvPvPLYg&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Start recording 5 minutes before the start of work. Late students (who started recording not before the start of the Test) will be disqualified. Your videos will be viewed only by teachers and assistants. After the end of the Test, you will have 30 minutes to send the recorded video.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Do not delete the video until your teacher checks the recording!&amp;lt;/span&amp;gt;&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
During the test, &#039;&#039;&#039;it is allowed to use only&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
- the website of the testing system (including your solutions to the homework) &lt;br /&gt;
&lt;br /&gt;
- development environments (not online, but installed on a computer)&lt;br /&gt;
&lt;br /&gt;
- lecture &amp;amp; workshop notes. It is also allowed to use own paper lecture/workshop notes &lt;br /&gt;
&lt;br /&gt;
- documentation on https://www.python.org/.  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt; Disable all messengers in advance and close unnecessary tabs. &amp;lt;/span&amp;gt;&#039;&#039;&#039;&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt; It is forbidden to use collaboration tools, including Collab &amp;lt;/span&amp;gt;&#039;&#039;&#039;&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt; During the test, communication with other people is not allowed, warn those who are with you at the recording site in advance. It is also forbidden to use headphones during the test!&amp;lt;/span&amp;gt;&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;&amp;lt;span style=&amp;quot;color:#9ACD32&amp;quot;&amp;gt;If you have completed the solution of tasks before the end of contest, you need to send a message about it in the testing system. In case of attempts to solve problems after this message, you will be disqualified.&amp;lt;/span&amp;gt;&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;&#039;&amp;lt;span style=&amp;quot;color:#8B0000&amp;quot;&amp;gt;Communication with other participants is prohibited until the end of the Test- both participants will be disqualified.&amp;lt;/span&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Please check in advance that you have learned how to record video in the required format - this process can sometimes cause problems. All solutions to problems related to recording in OBS Studio are described on the Internet. So that the recorded files do not take up a lot of space, you can lower the bitrate: 500 Kbps is enough for video and 64 for an audio. Watch the video at the link above - it shows how to set it up.&lt;br /&gt;
&lt;br /&gt;
Conducting the test: Actions that you must perform before the contest:&lt;br /&gt;
&lt;br /&gt;
1) Physically disconnect and remove any electronic devices and additional monitors from the workplace&lt;br /&gt;
&lt;br /&gt;
2) Prepare for the fact that you will not be able to leave the workplace for 1 hour and 20 minutes&lt;br /&gt;
&lt;br /&gt;
3) Enable recording from three sources: screen, webcam and microphone in OBS Studio. Make sure that recording is enabled from the entire screen, and not from a separate window. Make sure that the microphone and camera are turned on.&lt;br /&gt;
&lt;br /&gt;
4) Record your workplace from all sides and its surroundings&lt;br /&gt;
&lt;br /&gt;
5) Show blank sheets that you plan to use during drafts&lt;br /&gt;
&lt;br /&gt;
6) Show you passport (page with your photo)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Procedure during the contest:&#039;&#039;&#039; During the contest, you must ask questions only through chat in zoom. &lt;br /&gt;
If you are working with a draft or paper notes, point the webcam so that your hands are visible. Don&#039;t forget to point the webcam at your face when you return to work at the computer.&lt;br /&gt;
If you want to finish the Test ahead of time, write a message about it using the questions interface in the testing system and follow all the steps listed below (After the end of the contest).&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;After the end of the contest:&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
1) At the end of the contest, within 30 minutes, you must place the videos recorded during the competition on Yandex disk, google disk, dropbox or youtube, fill out the form, indicating the link to the recording file (just a file, not a folder) in it.&lt;br /&gt;
&lt;br /&gt;
2) In case of technical problems with video uploading or problems with meeting the time limit (30 minutes), fill out the form, indicate in the &amp;quot;link to video&amp;quot; field the size of your video file with &#039;&#039;&#039;a byte precision&#039;&#039;&#039; and write to your seminarist or TA. After solving the problem, fill out the form a second time and provide a link to your video.&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=62710</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=62710"/>
		<updated>2021-12-09T18:07:26Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /*  Сontrol work  */ Изменена ссылка на правила&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Sadullaev M., tg: [https://tlgg.ru/samiysamiytochniy @samiysamiytochniy]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The control work will take place on Monday, 08.11 at 12.50 in an online format using asynchronous proctoring&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The contest will start at 13.00. At 12.50 in the zoom on the lecture link there will be an instruction. Also, this zoom will be used to be able to ask a question or make an announcement during the test.&lt;br /&gt;
&lt;br /&gt;
You will have 5 problems for 80 minutes: A, В, С, D - 10 points each, E - 20 points. The points earned on the test are part of Ongoing Assesment.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their seminarist or TA. They will write a supervised test in zoom and should be prepared to further defend their works. Zoom link for such  students:https://zoom.us/j/92446507737 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;All instructions can be read here [[Introduction_to_Programming_DSBA_2021/2022/Control_work_rules | Rules]]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link to the contest:&#039;&#039;&#039; https://official.contest.yandex.com/contest/31178/problems/  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Video download link&#039;&#039;&#039; - form [https://docs.google.com/forms/d/e/1FAIpQLSeG9R8BGosVAO84z2C_lQX-GAcDxsXJ3Cfhys2t2kUo84r8cw/viewform?usp=sf_link]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Who have missed CW ===&lt;br /&gt;
&lt;br /&gt;
Students who have missed the control work for a good reason will be able to write it &#039;&#039;&#039;on Monday, December 6 at 12.50.&#039;&#039;&#039; The rules are the same as for the main attempt (proctoring with the help of OBS system, etc.) The link will be sent before the control work&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link&#039;&#039;&#039; — [https://zoom.us/j/95617319275 here]&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cpQgDzfo0qx3KLi5FqyBql34NEiWnaH5/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Wn8doFKX6QEgthcKNxozIp1vQTzxsbcg/view?usp=sharing Lecture 3. Functional &amp;amp; OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/10oO1lk5BqVHedCY5QDnH0m2eF5JHu8cB/view?usp=sharing Lecture 4. Basic data structures. Graphs.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19nr1z5Mx-cs_06KoNlik6MR2nHlLp9rj/view?usp=sharing Lecture 5. NumPy.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1iLPnPtRKwYoi1V328_1BlBRtiin4bbLv/view?usp=sharing Lecture 6. Pandas. Matplotlib. Seaborn.] &amp;lt;br&amp;gt;&lt;br /&gt;
Lecture 7.Python for data analysis. Examples: Titanic 1 [https://drive.google.com/file/d/1uTpw8kbj8oeexhEqiME1jU-1wNlVGIVK/view?usp=sharing], Titanic 2 [https://drive.google.com/file/d/1U4M_P5h1eTvRZwXL9RmaS4ZvxMgXLzcz/view?usp=sharing]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1xSStI-ObdWE76IJfKikDz7T5e1IvGA6s/view?usp=sharing Tweets] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 16 november 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31586/enter/ Contest 7 (pilot)] || 30 november 2021, 22:00:00  &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 12th, 23:59&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Submission format&#039;&#039;&#039;: Jupyter Notebook + Data file. Submit the notebook file and the dataset example via this Google form: https://forms.gle/cvG8tLn2ugjMMAPj8&lt;br /&gt;
&lt;br /&gt;
If your data is larger than 10 MB, please use a subset of data under 10 MB and submit the subset into the form.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dataset selection&#039;&#039;&#039;: After you choose a dataset for the project, submit it to this form: https://forms.gle/hQx7fpaneXKgRAJt9&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it.&lt;br /&gt;
https://docs.google.com/spreadsheets/d/1WQSgOzQdamwSWXexN7EHtVv2sstl6A9yVguQUMCAcZk&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Project description&#039;&#039;&#039;: Find a dataset with text data and analyze it the following way.&lt;br /&gt;
&lt;br /&gt;
* Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
* Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
* Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of column A for different values of column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
* Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
* For pilot students one of the requirements is to set up a web server using the Flask framework. Web Server interface should be one of the following: end users must be able to get required data using get-requests, html page or telegram-bot.&lt;br /&gt;
&lt;br /&gt;
Additional notes:&lt;br /&gt;
&lt;br /&gt;
* Plots for tasks 2 and 3 are counted separately. So, your project has to have at least 5 plots in total.&lt;br /&gt;
* Make sure your plots have proper legends, titles, axis titles, so that it’s easy to understand what the graph represents.&lt;br /&gt;
* Try to format your project as a sequence of problems you’re solving. What the data looks like, what are some questions you can answer with the data. You should try to make a simple analysis project instead of doing exactly the bare minimum of tasks 1-4.&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=62165</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=62165"/>
		<updated>2021-11-29T18:39:33Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Project */ Изменён формат посылки проекта - файлы вместо ссылок&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Sadullaev M., tg: [https://tlgg.ru/samiysamiytochniy @samiysamiytochniy]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The control work will take place on Monday, 08.11 at 12.50 in an online format using asynchronous proctoring&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The contest will start at 13.00. At 12.50 in the zoom on the lecture link there will be an instruction. Also, this zoom will be used to be able to ask a question or make an announcement during the test.&lt;br /&gt;
&lt;br /&gt;
You will have 5 problems for 80 minutes: A, В, С, D - 10 points each, E - 20 points. The points earned on the test are part of Ongoing Assesment.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their seminarist or TA. They will write a supervised test in zoom and should be prepared to further defend their works. Zoom link for such  students:https://zoom.us/j/92446507737 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;All instructions can be read here [[here | Rules]]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link to the contest:&#039;&#039;&#039; https://official.contest.yandex.com/contest/31178/problems/  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Video download link&#039;&#039;&#039; - form [https://docs.google.com/forms/d/e/1FAIpQLSeG9R8BGosVAO84z2C_lQX-GAcDxsXJ3Cfhys2t2kUo84r8cw/viewform?usp=sf_link]&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cpQgDzfo0qx3KLi5FqyBql34NEiWnaH5/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Wn8doFKX6QEgthcKNxozIp1vQTzxsbcg/view?usp=sharing Lecture 3. Functional &amp;amp; OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/10oO1lk5BqVHedCY5QDnH0m2eF5JHu8cB/view?usp=sharing Lecture 4. Basic data structures. Graphs.] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 16 november 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31586/enter/ Contest 7 (pilot)] || 30 november 2021, 22:00:00  &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 12th, 23:59&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Submission format&#039;&#039;&#039;: Jupyter Notebook + Data file. Submit the notebook file and the dataset example via this Google form: https://forms.gle/cvG8tLn2ugjMMAPj8&lt;br /&gt;
&lt;br /&gt;
If your data is larger than 10 MB, please use a subset of data under 10 MB and submit the subset into the form.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dataset selection&#039;&#039;&#039;: After you choose a dataset for the project, submit it to this form: https://forms.gle/hQx7fpaneXKgRAJt9&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it.&lt;br /&gt;
https://docs.google.com/spreadsheets/d/1WQSgOzQdamwSWXexN7EHtVv2sstl6A9yVguQUMCAcZk&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Project description&#039;&#039;&#039;: Find a dataset with text data and analyze it the following way.&lt;br /&gt;
&lt;br /&gt;
* Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
* Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
* Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of column A for different values of column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
* Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
* For pilot students one of the requirements is to set up a web server using the Flask framework. Web Server interface should be one of the following: end users must be able to get required data using get-requests, html page or telegram-bot.&lt;br /&gt;
&lt;br /&gt;
Additional notes:&lt;br /&gt;
&lt;br /&gt;
* Plots for tasks 2 and 3 are counted separately. So, your project has to have at least 5 plots in total.&lt;br /&gt;
* Make sure your plots have proper legends, titles, axis titles, so that it’s easy to understand what the graph represents.&lt;br /&gt;
* Try to format your project as a sequence of problems you’re solving. What the data looks like, what are some questions you can answer with the data. You should try to make a simple analysis project instead of doing exactly the bare minimum of tasks 1-4.&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=62044</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=62044"/>
		<updated>2021-11-27T07:56:33Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Project */  Исправлено форматирование&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Sadullaev M., tg: [https://tlgg.ru/samiysamiytochniy @samiysamiytochniy]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The control work will take place on Monday, 08.11 at 12.50 in an online format using asynchronous proctoring&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The contest will start at 13.00. At 12.50 in the zoom on the lecture link there will be an instruction. Also, this zoom will be used to be able to ask a question or make an announcement during the test.&lt;br /&gt;
&lt;br /&gt;
You will have 5 problems for 80 minutes: A, В, С, D - 10 points each, E - 20 points. The points earned on the test are part of Ongoing Assesment.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their seminarist or TA. They will write a supervised test in zoom and should be prepared to further defend their works. Zoom link for such  students:https://zoom.us/j/92446507737 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;All instructions can be read here [[here | Rules]]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link to the contest:&#039;&#039;&#039; https://official.contest.yandex.com/contest/31178/problems/  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Video download link&#039;&#039;&#039; - form [https://docs.google.com/forms/d/e/1FAIpQLSeG9R8BGosVAO84z2C_lQX-GAcDxsXJ3Cfhys2t2kUo84r8cw/viewform?usp=sf_link]&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cpQgDzfo0qx3KLi5FqyBql34NEiWnaH5/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Wn8doFKX6QEgthcKNxozIp1vQTzxsbcg/view?usp=sharing Lecture 3. Functional &amp;amp; OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/10oO1lk5BqVHedCY5QDnH0m2eF5JHu8cB/view?usp=sharing Lecture 4. Basic data structures. Graphs.] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 16 november 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31586/enter/ Contest 7 (pilot)] || 30 november 2021, 22:00:00  &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 12th, 23:59&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Submission format&#039;&#039;&#039;: Jupyter Notebook, submit a link to the notebook file and the dataset file via this Google form: https://forms.gle/HmPppnnCpmCx9nZN8&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dataset selection&#039;&#039;&#039;: After you choose a dataset for the project, submit it to this form: https://forms.gle/hQx7fpaneXKgRAJt9&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it.&lt;br /&gt;
https://docs.google.com/spreadsheets/d/1WQSgOzQdamwSWXexN7EHtVv2sstl6A9yVguQUMCAcZk&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Project description&#039;&#039;&#039;: Find a dataset with text data and analyze it the following way.&lt;br /&gt;
&lt;br /&gt;
* Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
* Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
* Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of column A for different values of column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
* Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
* For pilot students one of the requirements is to set up a web server using the Flask framework. Web Server interface should be one of the following: end users must be able to get required data using get-requests, html page or telegram-bot.&lt;br /&gt;
&lt;br /&gt;
Additional notes:&lt;br /&gt;
&lt;br /&gt;
* Plots for tasks 2 and 3 are counted separately. So, your project has to have at least 5 plots in total.&lt;br /&gt;
* Make sure your plots have proper legends, titles, axis titles, so that it’s easy to understand what the graph represents.&lt;br /&gt;
* Try to format your project as a sequence of problems you’re solving. What the data looks like, what are some questions you can answer with the data. You should try to make a simple analysis project instead of doing exactly the bare minimum of tasks 1-4.&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=62043</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=62043"/>
		<updated>2021-11-27T07:56:02Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Project */  Исправлено форматирование&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Sadullaev M., tg: [https://tlgg.ru/samiysamiytochniy @samiysamiytochniy]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The control work will take place on Monday, 08.11 at 12.50 in an online format using asynchronous proctoring&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The contest will start at 13.00. At 12.50 in the zoom on the lecture link there will be an instruction. Also, this zoom will be used to be able to ask a question or make an announcement during the test.&lt;br /&gt;
&lt;br /&gt;
You will have 5 problems for 80 minutes: A, В, С, D - 10 points each, E - 20 points. The points earned on the test are part of Ongoing Assesment.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their seminarist or TA. They will write a supervised test in zoom and should be prepared to further defend their works. Zoom link for such  students:https://zoom.us/j/92446507737 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;All instructions can be read here [[here | Rules]]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link to the contest:&#039;&#039;&#039; https://official.contest.yandex.com/contest/31178/problems/  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Video download link&#039;&#039;&#039; - form [https://docs.google.com/forms/d/e/1FAIpQLSeG9R8BGosVAO84z2C_lQX-GAcDxsXJ3Cfhys2t2kUo84r8cw/viewform?usp=sf_link]&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cpQgDzfo0qx3KLi5FqyBql34NEiWnaH5/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Wn8doFKX6QEgthcKNxozIp1vQTzxsbcg/view?usp=sharing Lecture 3. Functional &amp;amp; OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/10oO1lk5BqVHedCY5QDnH0m2eF5JHu8cB/view?usp=sharing Lecture 4. Basic data structures. Graphs.] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 16 november 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31586/enter/ Contest 7 (pilot)] || 30 november 2021, 22:00:00  &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 12th, 23:59&lt;br /&gt;
&#039;&#039;&#039;Submission format&#039;&#039;&#039;: Jupyter Notebook, submit a link to the notebook file and the dataset file via this Google form: https://forms.gle/HmPppnnCpmCx9nZN8&lt;br /&gt;
&#039;&#039;&#039;Dataset selection&#039;&#039;&#039;: After you choose a dataset for the project, submit it to this form: https://forms.gle/hQx7fpaneXKgRAJt9&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it.&lt;br /&gt;
https://docs.google.com/spreadsheets/d/1WQSgOzQdamwSWXexN7EHtVv2sstl6A9yVguQUMCAcZk&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Project description&#039;&#039;&#039;: Find a dataset with text data and analyze it the following way.&lt;br /&gt;
&lt;br /&gt;
* Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
* Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
* Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of column A for different values of column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
* Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
* For pilot students one of the requirements is to set up a web server using the Flask framework. Web Server interface should be one of the following: end users must be able to get required data using get-requests, html page or telegram-bot.&lt;br /&gt;
&lt;br /&gt;
Additional notes:&lt;br /&gt;
&lt;br /&gt;
* Plots for tasks 2 and 3 are counted separately. So, your project has to have at least 5 plots in total.&lt;br /&gt;
* Make sure your plots have proper legends, titles, axis titles, so that it’s easy to understand what the graph represents.&lt;br /&gt;
* Try to format your project as a sequence of problems you’re solving. What the data looks like, what are some questions you can answer with the data. You should try to make a simple analysis project instead of doing exactly the bare minimum of tasks 1-4.&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=62042</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=62042"/>
		<updated>2021-11-27T07:55:36Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Project */  Добавлено условие проекта&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Sadullaev M., tg: [https://tlgg.ru/samiysamiytochniy @samiysamiytochniy]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The control work will take place on Monday, 08.11 at 12.50 in an online format using asynchronous proctoring&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The contest will start at 13.00. At 12.50 in the zoom on the lecture link there will be an instruction. Also, this zoom will be used to be able to ask a question or make an announcement during the test.&lt;br /&gt;
&lt;br /&gt;
You will have 5 problems for 80 minutes: A, В, С, D - 10 points each, E - 20 points. The points earned on the test are part of Ongoing Assesment.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their seminarist or TA. They will write a supervised test in zoom and should be prepared to further defend their works. Zoom link for such  students:https://zoom.us/j/92446507737 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;All instructions can be read here [[here | Rules]]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link to the contest:&#039;&#039;&#039; https://official.contest.yandex.com/contest/31178/problems/  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Video download link&#039;&#039;&#039; - form [https://docs.google.com/forms/d/e/1FAIpQLSeG9R8BGosVAO84z2C_lQX-GAcDxsXJ3Cfhys2t2kUo84r8cw/viewform?usp=sf_link]&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cpQgDzfo0qx3KLi5FqyBql34NEiWnaH5/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Wn8doFKX6QEgthcKNxozIp1vQTzxsbcg/view?usp=sharing Lecture 3. Functional &amp;amp; OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/10oO1lk5BqVHedCY5QDnH0m2eF5JHu8cB/view?usp=sharing Lecture 4. Basic data structures. Graphs.] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 16 november 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31586/enter/ Contest 7 (pilot)] || 30 november 2021, 22:00:00  &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 12th, 23:59&lt;br /&gt;
&#039;&#039;&#039;Submission format&#039;&#039;&#039;: Jupyter Notebook, submit a link to the notebook file and the dataset file via this Google form: https://forms.gle/HmPppnnCpmCx9nZN8&lt;br /&gt;
&#039;&#039;&#039;Dataset selection&#039;&#039;&#039;: After you choose a dataset for the project, submit it to this form: https://forms.gle/hQx7fpaneXKgRAJt9&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it.&lt;br /&gt;
https://docs.google.com/spreadsheets/d/1WQSgOzQdamwSWXexN7EHtVv2sstl6A9yVguQUMCAcZk&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Project description&#039;&#039;&#039;: Find a dataset with text data and analyze it the following way.&lt;br /&gt;
&lt;br /&gt;
 * Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
 * Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
 * Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of column A for different values of column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
 * Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
 * For pilot students one of the requirements is to set up a web server using the Flask framework. Web Server interface should be one of the following: end users must be able to get required data using get-requests, html page or telegram-bot.&lt;br /&gt;
&lt;br /&gt;
Additional notes:&lt;br /&gt;
&lt;br /&gt;
 * Plots for tasks 2 and 3 are counted separately. So, your project has to have at least 5 plots in total.&lt;br /&gt;
 * Make sure your plots have proper legends, titles, axis titles, so that it’s easy to understand what the graph represents.&lt;br /&gt;
 * Try to format your project as a sequence of problems you’re solving. What the data looks like, what are some questions you can answer with the data. You should try to make a simple analysis project instead of doing exactly the bare minimum of tasks 1-4.&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=61690</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=61690"/>
		<updated>2021-11-20T15:54:23Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Contests */  добавлен контест 7&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Sadullaev M., tg: [https://tlgg.ru/samiysamiytochniy @samiysamiytochniy]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The control work will take place on Monday, 08.11 at 12.50 in an online format using asynchronous proctoring&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The contest will start at 13.00. At 12.50 in the zoom on the lecture link there will be an instruction. Also, this zoom will be used to be able to ask a question or make an announcement during the test.&lt;br /&gt;
&lt;br /&gt;
You will have 5 problems for 80 minutes: A, В, С, D - 10 points each, E - 20 points. The points earned on the test are part of Ongoing Assesment.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their seminarist or TA. They will write a supervised test in zoom and should be prepared to further defend their works. Zoom link for such  students:https://zoom.us/j/92446507737 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;All instructions can be read here [[here | Rules]]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link to the contest:&#039;&#039;&#039; https://official.contest.yandex.com/contest/31178/problems/  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Video download link&#039;&#039;&#039; - form [https://docs.google.com/forms/d/e/1FAIpQLSeG9R8BGosVAO84z2C_lQX-GAcDxsXJ3Cfhys2t2kUo84r8cw/viewform?usp=sf_link]&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cpQgDzfo0qx3KLi5FqyBql34NEiWnaH5/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Wn8doFKX6QEgthcKNxozIp1vQTzxsbcg/view?usp=sharing Lecture 3. Functional &amp;amp; OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/10oO1lk5BqVHedCY5QDnH0m2eF5JHu8cB/view?usp=sharing Lecture 4. Basic data structures. Graphs.] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 16 november 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/31586/enter/ Contest 7 (pilot)] || 30 november 2021, 22:00:00  &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=61689</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=61689"/>
		<updated>2021-11-20T15:47:06Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Contests */  учёт продления 6-го контеста&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Sadullaev M., tg: [https://tlgg.ru/samiysamiytochniy @samiysamiytochniy]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The control work will take place on Monday, 08.11 at 12.50 in an online format using asynchronous proctoring&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The contest will start at 13.00. At 12.50 in the zoom on the lecture link there will be an instruction. Also, this zoom will be used to be able to ask a question or make an announcement during the test.&lt;br /&gt;
&lt;br /&gt;
You will have 5 problems for 80 minutes: A, В, С, D - 10 points each, E - 20 points. The points earned on the test are part of Ongoing Assesment.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their seminarist or TA. They will write a supervised test in zoom and should be prepared to further defend their works. Zoom link for such  students:https://zoom.us/j/92446507737 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;All instructions can be read here [[here | Rules]]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Link to the contest:&#039;&#039;&#039; https://official.contest.yandex.com/contest/31178/problems/  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Video download link&#039;&#039;&#039; - form [https://docs.google.com/forms/d/e/1FAIpQLSeG9R8BGosVAO84z2C_lQX-GAcDxsXJ3Cfhys2t2kUo84r8cw/viewform?usp=sf_link]&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1cpQgDzfo0qx3KLi5FqyBql34NEiWnaH5/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Wn8doFKX6QEgthcKNxozIp1vQTzxsbcg/view?usp=sharing Lecture 3. Functional &amp;amp; OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/10oO1lk5BqVHedCY5QDnH0m2eF5JHu8cB/view?usp=sharing Lecture 4. Basic data structures. Graphs.] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 16 november 2021, 22:00:00  &lt;br /&gt;
&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=60565</id>
		<title>Introduction to Programming DSBA 2021/2022</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_Programming_DSBA_2021/2022&amp;diff=60565"/>
		<updated>2021-10-28T18:00:08Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: Исправление контактов Кирилла Рудакова&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Notifications ==&lt;br /&gt;
&lt;br /&gt;
=== During the second semester information about the course will be available at [https://edu.hse.ru/course/view.php?id=56898 this link] ===&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 !! 211 !! 212 !! 213 !! 214&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 211 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
211 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
|| 212 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
212 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 213 - 1: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &amp;lt;br&amp;gt;&lt;br /&gt;
213 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
&lt;br /&gt;
|| 214 - 1: Ahremenko A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru], tg: [https://tlgg.ru/@chuvilinaann @chuvilinaann ]&lt;br /&gt;
214 - 2: Maksimova D. &amp;lt;br&amp;gt; [mailto:daria.maximova.m@gmail.com  daria.maximova.m@gmail.com] tg: [https://tlgg.ru/narretei @narretei]&lt;br /&gt;
 &lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Chechulin N., tg: [https://tlgg.ru/nchechulin @nchechulin]&lt;br /&gt;
|| Abramov N., tg: [https://tlgg.ru/sad_0_me @sad_0_me]&lt;br /&gt;
|| Gadaev I., tg: [https://tlgg.ru/god_flask @god_flask]&lt;br /&gt;
|| Belyakov K., tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|-&lt;br /&gt;
&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039; &amp;lt;span style=&amp;quot;color:#DC143C&amp;quot;&amp;gt;Сontrol work&amp;lt;/span&amp;gt; &#039;&#039;&#039;==&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1jpJmpOubHceZOTkCs5oHgnzbsLNs7AfZ/view?usp=sharing Lecture 2. Sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1ZD1X6gWlYolY91VAerTmHxOrI4GVQf1I/view?usp=sharing Workshop 1.Introduction]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1GoRXsVjaZ7KwJsyhI67RVtRkVfgvEOsj/view?usp=sharing Workshop 2.Numeral Systems]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1plkLxny5gSRHeTWJ6kRC3X5MMpsOMkSG/view?usp=sharing Workshop 3.Conditions and loops]&lt;br /&gt;
&lt;br /&gt;
Workshop 4.Floating point numbers and strings&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1iQoRH243DDIG-OzXj3LYu21CzDy1AyER/view?usp=sharing Workshop 5-6.Strings]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/10VOH85BeZHdeKn8WafUJMuhLooyR09nQ/view?usp=sharing Workshop 7.List, tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1Ubo0k47PXv6hNb91_IuX1wnD_ov3Yt5l/view?usp=sharing Workshop 8.Tasks on lists and tuples]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1oolHhvS5-WA7sX35zoYm_ZBYwx4zDUkc/view?usp=sharing Workshop 9.Fuctions]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1f4TgaDjRXD7GRbdKGTBBZ5Qvn_7rsHOP?usp=sharing Workshop 10. Tasks on function]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1PeFJphA28nPb0kl0eRNtM1KzYGnOu2QR?usp=sharing Workshop 11.Sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 12.Tasks on sets and dictionaries]&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1T-g8DUJtmF6uH1lFEZhh8X6KmZp_p8wB?usp=sharing Workshop 13.Search and sort]&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] ||    &lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.ru/contest/29468/enter/ Contest 2] || 5 october 2021, 22:00:00&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29676/enter/ Contest 3] || 12 october 2021, 22:00:00 &lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/29885/ Contest 4] || 19 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30083/enter/ Contest 5] || 30 october 2021, 22:00:00&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/30853/enter/ Contest 6] || 9 november 2021, 22:00:00  &lt;br /&gt;
&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Results ===&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1FEhKS4nSej6uuvPHhRqAAvFnh2FCUMsvaWAR8HJmaSs/edit#gid=0 Results table]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
&lt;br /&gt;
== Archive ==&lt;br /&gt;
&lt;br /&gt;
[http://wiki.cs.hse.ru/Introduction_to_programming_DSBA_2020/2021 Last year&#039;s page] &lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_programming_DSBA_2020/2021&amp;diff=49037</id>
		<title>Introduction to programming DSBA 2020/2021</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_programming_DSBA_2020/2021&amp;diff=49037"/>
		<updated>2020-12-25T20:02:02Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Exam */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&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 !! 201 !! 202 !! 203 !! 204&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 201 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
201 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &lt;br /&gt;
|| 202 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
202 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 203 - 1: Chuvilina A.A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru] , tg: [https://tlgg.ru/chuvilinaann @chuvilinaann] &amp;lt;br&amp;gt;&lt;br /&gt;
203 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|| &lt;br /&gt;
Sysoev M. V. &amp;lt;br&amp;gt; [mailto:sysoevmark@gmail.com sysoevmark@gmail.com], tg: [https://tlgg.ru/BartolomeuD @BartolomeuD]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Diana K., tg: [https://tlgg.ru/shadowcure @shadowcure]&lt;br /&gt;
|| Rustam K., tg: [https://tlgg.ru/dergalaktischekaiser @dergalaktischekaiser]&lt;br /&gt;
|| Lily K., tg: [https://tlgg.ru/lily_kurchenko @lily_kurchenko]&lt;br /&gt;
|| Sergey G., tg: [https://tlgg.ru/SeregaEFD @SeregaEFD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Jingtao X., tg: [https://tlgg.ru/andy0814xu @andy0814xu]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1JJwc4CZMkgIbVFPxit5n5muA4_dEQMpV/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1zZhY-KiFpmdacKR8P0PqPmfuKZPHzMc8/view?usp=sharing Lecture 2. Numeral systems. Real numbers.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1K_h2xlPQ60PX-saYfgXH7bbTDQ1fqtOm/view?usp=sharing Lecture 3. Strings. The Zen of Python. PEP-8.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1BdCL1hjqH_E6EK8NebmnvH655SzqFyA4/view?usp=sharing Lecture 4. Lists&amp;amp;tuples] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/16QiYgf7jgy1Wuiilcs51fDOBDKGHMXZN/view?usp=sharing Lecture 5. Functions&amp;amp;recursion] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19Jos3bfDXAfpxucDsjmYAeEAAuobFxLv/view?usp=sharing Lecture 6. sets &amp;amp; dictionaries] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Q-0beUgk9fR83nkzqAlVfMxrKDfdGcZM/view?usp=sharing Lecture 8. files. exceptions &amp;amp; errors] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1gq5NqV2LmpQU2W1Wj5HQJkuxDC_Q_kxD/view?usp=sharing Lecture 9. functional]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1i8arJc58cSSYE0WIzsnLBKC-IHVgakxb/view?usp=sharing Lecture 10. OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1AwXHgF5e5sVSNisou0IGo2qLbbwGNXg2/view?usp=sharing Lecture 11. sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1LCqYrxz2SqCf1GiuYgg3-ikC0G1M2Jxe/view?usp=sharing Lecture 12. data structures] &amp;lt;br&amp;gt;&lt;br /&gt;
lecture 13. Python for data analysis&lt;br /&gt;
[https://drive.google.com/file/d/1Qg4cVjl30WMIo_tWb0CfS2wEHYu1Qi9W/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/13mfZo-A2up30mA_2tWorWi24n9D2eqzR/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/1wE97tvUP028ihUsRu_Z9jMEe6VntaUT_/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1546Nk2AQNURnAZJ30X51QC9NERGqxwg-/view?usp=sharing Lecture 14. web scraping]&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
Workshop 3_Number systems [https://drive.google.com/file/d/1C-rojoAQW_QV_-81-74p_d6DBmgqPymd/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 4_real_strings [https://drive.google.com/file/d/1fNCkIOoENkp1V_gleuECYHTWtbww0ulL/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 5_strings [https://colab.research.google.com/drive/1MYGUntyiofnSQfYfoUjzZOpIIxJvm0m9?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 6_strings [https://drive.google.com/file/d/1nzkxOUlWYS4kcXMNsqRFQGnMnuLA3Dlg/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 7_lists_tuples [https://drive.google.com/file/d/1Kb4owufwUJe7wE7LsURjWz4ozogUt2rr/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 8 Tasks on lists &amp;amp; tuples [https://drive.google.com/file/d/19YCydAOdpS6A0D2Vxnt0xrLdAaFW6h38/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 9 Functions &amp;amp; Recursion [https://drive.google.com/file/d/1WqT_9dG_eKy9cCTGa3JGraxHmY6ZFfeT/view?usp=sharing]&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 10 Some more tasks on Functions [https://drive.google.com/file/d/1YIsfHECedyz0GbXQ_8EBgHxv2P6THcZS/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 11 Sets_Dictionaries [https://drive.google.com/file/d/1j-JVnvVbc5XTVkGXUUGU6eDC-HyWVvgd/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 12 Tasks on sets and dictionaries [https://drive.google.com/file/d/1Lb5hJfWVnLSWCHZIwsS_Eyz_Lfi_MrIJ/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 13 Files_Exceptions_Errors [https://drive.google.com/file/d/1_H2gS4eb8qBY8YhOfReDyxdIwAW6ORhl/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 14 Code Style and Code Reading [https://colab.research.google.com/drive/1vAJOxzd_Cx5vOBdAWpc09JREwuBR6Fsy?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 15 Iterators and Generators [https://colab.research.google.com/drive/1IQqvUN8Z_JZx6h3mSuKPdGDs7PlpGoZ2?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 16 Functional Tasks [https://colab.research.google.com/drive/1KFzewIimC5vgRuUp40Rff_bJ7xRi7KNJ?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 17 OOP [https://drive.google.com/file/d/1YNC2BZGeVqqr1qtS3VbPgPM1Ll6l4kZQ/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 18 OOP_tasks [https://drive.google.com/file/d/19-gydKAoLAC_ionH1sX8Gtx1uNiKoVC_/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 19 Sorting and Searching [https://drive.google.com/file/d/1AvodtjocnBPjC1VywUr4FCEm6E7hdMbh/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 21 Data Structure [https://colab.research.google.com/drive/1p_o773MDJmvdWdsfMS5n2kClsPymixy1?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 22 Graph [https://colab.research.google.com/drive/1E9KhZWZj3V-OEkA0R1ckkauWhqrDKIrV?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;Workshop notes as PDF:&#039;&#039;&#039; [https://drive.google.com/drive/folders/117VF9KbFlYvEm4byWIwiadKxUdHMTvbE?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 23. Github. Numpy. Pandas [https://colab.research.google.com/drive/1ySQPzfsEAVEuDo6TEOjBN0Yx16Gw33WX?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/17Zq9XplOPss1j9ZoPX2JHm8ms95-F_LT/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/1T8LKnq_o4EO_KQRNl1IvcFZbmxlDSO8a/view?usp=sharing]&amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 24. Visualization [https://drive.google.com/file/d/1KodfeZDu9lOxFqmiYVpUdG--UjFFXT1j/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 25-26. Web scraping [https://drive.google.com/file/d/1wP_WgdIXKwnIzc_x4aJUsJDsR7-ezq7z/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 27. Flask_part1[https://drive.google.com/file/d/1NrKiY09O6ySBtrlcC-Jf3PZSGMVc1XtS/view?usp=sharing] Flask_part2[https://colab.research.google.com/drive/1rKpRMb4TeloPVV17nRs8RgNs0ZdW8Bn6?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &lt;br /&gt;
=== Contests ===&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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] || 21 Sep 2020, 23:59:59&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19792/problems/ Contest 2] || 28 Sep 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19938/problems/ Contest 3] || 5 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20240/problems/ Contest 4] || 19 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20721/problems/ Contest 5] || 26 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20933/problems/ Contest 6] || 26 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/21580/problems/ Contest 7] || 9 Nov 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/21882/problems/ Contest 8] || 16 Nov 2020, 23:59:59&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/22329/problems/ Contest 9] || 30 Nov 2020, 23:59:59&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results === &lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1DcXLGIRQ4LJCkEY_Fy_WS1JKkxGQoe15YnIbu4MrMdY/edit?usp=sharing Table with results]&lt;br /&gt;
&lt;br /&gt;
== November 14 Test ==&lt;br /&gt;
== &#039;&#039;&#039;Retake will take place on Saturday, December 05 at 12.50 &#039;&#039;&#039;==&lt;br /&gt;
The rules are the same. Anyone who scored 20 points and below can go to retake. The maximum possible number of points on a retake - 30.&lt;br /&gt;
&lt;br /&gt;
You will have 4 problems for 80 minutes: A, D - 10 points each, B, C - 5 points each.&lt;br /&gt;
 &lt;br /&gt;
The link to zoom: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/99169100569&lt;br /&gt;
Meeting ID: 991 6910 0569&lt;br /&gt;
Passcode: 373490. &lt;br /&gt;
&lt;br /&gt;
The link to the contest: https://official.contest.yandex.com/contest/23369/enter. &lt;br /&gt;
&lt;br /&gt;
Students who face any technical problems will write a supervised test at zoom and should be prepared to further defend their decisions. The link for those students is:&lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/98185159185?pwd=aFZYVU5uNDhtYkVuT014SHFLaFd2dz09&lt;br /&gt;
Meeting ID: 981 8515 9185&lt;br /&gt;
Passcode: 488301&lt;br /&gt;
&lt;br /&gt;
After the test submit the recording to this form within 30 minutes: https://forms.gle/1iuypcJjqzLkxUB5A&lt;br /&gt;
&lt;br /&gt;
If you are unable to submit the recording in 30 minutes, send the size (&#039;&#039;&#039; in bytes &#039;&#039;&#039;) of your video file using the same form. Later, when you are able to submit the recording, do it using the same form.&lt;br /&gt;
======Before the Test======&lt;br /&gt;
The test will be held using asynchronous proctoring on &#039;&#039;&#039;November 14, 2020 at 13:00.&#039;&#039;&#039;&lt;br /&gt;
Here is &#039;&#039;&#039;the zoom link&#039;&#039;&#039;: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/97320428256&lt;br /&gt;
Meeting ID: 973 2042 8256&lt;br /&gt;
Passcode: 645654&lt;br /&gt;
&lt;br /&gt;
This conference will be used for the final briefing and to communicate with teachers during the test if necessary. You can message them in the conference chat.&lt;br /&gt;
Each student must record the process of completing the assignments using OBS Studio, upload the result to the cloud storage immediately after the quiz and provide a link to the recording.&lt;br /&gt;
&#039;&#039;&#039;Link to the contest (will be duplicated in the zoom chat): &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
https://official.contest.yandex.com/contest/22472/enter&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their TA. They will write a supervised test at zoom and should be prepared to further defend their decisions at: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/99097338323?pwd=dk5obm92d3NTajlCcUh2ZXV0dElWUT09&lt;br /&gt;
Conference ID: 990 9733 8323&lt;br /&gt;
Password: 195557&lt;br /&gt;
&lt;br /&gt;
You will need a computer with a webcam and microphone (the majority of modern laptops have them) and Internet access.&amp;lt;br /&amp;gt;&lt;br /&gt;
You need to install OBS Studio using the link https://obsproject.com/ru &amp;lt;br /&amp;gt;&lt;br /&gt;
You need to record the microphone and webcam input as well as your screen. See instructions in the video: https://www.youtube.com/watch?v=KVKrvPvPLYg &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;You can use:&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
* The testing system site (https://contest.yandex.com/) and your solutions of past contests in it. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Development environments (installed on a computer ONLY, web IDEs are not allowed) &amp;lt;br /&amp;gt;&lt;br /&gt;
* Materials posted on this page &amp;lt;br /&amp;gt;&lt;br /&gt;
* Python documentation at https://docs.python.org/ &amp;lt;br /&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;It is prohibited to communicate with other people. Please warn the people around you about this in advance.&#039;&#039;&#039; &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====== Actions you must complete before the test:======&lt;br /&gt;
* Disable all messengers in advance and close all unnecessary tabs. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Physically disconnect and remove any electronic devices and additional monitors from the workplace. &amp;lt;br /&amp;gt;&lt;br /&gt;
* You will not be able to leave your workplace for 1 hour 30 minutes, be ready for that. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Enable recording from three sources: screen, webcam and microphone in OBS Studio. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Record your workplace from and its surroundings on video. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Show the camera the blank pages you plan to use as drafts. &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
======During the Test======&lt;br /&gt;
On November 14, 2020 at 13.00 enter the zoom using the link that will appear here, higher on this page and in the Telegram chat. Please disable Telegram after receiving the link. We will provide a general briefing. This Zoom conference will be used as a chat to communicate with teachers during the test, if necessary. &amp;lt;br /&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;Please start recording before you start the test! Students who started recording too late will be disqualified.&#039;&#039;&#039; At 13:15 a contest consisting of 5 problems opens (10 points per problem). The contest closes at 14:45.&amp;lt;br /&amp;gt;&lt;br /&gt;
When the test is over, you will have &#039;&#039;&#039;half an hour to upload the recorded video&#039;&#039;&#039;. Only the teachers and assistants will view your videos.&amp;lt;br /&amp;gt;&lt;br /&gt;
Please &#039;&#039;&#039;check that you have learned how to record video in the required format&#039;&#039;&#039; in advance as this can sometimes be problematic. All solutions to problems with recording in OBS Studio can be found online.&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
======Procedure during the test:======&lt;br /&gt;
* You should ask any questions via the testing system or via chat in zoom.&amp;lt;br /&amp;gt;&lt;br /&gt;
* If you are working with a paper draft, aim the camera so that your hands are visible. Remember to point your webcam at your face when you return to work at your screen.&amp;lt;br /&amp;gt;&lt;br /&gt;
* You can receive important announcements from instructors through the testing system. Notifications appear in the upper right corner of the testing system interface.&amp;lt;br /&amp;gt;&lt;br /&gt;
* If you want to complete the test ahead of time, message the teacher or a TA using the questions interface in the testing system and complete all the actions that you must perform after the end of the test. &lt;br /&gt;
* If you try to return to the test after sending this message, you will be disqualified.&amp;lt;br /&amp;gt;&lt;br /&gt;
* Wearing headphones is prohibited. &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====== After finishing the test: ======&lt;br /&gt;
Within 30 minutes, you must post the video that you recorded during the test in the public domain and submit a link to it in this form: https://forms.gle/ZtzU9QGhZ8gbFpyq7&lt;br /&gt;
&lt;br /&gt;
Don&#039;t forget to upload a copy of your document (passport or student ID)&lt;br /&gt;
&lt;br /&gt;
Good luck!&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 17th, 23:59&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Submission format.&#039;&#039;&#039; Jupyter Notebook, submit a link to the notebook file and the dataset file via this Google form: https://forms.gle/NhAhe9LMebbkWWxd7&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dataset selection.&#039;&#039;&#039; After you choose a dataset for the project, submit it to this form: https://forms.gle/YK9ijh5iTqB72y4eA&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it. https://docs.google.com/spreadsheets/d/1Q9o0FBh-lNGbqGT63NtLHIPNI5AP21obq4S12pfHdh0&lt;br /&gt;
&lt;br /&gt;
Project description:&lt;br /&gt;
Find a dataset with text data and analyze it the following way.&lt;br /&gt;
# Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
# Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
# Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of the column A for different values of the column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
# Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
will take place &#039;&#039;&#039;on Saturday, December 26 at 10:00&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The rules are the same as on test.&lt;br /&gt;
&lt;br /&gt;
In the case of plagiarism, zero is set for the entire work. In case of suspicion of plagiarism, the student will be summoned for defence.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The link to zoom:  https://zoom.us/j/99403879699 Passcode: 859144&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The link to the contest: &amp;lt;will be here before the exam&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; will write a supervised test at zoom and should be prepared to further defend their decisions. The link for those students is: https://zoom.us/j/93234922042?pwd=OFE3MmVtVzZKWExYUnJvTkJ5VGV5UT09 Код доступа: 755751&lt;br /&gt;
&lt;br /&gt;
After the test submit the recording to this form within 30 minutes: https://forms.gle/gF6RZQMAWpGbokZ48&lt;br /&gt;
&lt;br /&gt;
If you are unable to submit the recording in 30 minutes, send the size ( in bytes ) of your video file using the same form. Later, when you are able to submit the recording, do it using the same form.&lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_programming_DSBA_2020/2021&amp;diff=49007</id>
		<title>Introduction to programming DSBA 2020/2021</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_programming_DSBA_2020/2021&amp;diff=49007"/>
		<updated>2020-12-24T20:21:13Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Workshop notes */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&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 !! 201 !! 202 !! 203 !! 204&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 201 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
201 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &lt;br /&gt;
|| 202 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
202 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 203 - 1: Chuvilina A.A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru] , tg: [https://tlgg.ru/chuvilinaann @chuvilinaann] &amp;lt;br&amp;gt;&lt;br /&gt;
203 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|| &lt;br /&gt;
Sysoev M. V. &amp;lt;br&amp;gt; [mailto:sysoevmark@gmail.com sysoevmark@gmail.com], tg: [https://tlgg.ru/BartolomeuD @BartolomeuD]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Diana K., tg: [https://tlgg.ru/shadowcure @shadowcure]&lt;br /&gt;
|| Rustam K., tg: [https://tlgg.ru/dergalaktischekaiser @dergalaktischekaiser]&lt;br /&gt;
|| Lily K., tg: [https://tlgg.ru/lily_kurchenko @lily_kurchenko]&lt;br /&gt;
|| Sergey G., tg: [https://tlgg.ru/SeregaEFD @SeregaEFD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Jingtao X., tg: [https://tlgg.ru/andy0814xu @andy0814xu]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1JJwc4CZMkgIbVFPxit5n5muA4_dEQMpV/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1zZhY-KiFpmdacKR8P0PqPmfuKZPHzMc8/view?usp=sharing Lecture 2. Numeral systems. Real numbers.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1K_h2xlPQ60PX-saYfgXH7bbTDQ1fqtOm/view?usp=sharing Lecture 3. Strings. The Zen of Python. PEP-8.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1BdCL1hjqH_E6EK8NebmnvH655SzqFyA4/view?usp=sharing Lecture 4. Lists&amp;amp;tuples] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/16QiYgf7jgy1Wuiilcs51fDOBDKGHMXZN/view?usp=sharing Lecture 5. Functions&amp;amp;recursion] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19Jos3bfDXAfpxucDsjmYAeEAAuobFxLv/view?usp=sharing Lecture 6. sets &amp;amp; dictionaries] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Q-0beUgk9fR83nkzqAlVfMxrKDfdGcZM/view?usp=sharing Lecture 8. files. exceptions &amp;amp; errors] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1gq5NqV2LmpQU2W1Wj5HQJkuxDC_Q_kxD/view?usp=sharing Lecture 9. functional]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1i8arJc58cSSYE0WIzsnLBKC-IHVgakxb/view?usp=sharing Lecture 10. OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1AwXHgF5e5sVSNisou0IGo2qLbbwGNXg2/view?usp=sharing Lecture 11. sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1LCqYrxz2SqCf1GiuYgg3-ikC0G1M2Jxe/view?usp=sharing Lecture 12. data structures] &amp;lt;br&amp;gt;&lt;br /&gt;
lecture 13. Python for data analysis&lt;br /&gt;
[https://drive.google.com/file/d/1Qg4cVjl30WMIo_tWb0CfS2wEHYu1Qi9W/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/13mfZo-A2up30mA_2tWorWi24n9D2eqzR/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/1wE97tvUP028ihUsRu_Z9jMEe6VntaUT_/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1546Nk2AQNURnAZJ30X51QC9NERGqxwg-/view?usp=sharing Lecture 14. web scraping]&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
Workshop 3_Number systems [https://drive.google.com/file/d/1C-rojoAQW_QV_-81-74p_d6DBmgqPymd/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 4_real_strings [https://drive.google.com/file/d/1fNCkIOoENkp1V_gleuECYHTWtbww0ulL/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 5_strings [https://colab.research.google.com/drive/1MYGUntyiofnSQfYfoUjzZOpIIxJvm0m9?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 6_strings [https://drive.google.com/file/d/1nzkxOUlWYS4kcXMNsqRFQGnMnuLA3Dlg/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 7_lists_tuples [https://drive.google.com/file/d/1Kb4owufwUJe7wE7LsURjWz4ozogUt2rr/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 8 Tasks on lists &amp;amp; tuples [https://drive.google.com/file/d/19YCydAOdpS6A0D2Vxnt0xrLdAaFW6h38/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 9 Functions &amp;amp; Recursion [https://drive.google.com/file/d/1WqT_9dG_eKy9cCTGa3JGraxHmY6ZFfeT/view?usp=sharing]&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 10 Some more tasks on Functions [https://drive.google.com/file/d/1YIsfHECedyz0GbXQ_8EBgHxv2P6THcZS/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 11 Sets_Dictionaries [https://drive.google.com/file/d/1j-JVnvVbc5XTVkGXUUGU6eDC-HyWVvgd/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 12 Tasks on sets and dictionaries [https://drive.google.com/file/d/1Lb5hJfWVnLSWCHZIwsS_Eyz_Lfi_MrIJ/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 13 Files_Exceptions_Errors [https://drive.google.com/file/d/1_H2gS4eb8qBY8YhOfReDyxdIwAW6ORhl/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 14 Code Style and Code Reading [https://colab.research.google.com/drive/1vAJOxzd_Cx5vOBdAWpc09JREwuBR6Fsy?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 15 Iterators and Generators [https://colab.research.google.com/drive/1IQqvUN8Z_JZx6h3mSuKPdGDs7PlpGoZ2?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 16 Functional Tasks [https://colab.research.google.com/drive/1KFzewIimC5vgRuUp40Rff_bJ7xRi7KNJ?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 17 OOP [https://drive.google.com/file/d/1YNC2BZGeVqqr1qtS3VbPgPM1Ll6l4kZQ/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 18 OOP_tasks [https://drive.google.com/file/d/19-gydKAoLAC_ionH1sX8Gtx1uNiKoVC_/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 19 Sorting and Searching [https://drive.google.com/file/d/1AvodtjocnBPjC1VywUr4FCEm6E7hdMbh/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 21 Data Structure [https://colab.research.google.com/drive/1p_o773MDJmvdWdsfMS5n2kClsPymixy1?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 22 Graph [https://colab.research.google.com/drive/1E9KhZWZj3V-OEkA0R1ckkauWhqrDKIrV?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;Workshop notes as PDF:&#039;&#039;&#039; [https://drive.google.com/drive/folders/117VF9KbFlYvEm4byWIwiadKxUdHMTvbE?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 23. Github. Numpy. Pandas [https://colab.research.google.com/drive/1ySQPzfsEAVEuDo6TEOjBN0Yx16Gw33WX?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/17Zq9XplOPss1j9ZoPX2JHm8ms95-F_LT/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/1T8LKnq_o4EO_KQRNl1IvcFZbmxlDSO8a/view?usp=sharing]&amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 24. Visualization [https://drive.google.com/file/d/1KodfeZDu9lOxFqmiYVpUdG--UjFFXT1j/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 25-26. Web scraping [https://drive.google.com/file/d/1wP_WgdIXKwnIzc_x4aJUsJDsR7-ezq7z/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 27. Flask_part1[https://drive.google.com/file/d/1NrKiY09O6ySBtrlcC-Jf3PZSGMVc1XtS/view?usp=sharing] Flask_part2[https://colab.research.google.com/drive/1rKpRMb4TeloPVV17nRs8RgNs0ZdW8Bn6?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &lt;br /&gt;
=== Contests ===&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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] || 21 Sep 2020, 23:59:59&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19792/problems/ Contest 2] || 28 Sep 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19938/problems/ Contest 3] || 5 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20240/problems/ Contest 4] || 19 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20721/problems/ Contest 5] || 26 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20933/problems/ Contest 6] || 26 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/21580/problems/ Contest 7] || 9 Nov 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/21882/problems/ Contest 8] || 16 Nov 2020, 23:59:59&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/22329/problems/ Contest 9] || 30 Nov 2020, 23:59:59&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results === &lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1DcXLGIRQ4LJCkEY_Fy_WS1JKkxGQoe15YnIbu4MrMdY/edit?usp=sharing Table with results]&lt;br /&gt;
&lt;br /&gt;
== November 14 Test ==&lt;br /&gt;
== &#039;&#039;&#039;Retake will take place on Saturday, December 05 at 12.50 &#039;&#039;&#039;==&lt;br /&gt;
The rules are the same. Anyone who scored 20 points and below can go to retake. The maximum possible number of points on a retake - 30.&lt;br /&gt;
&lt;br /&gt;
You will have 4 problems for 80 minutes: A, D - 10 points each, B, C - 5 points each.&lt;br /&gt;
 &lt;br /&gt;
The link to zoom: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/99169100569&lt;br /&gt;
Meeting ID: 991 6910 0569&lt;br /&gt;
Passcode: 373490. &lt;br /&gt;
&lt;br /&gt;
The link to the contest: https://official.contest.yandex.com/contest/23369/enter. &lt;br /&gt;
&lt;br /&gt;
Students who face any technical problems will write a supervised test at zoom and should be prepared to further defend their decisions. The link for those students is:&lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/98185159185?pwd=aFZYVU5uNDhtYkVuT014SHFLaFd2dz09&lt;br /&gt;
Meeting ID: 981 8515 9185&lt;br /&gt;
Passcode: 488301&lt;br /&gt;
&lt;br /&gt;
After the test submit the recording to this form within 30 minutes: https://forms.gle/1iuypcJjqzLkxUB5A&lt;br /&gt;
&lt;br /&gt;
If you are unable to submit the recording in 30 minutes, send the size (&#039;&#039;&#039; in bytes &#039;&#039;&#039;) of your video file using the same form. Later, when you are able to submit the recording, do it using the same form.&lt;br /&gt;
======Before the Test======&lt;br /&gt;
The test will be held using asynchronous proctoring on &#039;&#039;&#039;November 14, 2020 at 13:00.&#039;&#039;&#039;&lt;br /&gt;
Here is &#039;&#039;&#039;the zoom link&#039;&#039;&#039;: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/97320428256&lt;br /&gt;
Meeting ID: 973 2042 8256&lt;br /&gt;
Passcode: 645654&lt;br /&gt;
&lt;br /&gt;
This conference will be used for the final briefing and to communicate with teachers during the test if necessary. You can message them in the conference chat.&lt;br /&gt;
Each student must record the process of completing the assignments using OBS Studio, upload the result to the cloud storage immediately after the quiz and provide a link to the recording.&lt;br /&gt;
&#039;&#039;&#039;Link to the contest (will be duplicated in the zoom chat): &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
https://official.contest.yandex.com/contest/22472/enter&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their TA. They will write a supervised test at zoom and should be prepared to further defend their decisions at: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/99097338323?pwd=dk5obm92d3NTajlCcUh2ZXV0dElWUT09&lt;br /&gt;
Conference ID: 990 9733 8323&lt;br /&gt;
Password: 195557&lt;br /&gt;
&lt;br /&gt;
You will need a computer with a webcam and microphone (the majority of modern laptops have them) and Internet access.&amp;lt;br /&amp;gt;&lt;br /&gt;
You need to install OBS Studio using the link https://obsproject.com/ru &amp;lt;br /&amp;gt;&lt;br /&gt;
You need to record the microphone and webcam input as well as your screen. See instructions in the video: https://www.youtube.com/watch?v=KVKrvPvPLYg &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;You can use:&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
* The testing system site (https://contest.yandex.com/) and your solutions of past contests in it. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Development environments (installed on a computer ONLY, web IDEs are not allowed) &amp;lt;br /&amp;gt;&lt;br /&gt;
* Materials posted on this page &amp;lt;br /&amp;gt;&lt;br /&gt;
* Python documentation at https://docs.python.org/ &amp;lt;br /&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;It is prohibited to communicate with other people. Please warn the people around you about this in advance.&#039;&#039;&#039; &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====== Actions you must complete before the test:======&lt;br /&gt;
* Disable all messengers in advance and close all unnecessary tabs. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Physically disconnect and remove any electronic devices and additional monitors from the workplace. &amp;lt;br /&amp;gt;&lt;br /&gt;
* You will not be able to leave your workplace for 1 hour 30 minutes, be ready for that. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Enable recording from three sources: screen, webcam and microphone in OBS Studio. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Record your workplace from and its surroundings on video. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Show the camera the blank pages you plan to use as drafts. &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
======During the Test======&lt;br /&gt;
On November 14, 2020 at 13.00 enter the zoom using the link that will appear here, higher on this page and in the Telegram chat. Please disable Telegram after receiving the link. We will provide a general briefing. This Zoom conference will be used as a chat to communicate with teachers during the test, if necessary. &amp;lt;br /&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;Please start recording before you start the test! Students who started recording too late will be disqualified.&#039;&#039;&#039; At 13:15 a contest consisting of 5 problems opens (10 points per problem). The contest closes at 14:45.&amp;lt;br /&amp;gt;&lt;br /&gt;
When the test is over, you will have &#039;&#039;&#039;half an hour to upload the recorded video&#039;&#039;&#039;. Only the teachers and assistants will view your videos.&amp;lt;br /&amp;gt;&lt;br /&gt;
Please &#039;&#039;&#039;check that you have learned how to record video in the required format&#039;&#039;&#039; in advance as this can sometimes be problematic. All solutions to problems with recording in OBS Studio can be found online.&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
======Procedure during the test:======&lt;br /&gt;
* You should ask any questions via the testing system or via chat in zoom.&amp;lt;br /&amp;gt;&lt;br /&gt;
* If you are working with a paper draft, aim the camera so that your hands are visible. Remember to point your webcam at your face when you return to work at your screen.&amp;lt;br /&amp;gt;&lt;br /&gt;
* You can receive important announcements from instructors through the testing system. Notifications appear in the upper right corner of the testing system interface.&amp;lt;br /&amp;gt;&lt;br /&gt;
* If you want to complete the test ahead of time, message the teacher or a TA using the questions interface in the testing system and complete all the actions that you must perform after the end of the test. &lt;br /&gt;
* If you try to return to the test after sending this message, you will be disqualified.&amp;lt;br /&amp;gt;&lt;br /&gt;
* Wearing headphones is prohibited. &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====== After finishing the test: ======&lt;br /&gt;
Within 30 minutes, you must post the video that you recorded during the test in the public domain and submit a link to it in this form: https://forms.gle/ZtzU9QGhZ8gbFpyq7&lt;br /&gt;
&lt;br /&gt;
Don&#039;t forget to upload a copy of your document (passport or student ID)&lt;br /&gt;
&lt;br /&gt;
Good luck!&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 17th, 23:59&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Submission format.&#039;&#039;&#039; Jupyter Notebook, submit a link to the notebook file and the dataset file via this Google form: https://forms.gle/NhAhe9LMebbkWWxd7&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dataset selection.&#039;&#039;&#039; After you choose a dataset for the project, submit it to this form: https://forms.gle/YK9ijh5iTqB72y4eA&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it. https://docs.google.com/spreadsheets/d/1Q9o0FBh-lNGbqGT63NtLHIPNI5AP21obq4S12pfHdh0&lt;br /&gt;
&lt;br /&gt;
Project description:&lt;br /&gt;
Find a dataset with text data and analyze it the following way.&lt;br /&gt;
# Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
# Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
# Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of the column A for different values of the column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
# Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
&lt;br /&gt;
== Exam ==&lt;br /&gt;
will take place &#039;&#039;&#039;on Saturday, December 26 at 10:00&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The rules are the same as on test.&lt;br /&gt;
&lt;br /&gt;
In the case of plagiarism, zero is set for the entire work. In case of suspicion of plagiarism, the student will be summoned for defence.&lt;br /&gt;
&lt;br /&gt;
The link to zoom:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;will be here before the exam&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The link to the contest: &amp;lt;will be here before the exam&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Students who face any technical problems will write a supervised test at zoom and should be prepared to further defend their decisions. The link for those students is:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;will be here before the exam&amp;gt;&lt;br /&gt;
&lt;br /&gt;
After the test submit the recording to this form within 30 minutes: &amp;lt;will be here before the exam&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If you are unable to submit the recording in 30 minutes, send the size ( in bytes ) of your video file using the same form. Later, when you are able to submit the recording, do it using the same form.&lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
https://www.hse.ru/edu/courses/394772654&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_programming_DSBA_2020/2021&amp;diff=48214</id>
		<title>Introduction to programming DSBA 2020/2021</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_programming_DSBA_2020/2021&amp;diff=48214"/>
		<updated>2020-12-05T16:36:16Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: Added project&lt;/p&gt;
&lt;hr /&gt;
&lt;div&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 !! 201 !! 202 !! 203 !! 204&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 201 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
201 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &lt;br /&gt;
|| 202 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
202 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 203 - 1: Chuvilina A.A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru] , tg: [https://tlgg.ru/chuvilinaann @chuvilinaann] &amp;lt;br&amp;gt;&lt;br /&gt;
203 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|| &lt;br /&gt;
Sysoev M. V. &amp;lt;br&amp;gt; [mailto:sysoevmark@gmail.com sysoevmark@gmail.com], tg: [https://tlgg.ru/BartolomeuD @BartolomeuD]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Diana K., tg: [https://tlgg.ru/shadowcure @shadowcure]&lt;br /&gt;
|| Rustam K., tg: [https://tlgg.ru/dergalaktischekaiser @dergalaktischekaiser]&lt;br /&gt;
|| Lily K., tg: [https://tlgg.ru/lily_kurchenko @lily_kurchenko]&lt;br /&gt;
|| Sergey G., tg: [https://tlgg.ru/SeregaEFD @SeregaEFD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Jingtao X., tg: [https://tlgg.ru/andy0814xu @andy0814xu]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1JJwc4CZMkgIbVFPxit5n5muA4_dEQMpV/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1zZhY-KiFpmdacKR8P0PqPmfuKZPHzMc8/view?usp=sharing Lecture 2. Numeral systems. Real numbers.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1K_h2xlPQ60PX-saYfgXH7bbTDQ1fqtOm/view?usp=sharing Lecture 3. Strings. The Zen of Python. PEP-8.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1BdCL1hjqH_E6EK8NebmnvH655SzqFyA4/view?usp=sharing Lecture 4. Lists&amp;amp;tuples] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/16QiYgf7jgy1Wuiilcs51fDOBDKGHMXZN/view?usp=sharing Lecture 5. Functions&amp;amp;recursion] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19Jos3bfDXAfpxucDsjmYAeEAAuobFxLv/view?usp=sharing Lecture 6. sets &amp;amp; dictionaries] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Q-0beUgk9fR83nkzqAlVfMxrKDfdGcZM/view?usp=sharing Lecture 8. files. exceptions &amp;amp; errors] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1gq5NqV2LmpQU2W1Wj5HQJkuxDC_Q_kxD/view?usp=sharing Lecture 9. functional]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1i8arJc58cSSYE0WIzsnLBKC-IHVgakxb/view?usp=sharing Lecture 10. OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1AwXHgF5e5sVSNisou0IGo2qLbbwGNXg2/view?usp=sharing Lecture 11. sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1LCqYrxz2SqCf1GiuYgg3-ikC0G1M2Jxe/view?usp=sharing Lecture 12. data structures] &amp;lt;br&amp;gt;&lt;br /&gt;
lecture 13. Python for data analysis&lt;br /&gt;
[https://drive.google.com/file/d/1Qg4cVjl30WMIo_tWb0CfS2wEHYu1Qi9W/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/13mfZo-A2up30mA_2tWorWi24n9D2eqzR/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/1wE97tvUP028ihUsRu_Z9jMEe6VntaUT_/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
Workshop 3_Number systems [https://drive.google.com/file/d/1C-rojoAQW_QV_-81-74p_d6DBmgqPymd/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 4_real_strings [https://drive.google.com/file/d/1fNCkIOoENkp1V_gleuECYHTWtbww0ulL/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 5_strings [https://colab.research.google.com/drive/1MYGUntyiofnSQfYfoUjzZOpIIxJvm0m9?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 6_strings [https://drive.google.com/file/d/1nzkxOUlWYS4kcXMNsqRFQGnMnuLA3Dlg/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 7_lists_tuples [https://drive.google.com/file/d/1Kb4owufwUJe7wE7LsURjWz4ozogUt2rr/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 8 Tasks on lists &amp;amp; tuples [https://drive.google.com/file/d/19YCydAOdpS6A0D2Vxnt0xrLdAaFW6h38/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 9 Functions &amp;amp; Recursion [https://drive.google.com/file/d/1WqT_9dG_eKy9cCTGa3JGraxHmY6ZFfeT/view?usp=sharing]&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 10 Some more tasks on Functions [https://drive.google.com/file/d/1YIsfHECedyz0GbXQ_8EBgHxv2P6THcZS/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 11 Sets_Dictionaries [https://drive.google.com/file/d/1j-JVnvVbc5XTVkGXUUGU6eDC-HyWVvgd/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 12 Tasks on sets and dictionaries [https://drive.google.com/file/d/1Lb5hJfWVnLSWCHZIwsS_Eyz_Lfi_MrIJ/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 13 Files_Exceptions_Errors [https://drive.google.com/file/d/1_H2gS4eb8qBY8YhOfReDyxdIwAW6ORhl/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 14 Code Style and Code Reading [https://colab.research.google.com/drive/1vAJOxzd_Cx5vOBdAWpc09JREwuBR6Fsy?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 15 Iterators and Generators [https://colab.research.google.com/drive/1IQqvUN8Z_JZx6h3mSuKPdGDs7PlpGoZ2?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 16 Functional Tasks [https://colab.research.google.com/drive/1KFzewIimC5vgRuUp40Rff_bJ7xRi7KNJ?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 17 OOP [https://drive.google.com/file/d/1YNC2BZGeVqqr1qtS3VbPgPM1Ll6l4kZQ/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 18 OOP_tasks [https://drive.google.com/file/d/19-gydKAoLAC_ionH1sX8Gtx1uNiKoVC_/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 19 Sorting and Searching [https://drive.google.com/file/d/1AvodtjocnBPjC1VywUr4FCEm6E7hdMbh/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 21 Data Structure [https://colab.research.google.com/drive/1p_o773MDJmvdWdsfMS5n2kClsPymixy1?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 22 Graph [https://colab.research.google.com/drive/1E9KhZWZj3V-OEkA0R1ckkauWhqrDKIrV?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop notes as PDF: [https://drive.google.com/drive/folders/117VF9KbFlYvEm4byWIwiadKxUdHMTvbE?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 23. Github. Numpy. Pandas [https://colab.research.google.com/drive/1ySQPzfsEAVEuDo6TEOjBN0Yx16Gw33WX?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/17Zq9XplOPss1j9ZoPX2JHm8ms95-F_LT/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/1T8LKnq_o4EO_KQRNl1IvcFZbmxlDSO8a/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &lt;br /&gt;
=== Contests ===&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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] || 21 Sep 2020, 23:59:59&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19792/problems/ Contest 2] || 28 Sep 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19938/problems/ Contest 3] || 5 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20240/problems/ Contest 4] || 19 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20721/problems/ Contest 5] || 26 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20933/problems/ Contest 6] || 26 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/21580/problems/ Contest 7] || 9 Nov 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/21882/problems/ Contest 8] || 16 Nov 2020, 23:59:59&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/22329/problems/ Contest 9] || 30 Nov 2020, 23:59:59&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results === &lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1DcXLGIRQ4LJCkEY_Fy_WS1JKkxGQoe15YnIbu4MrMdY/edit?usp=sharing Table with results]&lt;br /&gt;
&lt;br /&gt;
== November 14 Test ==&lt;br /&gt;
== &#039;&#039;&#039;Retake will take place on Saturday, December 05 at 12.50 &#039;&#039;&#039;==&lt;br /&gt;
The rules are the same. Anyone who scored 20 points and below can go to retake. The maximum possible number of points on a retake - 30.&lt;br /&gt;
&lt;br /&gt;
You will have 4 problems for 80 minutes: A, D - 10 points each, B, C - 5 points each.&lt;br /&gt;
 &lt;br /&gt;
The link to zoom: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/99169100569&lt;br /&gt;
Meeting ID: 991 6910 0569&lt;br /&gt;
Passcode: 373490. &lt;br /&gt;
&lt;br /&gt;
The link to the contest: https://official.contest.yandex.com/contest/23369/enter. &lt;br /&gt;
&lt;br /&gt;
Students who face any technical problems will write a supervised test at zoom and should be prepared to further defend their decisions. The link for those students is:&lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/98185159185?pwd=aFZYVU5uNDhtYkVuT014SHFLaFd2dz09&lt;br /&gt;
Meeting ID: 981 8515 9185&lt;br /&gt;
Passcode: 488301&lt;br /&gt;
&lt;br /&gt;
After the test submit the recording to this form within 30 minutes: https://forms.gle/1iuypcJjqzLkxUB5A&lt;br /&gt;
&lt;br /&gt;
If you are unable to submit the recording in 30 minutes, send the size (&#039;&#039;&#039; in bytes &#039;&#039;&#039;) of your video file using the same form. Later, when you are able to submit the recording, do it using the same form.&lt;br /&gt;
======Before the Test======&lt;br /&gt;
The test will be held using asynchronous proctoring on &#039;&#039;&#039;November 14, 2020 at 13:00.&#039;&#039;&#039;&lt;br /&gt;
Here is &#039;&#039;&#039;the zoom link&#039;&#039;&#039;: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/97320428256&lt;br /&gt;
Meeting ID: 973 2042 8256&lt;br /&gt;
Passcode: 645654&lt;br /&gt;
&lt;br /&gt;
This conference will be used for the final briefing and to communicate with teachers during the test if necessary. You can message them in the conference chat.&lt;br /&gt;
Each student must record the process of completing the assignments using OBS Studio, upload the result to the cloud storage immediately after the quiz and provide a link to the recording.&lt;br /&gt;
&#039;&#039;&#039;Link to the contest (will be duplicated in the zoom chat): &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
https://official.contest.yandex.com/contest/22472/enter&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their TA. They will write a supervised test at zoom and should be prepared to further defend their decisions at: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/99097338323?pwd=dk5obm92d3NTajlCcUh2ZXV0dElWUT09&lt;br /&gt;
Conference ID: 990 9733 8323&lt;br /&gt;
Password: 195557&lt;br /&gt;
&lt;br /&gt;
You will need a computer with a webcam and microphone (the majority of modern laptops have them) and Internet access.&amp;lt;br /&amp;gt;&lt;br /&gt;
You need to install OBS Studio using the link https://obsproject.com/ru &amp;lt;br /&amp;gt;&lt;br /&gt;
You need to record the microphone and webcam input as well as your screen. See instructions in the video: https://www.youtube.com/watch?v=KVKrvPvPLYg &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;You can use:&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
* The testing system site (https://contest.yandex.com/) and your solutions of past contests in it. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Development environments (installed on a computer ONLY, web IDEs are not allowed) &amp;lt;br /&amp;gt;&lt;br /&gt;
* Materials posted on this page &amp;lt;br /&amp;gt;&lt;br /&gt;
* Python documentation at https://docs.python.org/ &amp;lt;br /&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;It is prohibited to communicate with other people. Please warn the people around you about this in advance.&#039;&#039;&#039; &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====== Actions you must complete before the test:======&lt;br /&gt;
* Disable all messengers in advance and close all unnecessary tabs. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Physically disconnect and remove any electronic devices and additional monitors from the workplace. &amp;lt;br /&amp;gt;&lt;br /&gt;
* You will not be able to leave your workplace for 1 hour 30 minutes, be ready for that. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Enable recording from three sources: screen, webcam and microphone in OBS Studio. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Record your workplace from and its surroundings on video. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Show the camera the blank pages you plan to use as drafts. &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
======During the Test======&lt;br /&gt;
On November 14, 2020 at 13.00 enter the zoom using the link that will appear here, higher on this page and in the Telegram chat. Please disable Telegram after receiving the link. We will provide a general briefing. This Zoom conference will be used as a chat to communicate with teachers during the test, if necessary. &amp;lt;br /&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;Please start recording before you start the test! Students who started recording too late will be disqualified.&#039;&#039;&#039; At 13:15 a contest consisting of 5 problems opens (10 points per problem). The contest closes at 14:45.&amp;lt;br /&amp;gt;&lt;br /&gt;
When the test is over, you will have &#039;&#039;&#039;half an hour to upload the recorded video&#039;&#039;&#039;. Only the teachers and assistants will view your videos.&amp;lt;br /&amp;gt;&lt;br /&gt;
Please &#039;&#039;&#039;check that you have learned how to record video in the required format&#039;&#039;&#039; in advance as this can sometimes be problematic. All solutions to problems with recording in OBS Studio can be found online.&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
======Procedure during the test:======&lt;br /&gt;
* You should ask any questions via the testing system or via chat in zoom.&amp;lt;br /&amp;gt;&lt;br /&gt;
* If you are working with a paper draft, aim the camera so that your hands are visible. Remember to point your webcam at your face when you return to work at your screen.&amp;lt;br /&amp;gt;&lt;br /&gt;
* You can receive important announcements from instructors through the testing system. Notifications appear in the upper right corner of the testing system interface.&amp;lt;br /&amp;gt;&lt;br /&gt;
* If you want to complete the test ahead of time, message the teacher or a TA using the questions interface in the testing system and complete all the actions that you must perform after the end of the test. &lt;br /&gt;
* If you try to return to the test after sending this message, you will be disqualified.&amp;lt;br /&amp;gt;&lt;br /&gt;
* Wearing headphones is prohibited. &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====== After finishing the test: ======&lt;br /&gt;
Within 30 minutes, you must post the video that you recorded during the test in the public domain and submit a link to it in this form: https://forms.gle/ZtzU9QGhZ8gbFpyq7&lt;br /&gt;
&lt;br /&gt;
Don&#039;t forget to upload a copy of your document (passport or student ID)&lt;br /&gt;
&lt;br /&gt;
Good luck!&lt;br /&gt;
&lt;br /&gt;
== Project ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Deadline&#039;&#039;&#039;: December 17th, 23:59&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Submission format.&#039;&#039;&#039; Jupyter Notebook, submit a link to the notebook file and the dataset file via this Google form: https://forms.gle/NhAhe9LMebbkWWxd7&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dataset selection.&#039;&#039;&#039; After you choose a dataset for the project, submit it to this form: https://forms.gle/YK9ijh5iTqB72y4eA&lt;br /&gt;
&lt;br /&gt;
When selecting a dataset, check this table with the form responses to make sure nobody else has picked it. https://docs.google.com/spreadsheets/d/1Q9o0FBh-lNGbqGT63NtLHIPNI5AP21obq4S12pfHdh0&lt;br /&gt;
&lt;br /&gt;
Project description:&lt;br /&gt;
Find a dataset with text data and analyze it the following way.&lt;br /&gt;
# Output descriptive statistics of the dataset: mean, median, standard deviation. Do this for at least 3 numerical fields.&lt;br /&gt;
# Plot at least 3 numerical fields. Choose the plot type based on the data. It may make more sense to do a scatter plot, a regular plot, a histogram or something else.&lt;br /&gt;
# Do at least 2 comparisons similar to the ones in the Titanic example. &amp;quot;What are the distributions of the column A for different values of the column B?&amp;quot; Output as either numbers or plots.&lt;br /&gt;
# Describe your results in 2-3 paragraphs of text. What you can see from the plot, from the statistics and comparisons.&lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
Link TBD&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_programming_DSBA_2020/2021&amp;diff=48195</id>
		<title>Introduction to programming DSBA 2020/2021</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_programming_DSBA_2020/2021&amp;diff=48195"/>
		<updated>2020-12-05T08:50:35Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Retake will take place on Saturday, December 05 at 12.50  */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&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 !! 201 !! 202 !! 203 !! 204&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 201 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
201 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &lt;br /&gt;
|| 202 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
202 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 203 - 1: Chuvilina A.A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru] , tg: [https://tlgg.ru/chuvilinaann @chuvilinaann] &amp;lt;br&amp;gt;&lt;br /&gt;
203 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|| &lt;br /&gt;
Sysoev M. V. &amp;lt;br&amp;gt; [mailto:sysoevmark@gmail.com sysoevmark@gmail.com], tg: [https://tlgg.ru/BartolomeuD @BartolomeuD]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Diana K., tg: [https://tlgg.ru/shadowcure @shadowcure]&lt;br /&gt;
|| Rustam K., tg: [https://tlgg.ru/dergalaktischekaiser @dergalaktischekaiser]&lt;br /&gt;
|| Lily K., tg: [https://tlgg.ru/lily_kurchenko @lily_kurchenko]&lt;br /&gt;
|| Sergey G., tg: [https://tlgg.ru/SeregaEFD @SeregaEFD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Jingtao X., tg: [https://tlgg.ru/andy0814xu @andy0814xu]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1JJwc4CZMkgIbVFPxit5n5muA4_dEQMpV/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1zZhY-KiFpmdacKR8P0PqPmfuKZPHzMc8/view?usp=sharing Lecture 2. Numeral systems. Real numbers.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1K_h2xlPQ60PX-saYfgXH7bbTDQ1fqtOm/view?usp=sharing Lecture 3. Strings. The Zen of Python. PEP-8.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1BdCL1hjqH_E6EK8NebmnvH655SzqFyA4/view?usp=sharing Lecture 4. Lists&amp;amp;tuples] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/16QiYgf7jgy1Wuiilcs51fDOBDKGHMXZN/view?usp=sharing Lecture 5. Functions&amp;amp;recursion] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19Jos3bfDXAfpxucDsjmYAeEAAuobFxLv/view?usp=sharing Lecture 6. sets &amp;amp; dictionaries] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Q-0beUgk9fR83nkzqAlVfMxrKDfdGcZM/view?usp=sharing Lecture 8. files. exceptions &amp;amp; errors] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1gq5NqV2LmpQU2W1Wj5HQJkuxDC_Q_kxD/view?usp=sharing Lecture 9. functional]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1i8arJc58cSSYE0WIzsnLBKC-IHVgakxb/view?usp=sharing Lecture 10. OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1AwXHgF5e5sVSNisou0IGo2qLbbwGNXg2/view?usp=sharing Lecture 11. sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1LCqYrxz2SqCf1GiuYgg3-ikC0G1M2Jxe/view?usp=sharing Lecture 12. data structures] &amp;lt;br&amp;gt;&lt;br /&gt;
lecture 13. Python for data analysis&lt;br /&gt;
[https://drive.google.com/file/d/1Qg4cVjl30WMIo_tWb0CfS2wEHYu1Qi9W/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/13mfZo-A2up30mA_2tWorWi24n9D2eqzR/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/1wE97tvUP028ihUsRu_Z9jMEe6VntaUT_/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
Workshop 3_Number systems [https://drive.google.com/file/d/1C-rojoAQW_QV_-81-74p_d6DBmgqPymd/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 4_real_strings [https://drive.google.com/file/d/1fNCkIOoENkp1V_gleuECYHTWtbww0ulL/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 5_strings [https://colab.research.google.com/drive/1MYGUntyiofnSQfYfoUjzZOpIIxJvm0m9?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 6_strings [https://drive.google.com/file/d/1nzkxOUlWYS4kcXMNsqRFQGnMnuLA3Dlg/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 7_lists_tuples [https://drive.google.com/file/d/1Kb4owufwUJe7wE7LsURjWz4ozogUt2rr/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 8 Tasks on lists &amp;amp; tuples [https://drive.google.com/file/d/19YCydAOdpS6A0D2Vxnt0xrLdAaFW6h38/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 9 Functions &amp;amp; Recursion [https://drive.google.com/file/d/1WqT_9dG_eKy9cCTGa3JGraxHmY6ZFfeT/view?usp=sharing]&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 10 Some more tasks on Functions [https://drive.google.com/file/d/1YIsfHECedyz0GbXQ_8EBgHxv2P6THcZS/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 11 Sets_Dictionaries [https://drive.google.com/file/d/1j-JVnvVbc5XTVkGXUUGU6eDC-HyWVvgd/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 12 Tasks on sets and dictionaries [https://drive.google.com/file/d/1Lb5hJfWVnLSWCHZIwsS_Eyz_Lfi_MrIJ/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 13 Files_Exceptions_Errors [https://drive.google.com/file/d/1_H2gS4eb8qBY8YhOfReDyxdIwAW6ORhl/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 14 Code Style and Code Reading [https://colab.research.google.com/drive/1vAJOxzd_Cx5vOBdAWpc09JREwuBR6Fsy?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 15 Iterators and Generators [https://colab.research.google.com/drive/1IQqvUN8Z_JZx6h3mSuKPdGDs7PlpGoZ2?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 16 Functional Tasks [https://colab.research.google.com/drive/1KFzewIimC5vgRuUp40Rff_bJ7xRi7KNJ?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 17 OOP [https://drive.google.com/file/d/1YNC2BZGeVqqr1qtS3VbPgPM1Ll6l4kZQ/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 18 OOP_tasks [https://drive.google.com/file/d/19-gydKAoLAC_ionH1sX8Gtx1uNiKoVC_/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 19 Sorting and Searching [https://drive.google.com/file/d/1AvodtjocnBPjC1VywUr4FCEm6E7hdMbh/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 21 Data Structure [https://colab.research.google.com/drive/1p_o773MDJmvdWdsfMS5n2kClsPymixy1?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 22 Graph [https://colab.research.google.com/drive/1E9KhZWZj3V-OEkA0R1ckkauWhqrDKIrV?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop notes as PDF: [https://drive.google.com/drive/folders/117VF9KbFlYvEm4byWIwiadKxUdHMTvbE?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 23. Github. Numpy. Pandas [https://colab.research.google.com/drive/1ySQPzfsEAVEuDo6TEOjBN0Yx16Gw33WX?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/17Zq9XplOPss1j9ZoPX2JHm8ms95-F_LT/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/1T8LKnq_o4EO_KQRNl1IvcFZbmxlDSO8a/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &lt;br /&gt;
=== Contests ===&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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] || 21 Sep 2020, 23:59:59&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19792/problems/ Contest 2] || 28 Sep 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19938/problems/ Contest 3] || 5 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20240/problems/ Contest 4] || 19 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20721/problems/ Contest 5] || 26 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20933/problems/ Contest 6] || 26 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/21580/problems/ Contest 7] || 9 Nov 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/21882/problems/ Contest 8] || 16 Nov 2020, 23:59:59&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/22329/problems/ Contest 9] || 30 Nov 2020, 23:59:59&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results === &lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1DcXLGIRQ4LJCkEY_Fy_WS1JKkxGQoe15YnIbu4MrMdY/edit?usp=sharing Table with results]&lt;br /&gt;
&lt;br /&gt;
== November 14 Test ==&lt;br /&gt;
== &#039;&#039;&#039;Retake will take place on Saturday, December 05 at 12.50 &#039;&#039;&#039;==&lt;br /&gt;
The rules are the same. Anyone who scored 20 points and below can go to retake. The maximum possible number of points on a retake - 30.&lt;br /&gt;
 &lt;br /&gt;
The link to zoom will be here. &lt;br /&gt;
&lt;br /&gt;
The link to the contest: https://official.contest.yandex.com/contest/23369/enter. &lt;br /&gt;
&lt;br /&gt;
After the test submit the recording to this form within 30 minutes: https://forms.gle/1iuypcJjqzLkxUB5A&lt;br /&gt;
&lt;br /&gt;
If you are unable to submit the recording in 30 minutes, send the size of your video file using the same form. Later, when you are able to submit the recording, do it using the same form.&lt;br /&gt;
======Before the Test======&lt;br /&gt;
The test will be held using asynchronous proctoring on &#039;&#039;&#039;November 14, 2020 at 13:00.&#039;&#039;&#039;&lt;br /&gt;
Here is &#039;&#039;&#039;the zoom link&#039;&#039;&#039;: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/97320428256&lt;br /&gt;
Meeting ID: 973 2042 8256&lt;br /&gt;
Passcode: 645654&lt;br /&gt;
&lt;br /&gt;
This conference will be used for the final briefing and to communicate with teachers during the test if necessary. You can message them in the conference chat.&lt;br /&gt;
Each student must record the process of completing the assignments using OBS Studio, upload the result to the cloud storage immediately after the quiz and provide a link to the recording.&lt;br /&gt;
&#039;&#039;&#039;Link to the contest (will be duplicated in the zoom chat): &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
https://official.contest.yandex.com/contest/22472/enter&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their TA. They will write a supervised test at zoom and should be prepared to further defend their decisions at: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/99097338323?pwd=dk5obm92d3NTajlCcUh2ZXV0dElWUT09&lt;br /&gt;
Conference ID: 990 9733 8323&lt;br /&gt;
Password: 195557&lt;br /&gt;
&lt;br /&gt;
You will need a computer with a webcam and microphone (the majority of modern laptops have them) and Internet access.&amp;lt;br /&amp;gt;&lt;br /&gt;
You need to install OBS Studio using the link https://obsproject.com/ru &amp;lt;br /&amp;gt;&lt;br /&gt;
You need to record the microphone and webcam input as well as your screen. See instructions in the video: https://www.youtube.com/watch?v=KVKrvPvPLYg &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;You can use:&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
* The testing system site (https://contest.yandex.com/) and your solutions of past contests in it. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Development environments (installed on a computer ONLY, web IDEs are not allowed) &amp;lt;br /&amp;gt;&lt;br /&gt;
* Materials posted on this page &amp;lt;br /&amp;gt;&lt;br /&gt;
* Python documentation at https://docs.python.org/ &amp;lt;br /&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;It is prohibited to communicate with other people. Please warn the people around you about this in advance.&#039;&#039;&#039; &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====== Actions you must complete before the test:======&lt;br /&gt;
* Disable all messengers in advance and close all unnecessary tabs. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Physically disconnect and remove any electronic devices and additional monitors from the workplace. &amp;lt;br /&amp;gt;&lt;br /&gt;
* You will not be able to leave your workplace for 1 hour 30 minutes, be ready for that. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Enable recording from three sources: screen, webcam and microphone in OBS Studio. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Record your workplace from and its surroundings on video. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Show the camera the blank pages you plan to use as drafts. &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
======During the Test======&lt;br /&gt;
On November 14, 2020 at 13.00 enter the zoom using the link that will appear here, higher on this page and in the Telegram chat. Please disable Telegram after receiving the link. We will provide a general briefing. This Zoom conference will be used as a chat to communicate with teachers during the test, if necessary. &amp;lt;br /&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;Please start recording before you start the test! Students who started recording too late will be disqualified.&#039;&#039;&#039; At 13:15 a contest consisting of 5 problems opens (10 points per problem). The contest closes at 14:45.&amp;lt;br /&amp;gt;&lt;br /&gt;
When the test is over, you will have &#039;&#039;&#039;half an hour to upload the recorded video&#039;&#039;&#039;. Only the teachers and assistants will view your videos.&amp;lt;br /&amp;gt;&lt;br /&gt;
Please &#039;&#039;&#039;check that you have learned how to record video in the required format&#039;&#039;&#039; in advance as this can sometimes be problematic. All solutions to problems with recording in OBS Studio can be found online.&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
======Procedure during the test:======&lt;br /&gt;
* You should ask any questions via the testing system or via chat in zoom.&amp;lt;br /&amp;gt;&lt;br /&gt;
* If you are working with a paper draft, aim the camera so that your hands are visible. Remember to point your webcam at your face when you return to work at your screen.&amp;lt;br /&amp;gt;&lt;br /&gt;
* You can receive important announcements from instructors through the testing system. Notifications appear in the upper right corner of the testing system interface.&amp;lt;br /&amp;gt;&lt;br /&gt;
* If you want to complete the test ahead of time, message the teacher or a TA using the questions interface in the testing system and complete all the actions that you must perform after the end of the test. &lt;br /&gt;
* If you try to return to the test after sending this message, you will be disqualified.&amp;lt;br /&amp;gt;&lt;br /&gt;
* Wearing headphones is prohibited. &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====== After finishing the test: ======&lt;br /&gt;
Within 30 minutes, you must post the video that you recorded during the test in the public domain and submit a link to it in this form: https://forms.gle/ZtzU9QGhZ8gbFpyq7&lt;br /&gt;
&lt;br /&gt;
Don&#039;t forget to upload a copy of your document (passport or student ID)&lt;br /&gt;
&lt;br /&gt;
Good luck!&lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
Link TBD&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_programming_DSBA_2020/2021&amp;diff=48173</id>
		<title>Introduction to programming DSBA 2020/2021</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_programming_DSBA_2020/2021&amp;diff=48173"/>
		<updated>2020-12-04T18:57:02Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Retake will take place on Saturday, December 05 at 12.50  */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&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 !! 201 !! 202 !! 203 !! 204&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 201 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
201 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &lt;br /&gt;
|| 202 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
202 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 203 - 1: Chuvilina A.A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru] , tg: [https://tlgg.ru/chuvilinaann @chuvilinaann] &amp;lt;br&amp;gt;&lt;br /&gt;
203 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|| &lt;br /&gt;
Sysoev M. V. &amp;lt;br&amp;gt; [mailto:sysoevmark@gmail.com sysoevmark@gmail.com], tg: [https://tlgg.ru/BartolomeuD @BartolomeuD]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Diana K., tg: [https://tlgg.ru/shadowcure @shadowcure]&lt;br /&gt;
|| Rustam K., tg: [https://tlgg.ru/dergalaktischekaiser @dergalaktischekaiser]&lt;br /&gt;
|| Lily K., tg: [https://tlgg.ru/lily_kurchenko @lily_kurchenko]&lt;br /&gt;
|| Sergey G., tg: [https://tlgg.ru/SeregaEFD @SeregaEFD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Jingtao X., tg: [https://tlgg.ru/andy0814xu @andy0814xu]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1JJwc4CZMkgIbVFPxit5n5muA4_dEQMpV/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1zZhY-KiFpmdacKR8P0PqPmfuKZPHzMc8/view?usp=sharing Lecture 2. Numeral systems. Real numbers.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1K_h2xlPQ60PX-saYfgXH7bbTDQ1fqtOm/view?usp=sharing Lecture 3. Strings. The Zen of Python. PEP-8.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1BdCL1hjqH_E6EK8NebmnvH655SzqFyA4/view?usp=sharing Lecture 4. Lists&amp;amp;tuples] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/16QiYgf7jgy1Wuiilcs51fDOBDKGHMXZN/view?usp=sharing Lecture 5. Functions&amp;amp;recursion] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19Jos3bfDXAfpxucDsjmYAeEAAuobFxLv/view?usp=sharing Lecture 6. sets &amp;amp; dictionaries] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Q-0beUgk9fR83nkzqAlVfMxrKDfdGcZM/view?usp=sharing Lecture 8. files. exceptions &amp;amp; errors] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1gq5NqV2LmpQU2W1Wj5HQJkuxDC_Q_kxD/view?usp=sharing Lecture 9. functional]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1i8arJc58cSSYE0WIzsnLBKC-IHVgakxb/view?usp=sharing Lecture 10. OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1AwXHgF5e5sVSNisou0IGo2qLbbwGNXg2/view?usp=sharing Lecture 11. sort &amp;amp; search] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1LCqYrxz2SqCf1GiuYgg3-ikC0G1M2Jxe/view?usp=sharing Lecture 12. data structures] &amp;lt;br&amp;gt;&lt;br /&gt;
lecture 13. Python for data analysis&lt;br /&gt;
[https://drive.google.com/file/d/1Qg4cVjl30WMIo_tWb0CfS2wEHYu1Qi9W/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/13mfZo-A2up30mA_2tWorWi24n9D2eqzR/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/1wE97tvUP028ihUsRu_Z9jMEe6VntaUT_/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
Workshop 3_Number systems [https://drive.google.com/file/d/1C-rojoAQW_QV_-81-74p_d6DBmgqPymd/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 4_real_strings [https://drive.google.com/file/d/1fNCkIOoENkp1V_gleuECYHTWtbww0ulL/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 5_strings [https://colab.research.google.com/drive/1MYGUntyiofnSQfYfoUjzZOpIIxJvm0m9?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 6_strings [https://drive.google.com/file/d/1nzkxOUlWYS4kcXMNsqRFQGnMnuLA3Dlg/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 7_lists_tuples [https://drive.google.com/file/d/1Kb4owufwUJe7wE7LsURjWz4ozogUt2rr/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 8 Tasks on lists &amp;amp; tuples [https://drive.google.com/file/d/19YCydAOdpS6A0D2Vxnt0xrLdAaFW6h38/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 9 Functions &amp;amp; Recursion [https://drive.google.com/file/d/1WqT_9dG_eKy9cCTGa3JGraxHmY6ZFfeT/view?usp=sharing]&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 10 Some more tasks on Functions [https://drive.google.com/file/d/1YIsfHECedyz0GbXQ_8EBgHxv2P6THcZS/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 11 Sets_Dictionaries [https://drive.google.com/file/d/1j-JVnvVbc5XTVkGXUUGU6eDC-HyWVvgd/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 12 Tasks on sets and dictionaries [https://drive.google.com/file/d/1Lb5hJfWVnLSWCHZIwsS_Eyz_Lfi_MrIJ/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 13 Files_Exceptions_Errors [https://drive.google.com/file/d/1_H2gS4eb8qBY8YhOfReDyxdIwAW6ORhl/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 14 Code Style and Code Reading [https://colab.research.google.com/drive/1vAJOxzd_Cx5vOBdAWpc09JREwuBR6Fsy?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 15 Iterators and Generators [https://colab.research.google.com/drive/1IQqvUN8Z_JZx6h3mSuKPdGDs7PlpGoZ2?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 16 Functional Tasks [https://colab.research.google.com/drive/1KFzewIimC5vgRuUp40Rff_bJ7xRi7KNJ?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 17 OOP [https://drive.google.com/file/d/1YNC2BZGeVqqr1qtS3VbPgPM1Ll6l4kZQ/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 18 OOP_tasks [https://drive.google.com/file/d/19-gydKAoLAC_ionH1sX8Gtx1uNiKoVC_/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 19 Sorting and Searching [https://drive.google.com/file/d/1AvodtjocnBPjC1VywUr4FCEm6E7hdMbh/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 21 Data Structure [https://colab.research.google.com/drive/1p_o773MDJmvdWdsfMS5n2kClsPymixy1?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 22 Graph [https://colab.research.google.com/drive/1E9KhZWZj3V-OEkA0R1ckkauWhqrDKIrV?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop notes as PDF: [https://drive.google.com/drive/folders/117VF9KbFlYvEm4byWIwiadKxUdHMTvbE?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 23. Github. Numpy. Pandas [https://colab.research.google.com/drive/1ySQPzfsEAVEuDo6TEOjBN0Yx16Gw33WX?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/17Zq9XplOPss1j9ZoPX2JHm8ms95-F_LT/view?usp=sharing]&lt;br /&gt;
[https://drive.google.com/file/d/1T8LKnq_o4EO_KQRNl1IvcFZbmxlDSO8a/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &lt;br /&gt;
=== Contests ===&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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] || 21 Sep 2020, 23:59:59&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19792/problems/ Contest 2] || 28 Sep 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19938/problems/ Contest 3] || 5 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20240/problems/ Contest 4] || 19 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20721/problems/ Contest 5] || 26 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20933/problems/ Contest 6] || 26 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/21580/problems/ Contest 7] || 9 Nov 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/21882/problems/ Contest 8] || 16 Nov 2020, 23:59:59&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/22329/problems/ Contest 9] || 30 Nov 2020, 23:59:59&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results === &lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1DcXLGIRQ4LJCkEY_Fy_WS1JKkxGQoe15YnIbu4MrMdY/edit?usp=sharing Table with results]&lt;br /&gt;
&lt;br /&gt;
== November 14 Test ==&lt;br /&gt;
== &#039;&#039;&#039;Retake will take place on Saturday, December 05 at 12.50 &#039;&#039;&#039;==&lt;br /&gt;
The rules are the same. Anyone who scored 20 points and below can go to retake. The maximum possible number of points on a retake - 30.&lt;br /&gt;
 &lt;br /&gt;
The link to zoom will be here. &lt;br /&gt;
&lt;br /&gt;
The link to the contest will be here. &lt;br /&gt;
&lt;br /&gt;
After the test submit the recording to this form within 30 minutes: https://forms.gle/1iuypcJjqzLkxUB5A&lt;br /&gt;
&lt;br /&gt;
If you are unable to submit the recording in 30 minutes, send the size of your video file using the same form. Later, when you are able to submit the recording, do it using the same form.&lt;br /&gt;
======Before the Test======&lt;br /&gt;
The test will be held using asynchronous proctoring on &#039;&#039;&#039;November 14, 2020 at 13:00.&#039;&#039;&#039;&lt;br /&gt;
Here is &#039;&#039;&#039;the zoom link&#039;&#039;&#039;: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/97320428256&lt;br /&gt;
Meeting ID: 973 2042 8256&lt;br /&gt;
Passcode: 645654&lt;br /&gt;
&lt;br /&gt;
This conference will be used for the final briefing and to communicate with teachers during the test if necessary. You can message them in the conference chat.&lt;br /&gt;
Each student must record the process of completing the assignments using OBS Studio, upload the result to the cloud storage immediately after the quiz and provide a link to the recording.&lt;br /&gt;
&#039;&#039;&#039;Link to the contest (will be duplicated in the zoom chat): &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
https://official.contest.yandex.com/contest/22472/enter&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their TA. They will write a supervised test at zoom and should be prepared to further defend their decisions at: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/99097338323?pwd=dk5obm92d3NTajlCcUh2ZXV0dElWUT09&lt;br /&gt;
Conference ID: 990 9733 8323&lt;br /&gt;
Password: 195557&lt;br /&gt;
&lt;br /&gt;
You will need a computer with a webcam and microphone (the majority of modern laptops have them) and Internet access.&amp;lt;br /&amp;gt;&lt;br /&gt;
You need to install OBS Studio using the link https://obsproject.com/ru &amp;lt;br /&amp;gt;&lt;br /&gt;
You need to record the microphone and webcam input as well as your screen. See instructions in the video: https://www.youtube.com/watch?v=KVKrvPvPLYg &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;You can use:&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
* The testing system site (https://contest.yandex.com/) and your solutions of past contests in it. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Development environments (installed on a computer ONLY, web IDEs are not allowed) &amp;lt;br /&amp;gt;&lt;br /&gt;
* Materials posted on this page &amp;lt;br /&amp;gt;&lt;br /&gt;
* Python documentation at https://docs.python.org/ &amp;lt;br /&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;It is prohibited to communicate with other people. Please warn the people around you about this in advance.&#039;&#039;&#039; &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====== Actions you must complete before the test:======&lt;br /&gt;
* Disable all messengers in advance and close all unnecessary tabs. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Physically disconnect and remove any electronic devices and additional monitors from the workplace. &amp;lt;br /&amp;gt;&lt;br /&gt;
* You will not be able to leave your workplace for 1 hour 30 minutes, be ready for that. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Enable recording from three sources: screen, webcam and microphone in OBS Studio. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Record your workplace from and its surroundings on video. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Show the camera the blank pages you plan to use as drafts. &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
======During the Test======&lt;br /&gt;
On November 14, 2020 at 13.00 enter the zoom using the link that will appear here, higher on this page and in the Telegram chat. Please disable Telegram after receiving the link. We will provide a general briefing. This Zoom conference will be used as a chat to communicate with teachers during the test, if necessary. &amp;lt;br /&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;Please start recording before you start the test! Students who started recording too late will be disqualified.&#039;&#039;&#039; At 13:15 a contest consisting of 5 problems opens (10 points per problem). The contest closes at 14:45.&amp;lt;br /&amp;gt;&lt;br /&gt;
When the test is over, you will have &#039;&#039;&#039;half an hour to upload the recorded video&#039;&#039;&#039;. Only the teachers and assistants will view your videos.&amp;lt;br /&amp;gt;&lt;br /&gt;
Please &#039;&#039;&#039;check that you have learned how to record video in the required format&#039;&#039;&#039; in advance as this can sometimes be problematic. All solutions to problems with recording in OBS Studio can be found online.&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
======Procedure during the test:======&lt;br /&gt;
* You should ask any questions via the testing system or via chat in zoom.&amp;lt;br /&amp;gt;&lt;br /&gt;
* If you are working with a paper draft, aim the camera so that your hands are visible. Remember to point your webcam at your face when you return to work at your screen.&amp;lt;br /&amp;gt;&lt;br /&gt;
* You can receive important announcements from instructors through the testing system. Notifications appear in the upper right corner of the testing system interface.&amp;lt;br /&amp;gt;&lt;br /&gt;
* If you want to complete the test ahead of time, message the teacher or a TA using the questions interface in the testing system and complete all the actions that you must perform after the end of the test. &lt;br /&gt;
* If you try to return to the test after sending this message, you will be disqualified.&amp;lt;br /&amp;gt;&lt;br /&gt;
* Wearing headphones is prohibited. &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====== After finishing the test: ======&lt;br /&gt;
Within 30 minutes, you must post the video that you recorded during the test in the public domain and submit a link to it in this form: https://forms.gle/ZtzU9QGhZ8gbFpyq7&lt;br /&gt;
&lt;br /&gt;
Don&#039;t forget to upload a copy of your document (passport or student ID)&lt;br /&gt;
&lt;br /&gt;
Good luck!&lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
Link TBD&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_programming_DSBA_2020/2021&amp;diff=47609</id>
		<title>Introduction to programming DSBA 2020/2021</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_programming_DSBA_2020/2021&amp;diff=47609"/>
		<updated>2020-11-22T08:31:05Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Contests */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&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 !! 201 !! 202 !! 203 !! 204&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 201 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
201 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &lt;br /&gt;
|| 202 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
202 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 203 - 1: Chuvilina A.A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru] , tg: [https://tlgg.ru/chuvilinaann @chuvilinaann] &amp;lt;br&amp;gt;&lt;br /&gt;
203 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|| &lt;br /&gt;
Sysoev M. V. &amp;lt;br&amp;gt; [mailto:sysoevmark@gmail.com sysoevmark@gmail.com], tg: [https://tlgg.ru/BartolomeuD @BartolomeuD]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Diana K., tg: [https://tlgg.ru/shadowcure @shadowcure]&lt;br /&gt;
|| Rustam K., tg: [https://tlgg.ru/dergalaktischekaiser @dergalaktischekaiser]&lt;br /&gt;
|| Lily K., tg: [https://tlgg.ru/lily_kurchenko @lily_kurchenko]&lt;br /&gt;
|| Sergey G., tg: [https://tlgg.ru/SeregaEFD @SeregaEFD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Jingtao X., tg: [https://tlgg.ru/andy0814xu @andy0814xu]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1JJwc4CZMkgIbVFPxit5n5muA4_dEQMpV/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1zZhY-KiFpmdacKR8P0PqPmfuKZPHzMc8/view?usp=sharing Lecture 2. Numeral systems. Real numbers.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1K_h2xlPQ60PX-saYfgXH7bbTDQ1fqtOm/view?usp=sharing Lecture 3. Strings. The Zen of Python. PEP-8.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1BdCL1hjqH_E6EK8NebmnvH655SzqFyA4/view?usp=sharing Lecture 4. Lists&amp;amp;tuples] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/16QiYgf7jgy1Wuiilcs51fDOBDKGHMXZN/view?usp=sharing Lecture 5. Functions&amp;amp;recursion] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19Jos3bfDXAfpxucDsjmYAeEAAuobFxLv/view?usp=sharing Lecture 6. sets &amp;amp; dictionaries] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Q-0beUgk9fR83nkzqAlVfMxrKDfdGcZM/view?usp=sharing Lecture 8. files. exceptions &amp;amp; errors] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1gq5NqV2LmpQU2W1Wj5HQJkuxDC_Q_kxD/view?usp=sharing Lecture 9. functional]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1i8arJc58cSSYE0WIzsnLBKC-IHVgakxb/view?usp=sharing Lecture 10. OOP] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1AwXHgF5e5sVSNisou0IGo2qLbbwGNXg2/view?usp=sharing Lecture 11. sort &amp;amp; search]&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
Workshop 3_Number systems [https://drive.google.com/file/d/1C-rojoAQW_QV_-81-74p_d6DBmgqPymd/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 4_real_strings [https://drive.google.com/file/d/1fNCkIOoENkp1V_gleuECYHTWtbww0ulL/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 5_strings [https://colab.research.google.com/drive/1MYGUntyiofnSQfYfoUjzZOpIIxJvm0m9?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 6_strings [https://drive.google.com/file/d/1nzkxOUlWYS4kcXMNsqRFQGnMnuLA3Dlg/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 7_lists_tuples [https://drive.google.com/file/d/1Kb4owufwUJe7wE7LsURjWz4ozogUt2rr/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 8 Tasks on lists &amp;amp; tuples [https://drive.google.com/file/d/19YCydAOdpS6A0D2Vxnt0xrLdAaFW6h38/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 9 Functions &amp;amp; Recursion [https://drive.google.com/file/d/1WqT_9dG_eKy9cCTGa3JGraxHmY6ZFfeT/view?usp=sharing]&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 10 Some more tasks on Functions [https://drive.google.com/file/d/1YIsfHECedyz0GbXQ_8EBgHxv2P6THcZS/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 11 Sets_Dictionaries [https://drive.google.com/file/d/1j-JVnvVbc5XTVkGXUUGU6eDC-HyWVvgd/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 12 Tasks on sets and dictionaries [https://drive.google.com/file/d/1Lb5hJfWVnLSWCHZIwsS_Eyz_Lfi_MrIJ/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 13 Files_Exceptions_Errors [https://drive.google.com/file/d/1_H2gS4eb8qBY8YhOfReDyxdIwAW6ORhl/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 14 Code Style and Code Reading [https://colab.research.google.com/drive/1vAJOxzd_Cx5vOBdAWpc09JREwuBR6Fsy?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 15 Iterators and Generators [https://colab.research.google.com/drive/1IQqvUN8Z_JZx6h3mSuKPdGDs7PlpGoZ2?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 16 Functional Tasks [https://colab.research.google.com/drive/1KFzewIimC5vgRuUp40Rff_bJ7xRi7KNJ?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 17 OOP [https://drive.google.com/file/d/1YNC2BZGeVqqr1qtS3VbPgPM1Ll6l4kZQ/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 18 OOP_tasks [https://drive.google.com/file/d/19-gydKAoLAC_ionH1sX8Gtx1uNiKoVC_/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 19 Sorting and Searching [https://drive.google.com/file/d/1AvodtjocnBPjC1VywUr4FCEm6E7hdMbh/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Workshop notes as PDF: [https://drive.google.com/drive/folders/117VF9KbFlYvEm4byWIwiadKxUdHMTvbE?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &lt;br /&gt;
=== Contests ===&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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] || 21 Sep 2020, 23:59:59&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19792/problems/ Contest 2] || 28 Sep 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19938/problems/ Contest 3] || 5 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20240/problems/ Contest 4] || 19 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20721/problems/ Contest 5] || 26 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20933/problems/ Contest 6] || 26 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/21580/problems/ Contest 7] || 9 Nov 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/21882/problems/ Contest 8] || 16 Nov 2020, 23:59:59&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/22329/problems/ Contest 9] || 30 Nov 2020, 23:59:59&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results === &lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1DcXLGIRQ4LJCkEY_Fy_WS1JKkxGQoe15YnIbu4MrMdY/edit?usp=sharing Table with results]&lt;br /&gt;
&lt;br /&gt;
== November 14 Test ==&lt;br /&gt;
&lt;br /&gt;
======Before the Test======&lt;br /&gt;
The test will be held using asynchronous proctoring on &#039;&#039;&#039;November 14, 2020 at 13:00.&#039;&#039;&#039;&lt;br /&gt;
Here is &#039;&#039;&#039;the zoom link&#039;&#039;&#039;: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/97320428256&lt;br /&gt;
Meeting ID: 973 2042 8256&lt;br /&gt;
Passcode: 645654&lt;br /&gt;
&lt;br /&gt;
This conference will be used for the final briefing and to communicate with teachers during the test if necessary. You can message them in the conference chat.&lt;br /&gt;
Each student must record the process of completing the assignments using OBS Studio, upload the result to the cloud storage immediately after the quiz and provide a link to the recording.&lt;br /&gt;
&#039;&#039;&#039;Link to the contest (will be duplicated in the zoom chat): &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
https://official.contest.yandex.com/contest/22472/enter&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their TA. They will write a supervised test at zoom and should be prepared to further defend their decisions at: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/99097338323?pwd=dk5obm92d3NTajlCcUh2ZXV0dElWUT09&lt;br /&gt;
Conference ID: 990 9733 8323&lt;br /&gt;
Password: 195557&lt;br /&gt;
&lt;br /&gt;
You will need a computer with a webcam and microphone (the majority of modern laptops have them) and Internet access.&amp;lt;br /&amp;gt;&lt;br /&gt;
You need to install OBS Studio using the link https://obsproject.com/ru &amp;lt;br /&amp;gt;&lt;br /&gt;
You need to record the microphone and webcam input as well as your screen. See instructions in the video: https://www.youtube.com/watch?v=KVKrvPvPLYg &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;You can use:&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
* The testing system site (https://contest.yandex.com/) and your solutions of past contests in it. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Development environments (installed on a computer ONLY, web IDEs are not allowed) &amp;lt;br /&amp;gt;&lt;br /&gt;
* Materials posted on this page &amp;lt;br /&amp;gt;&lt;br /&gt;
* Python documentation at https://docs.python.org/ &amp;lt;br /&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;It is prohibited to communicate with other people. Please warn the people around you about this in advance.&#039;&#039;&#039; &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====== Actions you must complete before the test:======&lt;br /&gt;
* Disable all messengers in advance and close all unnecessary tabs. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Physically disconnect and remove any electronic devices and additional monitors from the workplace. &amp;lt;br /&amp;gt;&lt;br /&gt;
* You will not be able to leave your workplace for 1 hour 30 minutes, be ready for that. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Enable recording from three sources: screen, webcam and microphone in OBS Studio. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Record your workplace from and its surroundings on video. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Show the camera the blank pages you plan to use as drafts. &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
======During the Test======&lt;br /&gt;
On November 14, 2020 at 13.00 enter the zoom using the link that will appear here, higher on this page and in the Telegram chat. Please disable Telegram after receiving the link. We will provide a general briefing. This Zoom conference will be used as a chat to communicate with teachers during the test, if necessary. &amp;lt;br /&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;Please start recording before you start the test! Students who started recording too late will be disqualified.&#039;&#039;&#039; At 13:15 a contest consisting of 5 problems opens (10 points per problem). The contest closes at 14:45.&amp;lt;br /&amp;gt;&lt;br /&gt;
When the test is over, you will have &#039;&#039;&#039;half an hour to upload the recorded video&#039;&#039;&#039;. Only the teachers and assistants will view your videos.&amp;lt;br /&amp;gt;&lt;br /&gt;
Please &#039;&#039;&#039;check that you have learned how to record video in the required format&#039;&#039;&#039; in advance as this can sometimes be problematic. All solutions to problems with recording in OBS Studio can be found online.&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
======Procedure during the test:======&lt;br /&gt;
* You should ask any questions via the testing system or via chat in zoom.&amp;lt;br /&amp;gt;&lt;br /&gt;
* If you are working with a paper draft, aim the camera so that your hands are visible. Remember to point your webcam at your face when you return to work at your screen.&amp;lt;br /&amp;gt;&lt;br /&gt;
* You can receive important announcements from instructors through the testing system. Notifications appear in the upper right corner of the testing system interface.&amp;lt;br /&amp;gt;&lt;br /&gt;
* If you want to complete the test ahead of time, message the teacher or a TA using the questions interface in the testing system and complete all the actions that you must perform after the end of the test. &lt;br /&gt;
* If you try to return to the test after sending this message, you will be disqualified.&amp;lt;br /&amp;gt;&lt;br /&gt;
* Wearing headphones is prohibited. &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====== After finishing the test: ======&lt;br /&gt;
Within 30 minutes, you must post the video that you recorded during the test in the public domain and submit a link to it in this form: https://forms.gle/ZtzU9QGhZ8gbFpyq7&lt;br /&gt;
&lt;br /&gt;
Don&#039;t forget to upload a copy of your document (passport or student ID)&lt;br /&gt;
&lt;br /&gt;
Good luck!&lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
Link TBD&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Introduction_to_programming_DSBA_2020/2021&amp;diff=47274</id>
		<title>Introduction to programming DSBA 2020/2021</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Introduction_to_programming_DSBA_2020/2021&amp;diff=47274"/>
		<updated>2020-11-14T10:28:19Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: Workshop notes as pdf&lt;/p&gt;
&lt;hr /&gt;
&lt;div&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 !! 201 !! 202 !! 203 !! 204&lt;br /&gt;
|-&lt;br /&gt;
|| Lecturer &lt;br /&gt;
| colspan=&amp;quot;5&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;
|| 201 - 1: Piatskii G.G. &amp;lt;br&amp;gt; [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru], tg: [https://tlgg.ru/p_george @p_george] &amp;lt;br&amp;gt;&lt;br /&gt;
201 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku] &lt;br /&gt;
|| 202 - 1: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD] &amp;lt;br&amp;gt;&lt;br /&gt;
202 - 2: Zhulikov G. &amp;lt;br&amp;gt; [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]&lt;br /&gt;
|| 203 - 1: Chuvilina A.A. &amp;lt;br&amp;gt; [mailto:chuvilinaann@list.ru chuvilinaann@list.ru] , tg: [https://tlgg.ru/chuvilinaann @chuvilinaann] &amp;lt;br&amp;gt;&lt;br /&gt;
203 - 2: Rudakov K.A. &amp;lt;br&amp;gt; [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]&lt;br /&gt;
|| &lt;br /&gt;
Sysoev M. V. &amp;lt;br&amp;gt; [mailto:sysoevmark@gmail.com sysoevmark@gmail.com], tg: [https://tlgg.ru/BartolomeuD @BartolomeuD]&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;4&amp;quot; | Assistant &lt;br /&gt;
|| Diana K., tg: [https://tlgg.ru/shadowcure @shadowcure]&lt;br /&gt;
|| Rustam K., tg: [https://tlgg.ru/dergalaktischekaiser @dergalaktischekaiser]&lt;br /&gt;
|| Lily K., tg: [https://tlgg.ru/lily_kurchenko @lily_kurchenko]&lt;br /&gt;
|| Sergey G., tg: [https://tlgg.ru/SeregaEFD @SeregaEFD]&lt;br /&gt;
|-&lt;br /&gt;
| colspan=&amp;quot;4&amp;quot; | Jingtao X., tg: [https://tlgg.ru/andy0814xu @andy0814xu]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Grading system ==&lt;br /&gt;
The ultimate grade G for the whole course is calculated as: &#039;&#039;&#039;G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)&#039;&#039;&#039; where P1 is a first part final grade, and P2 is a second part final grade. Grade G is rounded (up or down) to an integer number of points before entering them into records. P1 and P2 are also rounded. &amp;lt;br&amp;gt;&lt;br /&gt;
The final grade P1 for the first part is calculated as follows: &#039;&#039;&#039;P1 = 0.4 · E1 + 0.6 · OA1&#039;&#039;&#039; where E1 is a grade of the first part exam, which takes place at the end of the quartile 1 (semester A), OA1 is an ongoing assessment grade of the first part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities. &amp;lt;br&amp;gt;&lt;br /&gt;
The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity. Every activity is evaluated and grants some points to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during a module. At the end of the module OA is calculated according to the following formula: &#039;&#039;&#039;OA = min([10 · (RP + BP) / RPmax ], 10)&#039;&#039;&#039; where, RPmax denotes the maximum possible number of points that can be taken during the module. &amp;lt;br&amp;gt;&lt;br /&gt;
Regular points are granted for contests (1 per task) and quizzes conducted at the lectures (1 per quiz). Bonus points can be granted for activity at almost all workshops and working at the whiteboard at the workshops (the amount of points for such activities are determined by workshop instructors). Non-pilot groups can also earn bonus points by completing extra homework (tasks in the contests marked with * and **), in this case 1 bonus point is granted for every task completed. The amount of bonus points that can be gained during the semester cannot exceed 50 points.&lt;br /&gt;
&lt;br /&gt;
== Lecture notes ==&lt;br /&gt;
[https://drive.google.com/file/d/1JJwc4CZMkgIbVFPxit5n5muA4_dEQMpV/view?usp=sharing Lecture 1. Introduction] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1zZhY-KiFpmdacKR8P0PqPmfuKZPHzMc8/view?usp=sharing Lecture 2. Numeral systems. Real numbers.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1K_h2xlPQ60PX-saYfgXH7bbTDQ1fqtOm/view?usp=sharing Lecture 3. Strings. The Zen of Python. PEP-8.] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1BdCL1hjqH_E6EK8NebmnvH655SzqFyA4/view?usp=sharing Lecture 4. Lists&amp;amp;tuples] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/16QiYgf7jgy1Wuiilcs51fDOBDKGHMXZN/view?usp=sharing Lecture 5. Functions&amp;amp;recursion] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/19Jos3bfDXAfpxucDsjmYAeEAAuobFxLv/view?usp=sharing Lecture 6. sets &amp;amp; dictionaries] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1Q-0beUgk9fR83nkzqAlVfMxrKDfdGcZM/view?usp=sharing Lecture 8. files. exceptions &amp;amp; errors] &amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1gq5NqV2LmpQU2W1Wj5HQJkuxDC_Q_kxD/view?usp=sharing Lecture 9. functional]&amp;lt;br&amp;gt;&lt;br /&gt;
[https://drive.google.com/file/d/1i8arJc58cSSYE0WIzsnLBKC-IHVgakxb/view?usp=sharing Lecture 10. OOP]&lt;br /&gt;
&lt;br /&gt;
== Workshop notes ==&lt;br /&gt;
Workshop 3_Number systems [https://drive.google.com/file/d/1C-rojoAQW_QV_-81-74p_d6DBmgqPymd/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 4_real_strings [https://drive.google.com/file/d/1fNCkIOoENkp1V_gleuECYHTWtbww0ulL/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 5_strings [https://colab.research.google.com/drive/1MYGUntyiofnSQfYfoUjzZOpIIxJvm0m9?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 6_strings [https://drive.google.com/file/d/1nzkxOUlWYS4kcXMNsqRFQGnMnuLA3Dlg/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 7_lists_tuples [https://drive.google.com/file/d/1Kb4owufwUJe7wE7LsURjWz4ozogUt2rr/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 8 Tasks on lists &amp;amp; tuples [https://drive.google.com/file/d/19YCydAOdpS6A0D2Vxnt0xrLdAaFW6h38/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 9 Functions &amp;amp; Recursion [https://drive.google.com/file/d/1WqT_9dG_eKy9cCTGa3JGraxHmY6ZFfeT/view?usp=sharing]&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 10 Some more tasks on Functions [https://drive.google.com/file/d/1YIsfHECedyz0GbXQ_8EBgHxv2P6THcZS/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 11 Sets_Dictionaries [https://drive.google.com/file/d/1j-JVnvVbc5XTVkGXUUGU6eDC-HyWVvgd/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 12 Tasks on sets and dictionaries [https://drive.google.com/file/d/1Lb5hJfWVnLSWCHZIwsS_Eyz_Lfi_MrIJ/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 13 Files_Exceptions_Errors [https://drive.google.com/file/d/1_H2gS4eb8qBY8YhOfReDyxdIwAW6ORhl/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 14 Code Style and Code Reading [https://colab.research.google.com/drive/1vAJOxzd_Cx5vOBdAWpc09JREwuBR6Fsy?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 15 Iterators and Generators [https://colab.research.google.com/drive/1IQqvUN8Z_JZx6h3mSuKPdGDs7PlpGoZ2?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 16 Functional Tasks [https://colab.research.google.com/drive/1KFzewIimC5vgRuUp40Rff_bJ7xRi7KNJ?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 17 OOP [https://drive.google.com/file/d/1YNC2BZGeVqqr1qtS3VbPgPM1Ll6l4kZQ/view?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
Workshop 18 OOP_tasks [https://drive.google.com/file/d/19-gydKAoLAC_ionH1sX8Gtx1uNiKoVC_/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
Workshop notes as PDF: [https://drive.google.com/drive/folders/117VF9KbFlYvEm4byWIwiadKxUdHMTvbE?usp=sharing] &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Homeworks == &lt;br /&gt;
=== Contests ===&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&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19657/problems/ Contest 1] || 21 Sep 2020, 23:59:59&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19792/problems/ Contest 2] || 28 Sep 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/19938/problems/ Contest 3] || 5 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20240/problems/ Contest 4] || 19 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20721/problems/ Contest 5] || 26 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/20933/problems/ Contest 6] || 26 Oct 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/21580/problems/ Contest 7] || 9 Nov 2020, 23:59:59&lt;br /&gt;
|- &lt;br /&gt;
|| [https://official.contest.yandex.com/contest/21882/problems/ Contest 8] || 16 Nov 2020, 23:59:59&lt;br /&gt;
|-&lt;br /&gt;
|| [https://official.contest.yandex.com/contest/22329/problems/ Contest 9] || 23 Nov 2020, 23:59:59&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Results === &lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1DcXLGIRQ4LJCkEY_Fy_WS1JKkxGQoe15YnIbu4MrMdY/edit?usp=sharing Table with results]&lt;br /&gt;
&lt;br /&gt;
== November 14 Test ==&lt;br /&gt;
&lt;br /&gt;
======Before the Test======&lt;br /&gt;
The test will be held using asynchronous proctoring on &#039;&#039;&#039;November 14, 2020 at 13:00.&#039;&#039;&#039;&lt;br /&gt;
Here is &#039;&#039;&#039;the zoom link&#039;&#039;&#039;: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/97320428256&lt;br /&gt;
Meeting ID: 973 2042 8256&lt;br /&gt;
Passcode: 645654&lt;br /&gt;
&lt;br /&gt;
This conference will be used for the final briefing and to communicate with teachers during the test if necessary. You can message them in the conference chat.&lt;br /&gt;
Each student must record the process of completing the assignments using OBS Studio, upload the result to the cloud storage immediately after the quiz and provide a link to the recording.&lt;br /&gt;
&#039;&#039;&#039;Link to the contest (will be duplicated in the zoom chat): &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
https://official.contest.yandex.com/contest/22472/enter&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Students who face any technical problems&#039;&#039;&#039; must alert their TA. They will write a supervised test at zoom and should be prepared to further defend their decisions at: &lt;br /&gt;
&lt;br /&gt;
https://zoom.us/j/99097338323?pwd=dk5obm92d3NTajlCcUh2ZXV0dElWUT09&lt;br /&gt;
Conference ID: 990 9733 8323&lt;br /&gt;
Password: 195557&lt;br /&gt;
&lt;br /&gt;
You will need a computer with a webcam and microphone (the majority of modern laptops have them) and Internet access.&amp;lt;br /&amp;gt;&lt;br /&gt;
You need to install OBS Studio using the link https://obsproject.com/ru &amp;lt;br /&amp;gt;&lt;br /&gt;
You need to record the microphone and webcam input as well as your screen. See instructions in the video: https://www.youtube.com/watch?v=KVKrvPvPLYg &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;You can use:&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
* The testing system site (https://contest.yandex.com/) and your solutions of past contests in it. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Development environments (installed on a computer ONLY, web IDEs are not allowed) &amp;lt;br /&amp;gt;&lt;br /&gt;
* Materials posted on this page &amp;lt;br /&amp;gt;&lt;br /&gt;
* Python documentation at https://docs.python.org/ &amp;lt;br /&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;It is prohibited to communicate with other people. Please warn the people around you about this in advance.&#039;&#039;&#039; &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====== Actions you must complete before the test:======&lt;br /&gt;
* Disable all messengers in advance and close all unnecessary tabs. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Physically disconnect and remove any electronic devices and additional monitors from the workplace. &amp;lt;br /&amp;gt;&lt;br /&gt;
* You will not be able to leave your workplace for 1 hour 30 minutes, be ready for that. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Enable recording from three sources: screen, webcam and microphone in OBS Studio. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Record your workplace from and its surroundings on video. &amp;lt;br /&amp;gt;&lt;br /&gt;
* Show the camera the blank pages you plan to use as drafts. &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
======During the Test======&lt;br /&gt;
On November 14, 2020 at 13.00 enter the zoom using the link that will appear here, higher on this page and in the Telegram chat. Please disable Telegram after receiving the link. We will provide a general briefing. This Zoom conference will be used as a chat to communicate with teachers during the test, if necessary. &amp;lt;br /&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;Please start recording before you start the test! Students who started recording too late will be disqualified.&#039;&#039;&#039; At 13:15 a contest consisting of 5 problems opens (10 points per problem). The contest closes at 14:45.&amp;lt;br /&amp;gt;&lt;br /&gt;
When the test is over, you will have &#039;&#039;&#039;half an hour to upload the recorded video&#039;&#039;&#039;. Only the teachers and assistants will view your videos.&amp;lt;br /&amp;gt;&lt;br /&gt;
Please &#039;&#039;&#039;check that you have learned how to record video in the required format&#039;&#039;&#039; in advance as this can sometimes be problematic. All solutions to problems with recording in OBS Studio can be found online.&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
======Procedure during the test:======&lt;br /&gt;
* You should ask any questions via the testing system or via chat in zoom.&amp;lt;br /&amp;gt;&lt;br /&gt;
* If you are working with a paper draft, aim the camera so that your hands are visible. Remember to point your webcam at your face when you return to work at your screen.&amp;lt;br /&amp;gt;&lt;br /&gt;
* You can receive important announcements from instructors through the testing system. Notifications appear in the upper right corner of the testing system interface.&amp;lt;br /&amp;gt;&lt;br /&gt;
* If you want to complete the test ahead of time, message the teacher or a TA using the questions interface in the testing system and complete all the actions that you must perform after the end of the test. &lt;br /&gt;
* If you try to return to the test after sending this message, you will be disqualified.&amp;lt;br /&amp;gt;&lt;br /&gt;
* Wearing headphones is prohibited. &amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
====== After finishing the test: ======&lt;br /&gt;
Within 30 minutes, you must post the video that you recorded during the test in the public domain and submit a link to it in this form: https://forms.gle/ZtzU9QGhZ8gbFpyq7&lt;br /&gt;
&lt;br /&gt;
Don&#039;t forget to upload a copy of your document (passport or student ID)&lt;br /&gt;
&lt;br /&gt;
Good luck!&lt;br /&gt;
&lt;br /&gt;
== Syllabus ==  &lt;br /&gt;
Link TBD&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%9F%D1%81%D0%B8%D1%85%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_1_%D0%BA%D1%83%D1%80%D1%81_2019/2020&amp;diff=41546</id>
		<title>Python для извлечения и обработки данных Психология 1 курс 2019/2020</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%9F%D1%81%D0%B8%D1%85%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_1_%D0%BA%D1%83%D1%80%D1%81_2019/2020&amp;diff=41546"/>
		<updated>2020-06-01T18:38:03Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: Добавил ссылку на домашнее задание&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== О курсе ==&lt;br /&gt;
&amp;quot;Python для извлечения и обработки данных&amp;quot; читается на 1 курсе, в 4 модуле.&lt;br /&gt;
&lt;br /&gt;
[https://www.hse.ru/edu/courses/292681829 Карточка курса и программа]&lt;br /&gt;
&lt;br /&gt;
===Преподаватели===&lt;br /&gt;
&#039;&#039;&#039;Группы 191, 192, 193, 194&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
Преподаватель: Каленкович Евгений Евгеньевич&amp;lt;br /&amp;gt;&lt;br /&gt;
E-mail: ekalenkovich@hse.ru&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Группы 195, 196, 197&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
Преподаватель: Жуликов Георгий Александрович&amp;lt;br /&amp;gt;&lt;br /&gt;
E-mail: l8doku@gmail.com&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @l8doku&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Ассистенты===&lt;br /&gt;
&lt;br /&gt;
Петров Тимур, группа 196&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @Palladain&lt;br /&gt;
&lt;br /&gt;
Масликов Егор, группы БПС193 - БПС194&amp;lt;br /&amp;gt;&lt;br /&gt;
VK: [https://vk.com/id90262659 Масликов Егор]&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/egorkapiorka @egorkapiorka]&lt;br /&gt;
&lt;br /&gt;
Котликова Анастасия, группы 191, 192&amp;lt;br /&amp;gt;&lt;br /&gt;
VK: [https://vk.com/steeeven Котликова Анастасия] &amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/steeeven @steeeven]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Участник:Markina Daria|Маркина Дарья]], группы 195 и 197&amp;lt;br /&amp;gt;&lt;br /&gt;
Vk: [https://vk.com/markina_dasha Маркина Дарья]&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/MarkinaDaria @MarkinaDaria]&lt;br /&gt;
&lt;br /&gt;
== Структура курса ==&lt;br /&gt;
&lt;br /&gt;
Рекомендуемая рабочая среда - Jupyter Notebook. Рекомендуемый способ установить Jupyter notebook - установить [https://www.anaconda.com/distribution/#download-section Anaconda].&lt;br /&gt;
&lt;br /&gt;
=== Семинары ===&lt;br /&gt;
Даты проведения семинаров:&lt;br /&gt;
&lt;br /&gt;
07.04 / 08.04&lt;br /&gt;
&lt;br /&gt;
14.04 / 15.04&lt;br /&gt;
&lt;br /&gt;
28.04 / 29.04&lt;br /&gt;
&lt;br /&gt;
19.05 / 20.05&lt;br /&gt;
&lt;br /&gt;
02.06 / 03.06&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Консультации ===&lt;br /&gt;
&lt;br /&gt;
==== С ассистентами ====&lt;br /&gt;
&lt;br /&gt;
О консультациях с ассистентнами нужно договориться с ними лично. Вы находите время, которое удобно и вам, и им - и связываетесь любым удобным вам способом.&lt;br /&gt;
&lt;br /&gt;
==== С преподавателями ====&lt;br /&gt;
&lt;br /&gt;
Формат: Zoom. &lt;br /&gt;
&lt;br /&gt;
Женя будет впускать по одному. Время на одного человека зависит от количества человек в очереди.&lt;br /&gt;
&lt;br /&gt;
Георгий будет проводить консультации открыто: любой может зайти и выйти в любое время.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Ссылки на Zoom будут присланы на корпоративную почту.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Расписание&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Консультация 1:&lt;br /&gt;
&lt;br /&gt;
11.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
Георгий: 13:40 - 15:00&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Консультация 2:&lt;br /&gt;
&lt;br /&gt;
18.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
Георгий: 13:40 - 15:00&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Консультация 2:&lt;br /&gt;
&lt;br /&gt;
25.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
Коснультации с Женей по субботам до конца модуля:&lt;br /&gt;
&lt;br /&gt;
12:45-14:25&lt;br /&gt;
&lt;br /&gt;
=== Онлайн-курс ===&lt;br /&gt;
&lt;br /&gt;
Онлайн-курс доступен [https://courses.openedu.ru/courses/course-v1:hse+PYTHON_HSE+special_2020/ на openedu]&lt;br /&gt;
&lt;br /&gt;
Дедлайны онлайн-курса&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;
| 1 неделя&lt;br /&gt;
| 12.04&lt;br /&gt;
|-&lt;br /&gt;
| 2 неделя &lt;br /&gt;
| 19.04&lt;br /&gt;
|-&lt;br /&gt;
| 3 неделя&lt;br /&gt;
| 26.04&lt;br /&gt;
|- &lt;br /&gt;
| 4 неделя&lt;br /&gt;
| 14.05&lt;br /&gt;
|- &lt;br /&gt;
| 5 неделя&lt;br /&gt;
| 28.05&lt;br /&gt;
|- &lt;br /&gt;
| 6 неделя&lt;br /&gt;
| 11.06&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Контрольные ===&lt;br /&gt;
&lt;br /&gt;
Теория: &#039;&#039;&#039;две&#039;&#039;&#039; контрольные в общее для всех время (тест в выбором ответа или свободным ответом) - КР1 и КР3&lt;br /&gt;
&lt;br /&gt;
Практика: &#039;&#039;&#039;две&#039;&#039;&#039; контрольные в общее для всех время (решение задач на программирование на время) - КР2 и КР4&lt;br /&gt;
&lt;br /&gt;
==== Контрольная 1 ====&lt;br /&gt;
&lt;br /&gt;
Результаты https://docs.google.com/spreadsheets/d/1mYFxQaa6hXSLpiE73BNUPHJ36gg4V0p43XV2X7yfyMM&lt;br /&gt;
&lt;br /&gt;
Недели курса:&lt;br /&gt;
1-3&lt;br /&gt;
&lt;br /&gt;
Когда:&lt;br /&gt;
6 мая в 15:10.&lt;br /&gt;
&lt;br /&gt;
Как будет проходить:&lt;br /&gt;
# вы выключаете все соц. сети, месенджеры и прочее на всех устройствах, выключаете телефон;&lt;br /&gt;
# вы подключаетесь по зуму, включаете камеру и демонстрацию экрана;&lt;br /&gt;
# мы присылаем ссылки на папку с заданиями на гугл-драйве и на гугл-форму для заполнения ответов;&lt;br /&gt;
# вы скачиваете вариант со своим именем (правая кнопка -&amp;gt; скачать), открываете файл с заданием в бразуре, по мере решения заполняете гугл-форму;&lt;br /&gt;
# через 40 минут + 5 минут на технические вопросы мы закрываем гугл-форму.&lt;br /&gt;
&lt;br /&gt;
Правила:&lt;br /&gt;
# камера и демонстрация экрана включены в течение всей контрольной;&lt;br /&gt;
# можно пользоваться гуглом;&lt;br /&gt;
# нельзя пользоваться соц. сетями и месенджерами (нельзя общаться ни с кем, кроме как с нами в чате зума);&lt;br /&gt;
# нельзя списывать (напоминаем про ответственность за нарушение академических норм);&lt;br /&gt;
# общение (см. п. 3) приравнивается к списыванию.&lt;br /&gt;
&lt;br /&gt;
Что делать, если у вас технические проблемы, из-за которых вы не можете включить камеру и демонстрацию экрана?&lt;br /&gt;
# Вы пишете письмо об этой проблеме в учебный офис, добавляя меня и Георгия в копию.&lt;br /&gt;
# Учебный офис устанавливает, уважительная ли у вас причина.&lt;br /&gt;
# Если причина уважительная, то дальше возможны варианты:&lt;br /&gt;
##   Мы решаем с вами и учебным офисом, как поступать дальше.&lt;br /&gt;
##   Мы разрешаем вам на первой контрольной (и только на ней, что делать с остальными напишем отдельно) ограничиться включенной камерой на любом устройстве.&lt;br /&gt;
# Если учебный офис не успеет ответить до контрольной (что вероятно) вы все равно можете авансом воспользоваться вариантом 3.2.&lt;br /&gt;
&lt;br /&gt;
==== Контрольная 2 ====&lt;br /&gt;
&lt;br /&gt;
Результаты: https://docs.google.com/spreadsheets/d/1Q-k8MOz6iMO180zg7rdHZQr87_O6CsIUYLRmfEMSTK0&lt;br /&gt;
&lt;br /&gt;
Недели курса:&lt;br /&gt;
1-3&lt;br /&gt;
&lt;br /&gt;
Когда:&lt;br /&gt;
8 мая в 15:10.&lt;br /&gt;
&lt;br /&gt;
Как будет проходить:&lt;br /&gt;
# вы выключаете все соц. сети, месенджеры и прочее на всех устройствах, выключаете телефон;&lt;br /&gt;
# вы подключаетесь по зуму, включаете камеру и демонстрацию экрана;&lt;br /&gt;
# мы присылаем ссылку на яндекс.контест, состоящий из 4 задач;&lt;br /&gt;
# через 1ч 20 минут + 5 минут запаса яндекс.контест завершается.&lt;br /&gt;
&lt;br /&gt;
Правила:&lt;br /&gt;
# камера и демонстрация экрана включены в течение всей контрольной;&lt;br /&gt;
# нельзя гуглить решения заданий (увидим - засчитываем как списывание);&lt;br /&gt;
# нельзя пользоваться соц. сетями и месенджерами (нельзя общаться ни с кем, кроме как с нами в чате зума);&lt;br /&gt;
# в остальном можно пользоваться интернетом;&lt;br /&gt;
# нельзя списывать (напоминаем про ответственность за нарушение академических норм);&lt;br /&gt;
# общение (см. п. 3) приравнивается к списыванию.&lt;br /&gt;
&lt;br /&gt;
Что делать, если у вас технические проблемы, из-за которых вы не можете включить камеру и демонстрацию экрана?&lt;br /&gt;
# Вы пишете письмо об этой проблеме в учебный офис, добавляя меня и Георгия в копию.&lt;br /&gt;
# Учебный офис устанавливает, уважительная ли у вас причина.&lt;br /&gt;
# Если причина уважительная, то дальше возможны варианты:&lt;br /&gt;
##  Мы решаем с вами и учебным офисом, как поступать дальше.&lt;br /&gt;
##  Мы разрешаем вам обойтись без зума, но вы должны обеспечить запись экрана и веб-камеры на локальный компьютер, которую вы выкладываете.&lt;br /&gt;
&lt;br /&gt;
==== FAQ ====&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;Можно ли использовать бумажные конспекты?&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
- Нет.&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;OpenEdu, фото конспектов, документацию питона?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
- Да.&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;Чем карается списывание и приравниваемые к нему действия?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
- Первый раз - 0 за контрольную + докладная в учебную часть. Второй раз - 0 за курс + докладная в учебную часть.&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;А как выйти из соцсетей на всех устройствах?```&lt;br /&gt;
&lt;br /&gt;
- Во всех соцсетях есть возможность выйти со всех устройств. В вк это &amp;quot;настройки -&amp;gt; безопасность -&amp;gt; завершить все сеансы&amp;quot;. В тг это &amp;quot;настройки -&amp;gt; активные сессии&amp;quot;, там нужно убивать по одной.&lt;br /&gt;
&lt;br /&gt;
=== Домашнее задание ===&lt;br /&gt;
&lt;br /&gt;
Детали доступны по ссылке https://colab.research.google.com/drive/1N2N03f2T7s46OZHe1dUaurzC726IvS0n&lt;br /&gt;
&lt;br /&gt;
Дедлайн - 15 июня 23:59:59&lt;br /&gt;
&lt;br /&gt;
== Формула оценки ==&lt;br /&gt;
&lt;br /&gt;
Текущая = (0.3 * онлайн + 0.1 * КР1 + 0.1 * КР2 + 0.1 * КР3 + 0.1 * КР4 + 0.3 * ДЗ + 0.1 * Семинар)&lt;br /&gt;
&lt;br /&gt;
Оценка = мин(округл(Текущая); 10)&lt;br /&gt;
&lt;br /&gt;
Оценка &amp;quot;Семинар&amp;quot; ставится за активность на семинаре. Проверяем мы ее, попросив вас написать что-то в чат в зуме или как-то иначе отреагировать в какой-то случайный момент во время семинара. Если у вас плохо получается решать задачи, но вы активно пытаетесь тем не менее это сделать во время семинара - вы получаете баллы за активность. &lt;br /&gt;
&lt;br /&gt;
Дополнительное требование у Жени Каленковича: включена демонстарция экрана или у вас хорошая заранее озвученная причина, почему это невозможно.&lt;br /&gt;
&lt;br /&gt;
Посеминарную информацию про активность можно посмотреть [https://docs.google.com/spreadsheets/d/1Qs8voxyZVBjwjir74bjUX7yMCGiWoxtnYgAZd4jmx7I/edit?usp=sharing здесь].&lt;br /&gt;
&lt;br /&gt;
== Дополнительная помощь ==&lt;br /&gt;
&lt;br /&gt;
Задать вопросы по курсу можно на форуме LMS или в неофициальном общем чате в телеграме. По вопросу добавления в чат можно обратиться к преподавателям или учебным ассистентам.&lt;br /&gt;
&lt;br /&gt;
Будут организованы консультации в Zoom. Время консультаций будет объявлено после соответсвующего семинара.&lt;br /&gt;
&lt;br /&gt;
== DataCamp ==&lt;br /&gt;
&lt;br /&gt;
!!! В курсе использоваться не будет !!!&lt;br /&gt;
&lt;br /&gt;
DataCamp изменил правила, поэтому использовать мы его не сможем. Тем не менее, зарегистрировавшись по ссылке, которую мы вам прислали, вы получите доступ ко всем их курсам на полгода. Можете - по желанию - этим воспользоваться.&lt;br /&gt;
&lt;br /&gt;
Устаревшкая информация:&lt;br /&gt;
&lt;br /&gt;
Часть семинаров и проверочных работ будет проводиться на платформе [https://www.datacamp.com/ DataCamp]. &lt;br /&gt;
&lt;br /&gt;
О платформе (текст предоставлен DataCamp): &lt;br /&gt;
&lt;br /&gt;
This class is supported by [https://www.datacamp.com/ DataCamp], the most intuitive learning platform for data science and analytics. Learn any time, anywhere and become an expert in R, Python, SQL, and more. DataCamp’s learn-by-doing methodology combines short expert videos and hands-on-the-keyboard exercises to help learners retain knowledge. DataCamp offers 325+ courses by expert instructors on topics such as importing data, data visualization, and machine learning. They’re constantly expanding their curriculum to keep up with the latest technology trends and to provide the best learning experience for all skill levels. Join over 5 million learners around the world and close your skills gap.&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%9F%D1%81%D0%B8%D1%85%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_1_%D0%BA%D1%83%D1%80%D1%81_2019/2020&amp;diff=41239</id>
		<title>Python для извлечения и обработки данных Психология 1 курс 2019/2020</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%9F%D1%81%D0%B8%D1%85%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_1_%D0%BA%D1%83%D1%80%D1%81_2019/2020&amp;diff=41239"/>
		<updated>2020-05-19T09:39:38Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Контрольная 2 */  Добавил результаты&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== О курсе ==&lt;br /&gt;
&amp;quot;Python для извлечения и обработки данных&amp;quot; читается на 1 курсе, в 4 модуле.&lt;br /&gt;
&lt;br /&gt;
[https://www.hse.ru/edu/courses/292681829 Карточка курса и программа]&lt;br /&gt;
&lt;br /&gt;
===Преподаватели===&lt;br /&gt;
&#039;&#039;&#039;Группы 191, 192, 193, 194&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
Преподаватель: Каленкович Евгений Евгеньевич&amp;lt;br /&amp;gt;&lt;br /&gt;
E-mail: ekalenkovich@hse.ru&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Группы 195, 196, 197&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
Преподаватель: Жуликов Георгий Александрович&amp;lt;br /&amp;gt;&lt;br /&gt;
E-mail: l8doku@gmail.com&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @l8doku&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Ассистенты===&lt;br /&gt;
&lt;br /&gt;
Петров Тимур, группа 196&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @Palladain&lt;br /&gt;
&lt;br /&gt;
Масликов Егор, группы БПС193 - БПС194&amp;lt;br /&amp;gt;&lt;br /&gt;
VK: [https://vk.com/id90262659 Масликов Егор]&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/egorkapiorka @egorkapiorka]&lt;br /&gt;
&lt;br /&gt;
Котликова Анастасия, группы 191, 192&amp;lt;br /&amp;gt;&lt;br /&gt;
VK: [https://vk.com/steeeven Котликова Анастасия] &amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/steeeven @steeeven]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Участник:Markina Daria|Маркина Дарья]], группы 195 и 197&amp;lt;br /&amp;gt;&lt;br /&gt;
Vk: [https://vk.com/markina_dasha Маркина Дарья]&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/MarkinaDaria @MarkinaDaria]&lt;br /&gt;
&lt;br /&gt;
== Структура курса ==&lt;br /&gt;
&lt;br /&gt;
Рекомендуемая рабочая среда - Jupyter Notebook. Рекомендуемый способ установить Jupyter notebook - установить [https://www.anaconda.com/distribution/#download-section Anaconda].&lt;br /&gt;
&lt;br /&gt;
=== Семинары ===&lt;br /&gt;
Даты проведения семинаров:&lt;br /&gt;
&lt;br /&gt;
07.04 / 08.04&lt;br /&gt;
&lt;br /&gt;
14.04 / 15.04&lt;br /&gt;
&lt;br /&gt;
28.04 / 29.04&lt;br /&gt;
&lt;br /&gt;
19.05 / 20.05&lt;br /&gt;
&lt;br /&gt;
02.06 / 03.06&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Консультации ===&lt;br /&gt;
&lt;br /&gt;
==== С ассистентами ====&lt;br /&gt;
&lt;br /&gt;
О консультациях с ассистентнами нужно договориться с ними лично. Вы находите время, которое удобно и вам, и им - и связываетесь любым удобным вам способом.&lt;br /&gt;
&lt;br /&gt;
==== С преподавателями ====&lt;br /&gt;
&lt;br /&gt;
Формат: Zoom. &lt;br /&gt;
&lt;br /&gt;
Женя будет впускать по одному. Время на одного человека зависит от количества человек в очереди.&lt;br /&gt;
&lt;br /&gt;
Георгий будет проводить консультации открыто: любой может зайти и выйти в любое время.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Ссылки на Zoom будут присланы на корпоративную почту.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Расписание&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Консультация 1:&lt;br /&gt;
&lt;br /&gt;
11.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
Георгий: 13:40 - 15:00&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Консультация 2:&lt;br /&gt;
&lt;br /&gt;
18.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
Георгий: 13:40 - 15:00&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Консультация 2:&lt;br /&gt;
&lt;br /&gt;
25.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
=== Онлайн-курс ===&lt;br /&gt;
&lt;br /&gt;
Онлайн-курс доступен [https://courses.openedu.ru/courses/course-v1:hse+PYTHON_HSE+special_2020/ на openedu]&lt;br /&gt;
&lt;br /&gt;
Дедлайны онлайн-курса&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;
| 1 неделя&lt;br /&gt;
| 12.04&lt;br /&gt;
|-&lt;br /&gt;
| 2 неделя &lt;br /&gt;
| 19.04&lt;br /&gt;
|-&lt;br /&gt;
| 3 неделя&lt;br /&gt;
| 26.04&lt;br /&gt;
|- &lt;br /&gt;
| 4 неделя&lt;br /&gt;
| 14.05&lt;br /&gt;
|- &lt;br /&gt;
| 5 неделя&lt;br /&gt;
| 28.05&lt;br /&gt;
|- &lt;br /&gt;
| 6 неделя&lt;br /&gt;
| 11.06&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Контрольные ===&lt;br /&gt;
&lt;br /&gt;
Теория: &#039;&#039;&#039;две&#039;&#039;&#039; контрольные в общее для всех время (тест в выбором ответа или свободным ответом) - КР1 и КР3&lt;br /&gt;
&lt;br /&gt;
Практика: &#039;&#039;&#039;две&#039;&#039;&#039; контрольные в общее для всех время (решение задач на программирование на время) - КР2 и КР4&lt;br /&gt;
&lt;br /&gt;
==== Контрольная 1 ====&lt;br /&gt;
&lt;br /&gt;
Результаты https://docs.google.com/spreadsheets/d/1mYFxQaa6hXSLpiE73BNUPHJ36gg4V0p43XV2X7yfyMM&lt;br /&gt;
&lt;br /&gt;
Недели курса:&lt;br /&gt;
1-3&lt;br /&gt;
&lt;br /&gt;
Когда:&lt;br /&gt;
6 мая в 15:10.&lt;br /&gt;
&lt;br /&gt;
Как будет проходить:&lt;br /&gt;
# вы выключаете все соц. сети, месенджеры и прочее на всех устройствах, выключаете телефон;&lt;br /&gt;
# вы подключаетесь по зуму, включаете камеру и демонстрацию экрана;&lt;br /&gt;
# мы присылаем ссылки на папку с заданиями на гугл-драйве и на гугл-форму для заполнения ответов;&lt;br /&gt;
# вы скачиваете вариант со своим именем (правая кнопка -&amp;gt; скачать), открываете файл с заданием в бразуре, по мере решения заполняете гугл-форму;&lt;br /&gt;
# через 40 минут + 5 минут на технические вопросы мы закрываем гугл-форму.&lt;br /&gt;
&lt;br /&gt;
Правила:&lt;br /&gt;
# камера и демонстрация экрана включены в течение всей контрольной;&lt;br /&gt;
# можно пользоваться гуглом;&lt;br /&gt;
# нельзя пользоваться соц. сетями и месенджерами (нельзя общаться ни с кем, кроме как с нами в чате зума);&lt;br /&gt;
# нельзя списывать (напоминаем про ответственность за нарушение академических норм);&lt;br /&gt;
# общение (см. п. 3) приравнивается к списыванию.&lt;br /&gt;
&lt;br /&gt;
Что делать, если у вас технические проблемы, из-за которых вы не можете включить камеру и демонстрацию экрана?&lt;br /&gt;
# Вы пишете письмо об этой проблеме в учебный офис, добавляя меня и Георгия в копию.&lt;br /&gt;
# Учебный офис устанавливает, уважительная ли у вас причина.&lt;br /&gt;
# Если причина уважительная, то дальше возможны варианты:&lt;br /&gt;
##   Мы решаем с вами и учебным офисом, как поступать дальше.&lt;br /&gt;
##   Мы разрешаем вам на первой контрольной (и только на ней, что делать с остальными напишем отдельно) ограничиться включенной камерой на любом устройстве.&lt;br /&gt;
# Если учебный офис не успеет ответить до контрольной (что вероятно) вы все равно можете авансом воспользоваться вариантом 3.2.&lt;br /&gt;
&lt;br /&gt;
==== Контрольная 2 ====&lt;br /&gt;
&lt;br /&gt;
Результаты: https://docs.google.com/spreadsheets/d/1Q-k8MOz6iMO180zg7rdHZQr87_O6CsIUYLRmfEMSTK0&lt;br /&gt;
&lt;br /&gt;
Недели курса:&lt;br /&gt;
1-3&lt;br /&gt;
&lt;br /&gt;
Когда:&lt;br /&gt;
8 мая в 15:10.&lt;br /&gt;
&lt;br /&gt;
Как будет проходить:&lt;br /&gt;
# вы выключаете все соц. сети, месенджеры и прочее на всех устройствах, выключаете телефон;&lt;br /&gt;
# вы подключаетесь по зуму, включаете камеру и демонстрацию экрана;&lt;br /&gt;
# мы присылаем ссылку на яндекс.контест, состоящий из 4 задач;&lt;br /&gt;
# через 1ч 20 минут + 5 минут запаса яндекс.контест завершается.&lt;br /&gt;
&lt;br /&gt;
Правила:&lt;br /&gt;
# камера и демонстрация экрана включены в течение всей контрольной;&lt;br /&gt;
# нельзя гуглить решения заданий (увидим - засчитываем как списывание);&lt;br /&gt;
# нельзя пользоваться соц. сетями и месенджерами (нельзя общаться ни с кем, кроме как с нами в чате зума);&lt;br /&gt;
# в остальном можно пользоваться интернетом;&lt;br /&gt;
# нельзя списывать (напоминаем про ответственность за нарушение академических норм);&lt;br /&gt;
# общение (см. п. 3) приравнивается к списыванию.&lt;br /&gt;
&lt;br /&gt;
Что делать, если у вас технические проблемы, из-за которых вы не можете включить камеру и демонстрацию экрана?&lt;br /&gt;
# Вы пишете письмо об этой проблеме в учебный офис, добавляя меня и Георгия в копию.&lt;br /&gt;
# Учебный офис устанавливает, уважительная ли у вас причина.&lt;br /&gt;
# Если причина уважительная, то дальше возможны варианты:&lt;br /&gt;
##  Мы решаем с вами и учебным офисом, как поступать дальше.&lt;br /&gt;
##  Мы разрешаем вам обойтись без зума, но вы должны обеспечить запись экрана и веб-камеры на локальный компьютер, которую вы выкладываете.&lt;br /&gt;
&lt;br /&gt;
==== FAQ ====&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;Можно ли использовать бумажные конспекты?&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
- Нет.&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;OpenEdu, фото конспектов, документацию питона?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
- Да.&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;Чем карается списывание и приравниваемые к нему действия?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
- Первый раз - 0 за контрольную + докладная в учебную часть. Второй раз - 0 за курс + докладная в учебную часть.&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;А как выйти из соцсетей на всех устройствах?```&lt;br /&gt;
&lt;br /&gt;
- Во всех соцсетях есть возможность выйти со всех устройств. В вк это &amp;quot;настройки -&amp;gt; безопасность -&amp;gt; завершить все сеансы&amp;quot;. В тг это &amp;quot;настройки -&amp;gt; активные сессии&amp;quot;, там нужно убивать по одной.&lt;br /&gt;
&lt;br /&gt;
=== Домашнее задание ===&lt;br /&gt;
&lt;br /&gt;
Детали будут опубликованы как минимум за две недели до дедлайна.&lt;br /&gt;
&lt;br /&gt;
Дедлайн - 14 июня 23:59:59&lt;br /&gt;
&lt;br /&gt;
== Формула оценки ==&lt;br /&gt;
&lt;br /&gt;
Текущая = (0.3 * онлайн + 0.1 * КР1 + 0.1 * КР2 + 0.1 * КР3 + 0.1 * КР4 + 0.3 * ДЗ + 0.1 * Семинар)&lt;br /&gt;
&lt;br /&gt;
Оценка = мин(округл(Текущая); 10)&lt;br /&gt;
&lt;br /&gt;
Оценка &amp;quot;Семинар&amp;quot; ставится за активность на семинаре. Проверяем мы ее, попросив вас написать что-то в чат в зуме или как-то иначе отреагировать в какой-то случайный момент во время семинара. Если у вас плохо получается решать задачи, но вы активно пытаетесь тем не менее это сделать во время семинара - вы получаете баллы за активность. &lt;br /&gt;
&lt;br /&gt;
Дополнительное требование у Жени Каленковича: включена демонстарция экрана или у вас хорошая заранее озвученная причина, почему это невозможно.&lt;br /&gt;
&lt;br /&gt;
Посеминарную информацию про активность можно посмотреть [https://docs.google.com/spreadsheets/d/1Qs8voxyZVBjwjir74bjUX7yMCGiWoxtnYgAZd4jmx7I/edit?usp=sharing здесь].&lt;br /&gt;
&lt;br /&gt;
== Дополнительная помощь ==&lt;br /&gt;
&lt;br /&gt;
Задать вопросы по курсу можно на форуме LMS или в неофициальном общем чате в телеграме. По вопросу добавления в чат можно обратиться к преподавателям или учебным ассистентам.&lt;br /&gt;
&lt;br /&gt;
Будут организованы консультации в Zoom. Время консультаций будет объявлено после соответсвующего семинара.&lt;br /&gt;
&lt;br /&gt;
== DataCamp ==&lt;br /&gt;
&lt;br /&gt;
!!! В курсе использоваться не будет !!!&lt;br /&gt;
&lt;br /&gt;
DataCamp изменил правила, поэтому использовать мы его не сможем. Тем не менее, зарегистрировавшись по ссылке, которую мы вам прислали, вы получите доступ ко всем их курсам на полгода. Можете - по желанию - этим воспользоваться.&lt;br /&gt;
&lt;br /&gt;
Устаревшкая информация:&lt;br /&gt;
&lt;br /&gt;
Часть семинаров и проверочных работ будет проводиться на платформе [https://www.datacamp.com/ DataCamp]. &lt;br /&gt;
&lt;br /&gt;
О платформе (текст предоставлен DataCamp): &lt;br /&gt;
&lt;br /&gt;
This class is supported by [https://www.datacamp.com/ DataCamp], the most intuitive learning platform for data science and analytics. Learn any time, anywhere and become an expert in R, Python, SQL, and more. DataCamp’s learn-by-doing methodology combines short expert videos and hands-on-the-keyboard exercises to help learners retain knowledge. DataCamp offers 325+ courses by expert instructors on topics such as importing data, data visualization, and machine learning. They’re constantly expanding their curriculum to keep up with the latest technology trends and to provide the best learning experience for all skill levels. Join over 5 million learners around the world and close your skills gap.&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%9F%D1%81%D0%B8%D1%85%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_1_%D0%BA%D1%83%D1%80%D1%81_2019/2020&amp;diff=41238</id>
		<title>Python для извлечения и обработки данных Психология 1 курс 2019/2020</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%9F%D1%81%D0%B8%D1%85%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_1_%D0%BA%D1%83%D1%80%D1%81_2019/2020&amp;diff=41238"/>
		<updated>2020-05-19T09:39:08Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Контрольная 1 */ Добавил результаты&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== О курсе ==&lt;br /&gt;
&amp;quot;Python для извлечения и обработки данных&amp;quot; читается на 1 курсе, в 4 модуле.&lt;br /&gt;
&lt;br /&gt;
[https://www.hse.ru/edu/courses/292681829 Карточка курса и программа]&lt;br /&gt;
&lt;br /&gt;
===Преподаватели===&lt;br /&gt;
&#039;&#039;&#039;Группы 191, 192, 193, 194&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
Преподаватель: Каленкович Евгений Евгеньевич&amp;lt;br /&amp;gt;&lt;br /&gt;
E-mail: ekalenkovich@hse.ru&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Группы 195, 196, 197&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
Преподаватель: Жуликов Георгий Александрович&amp;lt;br /&amp;gt;&lt;br /&gt;
E-mail: l8doku@gmail.com&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @l8doku&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Ассистенты===&lt;br /&gt;
&lt;br /&gt;
Петров Тимур, группа 196&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @Palladain&lt;br /&gt;
&lt;br /&gt;
Масликов Егор, группы БПС193 - БПС194&amp;lt;br /&amp;gt;&lt;br /&gt;
VK: [https://vk.com/id90262659 Масликов Егор]&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/egorkapiorka @egorkapiorka]&lt;br /&gt;
&lt;br /&gt;
Котликова Анастасия, группы 191, 192&amp;lt;br /&amp;gt;&lt;br /&gt;
VK: [https://vk.com/steeeven Котликова Анастасия] &amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/steeeven @steeeven]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Участник:Markina Daria|Маркина Дарья]], группы 195 и 197&amp;lt;br /&amp;gt;&lt;br /&gt;
Vk: [https://vk.com/markina_dasha Маркина Дарья]&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/MarkinaDaria @MarkinaDaria]&lt;br /&gt;
&lt;br /&gt;
== Структура курса ==&lt;br /&gt;
&lt;br /&gt;
Рекомендуемая рабочая среда - Jupyter Notebook. Рекомендуемый способ установить Jupyter notebook - установить [https://www.anaconda.com/distribution/#download-section Anaconda].&lt;br /&gt;
&lt;br /&gt;
=== Семинары ===&lt;br /&gt;
Даты проведения семинаров:&lt;br /&gt;
&lt;br /&gt;
07.04 / 08.04&lt;br /&gt;
&lt;br /&gt;
14.04 / 15.04&lt;br /&gt;
&lt;br /&gt;
28.04 / 29.04&lt;br /&gt;
&lt;br /&gt;
19.05 / 20.05&lt;br /&gt;
&lt;br /&gt;
02.06 / 03.06&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Консультации ===&lt;br /&gt;
&lt;br /&gt;
==== С ассистентами ====&lt;br /&gt;
&lt;br /&gt;
О консультациях с ассистентнами нужно договориться с ними лично. Вы находите время, которое удобно и вам, и им - и связываетесь любым удобным вам способом.&lt;br /&gt;
&lt;br /&gt;
==== С преподавателями ====&lt;br /&gt;
&lt;br /&gt;
Формат: Zoom. &lt;br /&gt;
&lt;br /&gt;
Женя будет впускать по одному. Время на одного человека зависит от количества человек в очереди.&lt;br /&gt;
&lt;br /&gt;
Георгий будет проводить консультации открыто: любой может зайти и выйти в любое время.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Ссылки на Zoom будут присланы на корпоративную почту.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Расписание&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Консультация 1:&lt;br /&gt;
&lt;br /&gt;
11.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
Георгий: 13:40 - 15:00&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Консультация 2:&lt;br /&gt;
&lt;br /&gt;
18.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
Георгий: 13:40 - 15:00&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Консультация 2:&lt;br /&gt;
&lt;br /&gt;
25.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
=== Онлайн-курс ===&lt;br /&gt;
&lt;br /&gt;
Онлайн-курс доступен [https://courses.openedu.ru/courses/course-v1:hse+PYTHON_HSE+special_2020/ на openedu]&lt;br /&gt;
&lt;br /&gt;
Дедлайны онлайн-курса&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;
| 1 неделя&lt;br /&gt;
| 12.04&lt;br /&gt;
|-&lt;br /&gt;
| 2 неделя &lt;br /&gt;
| 19.04&lt;br /&gt;
|-&lt;br /&gt;
| 3 неделя&lt;br /&gt;
| 26.04&lt;br /&gt;
|- &lt;br /&gt;
| 4 неделя&lt;br /&gt;
| 14.05&lt;br /&gt;
|- &lt;br /&gt;
| 5 неделя&lt;br /&gt;
| 28.05&lt;br /&gt;
|- &lt;br /&gt;
| 6 неделя&lt;br /&gt;
| 11.06&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Контрольные ===&lt;br /&gt;
&lt;br /&gt;
Теория: &#039;&#039;&#039;две&#039;&#039;&#039; контрольные в общее для всех время (тест в выбором ответа или свободным ответом) - КР1 и КР3&lt;br /&gt;
&lt;br /&gt;
Практика: &#039;&#039;&#039;две&#039;&#039;&#039; контрольные в общее для всех время (решение задач на программирование на время) - КР2 и КР4&lt;br /&gt;
&lt;br /&gt;
==== Контрольная 1 ====&lt;br /&gt;
&lt;br /&gt;
Результаты https://docs.google.com/spreadsheets/d/1mYFxQaa6hXSLpiE73BNUPHJ36gg4V0p43XV2X7yfyMM&lt;br /&gt;
&lt;br /&gt;
Недели курса:&lt;br /&gt;
1-3&lt;br /&gt;
&lt;br /&gt;
Когда:&lt;br /&gt;
6 мая в 15:10.&lt;br /&gt;
&lt;br /&gt;
Как будет проходить:&lt;br /&gt;
# вы выключаете все соц. сети, месенджеры и прочее на всех устройствах, выключаете телефон;&lt;br /&gt;
# вы подключаетесь по зуму, включаете камеру и демонстрацию экрана;&lt;br /&gt;
# мы присылаем ссылки на папку с заданиями на гугл-драйве и на гугл-форму для заполнения ответов;&lt;br /&gt;
# вы скачиваете вариант со своим именем (правая кнопка -&amp;gt; скачать), открываете файл с заданием в бразуре, по мере решения заполняете гугл-форму;&lt;br /&gt;
# через 40 минут + 5 минут на технические вопросы мы закрываем гугл-форму.&lt;br /&gt;
&lt;br /&gt;
Правила:&lt;br /&gt;
# камера и демонстрация экрана включены в течение всей контрольной;&lt;br /&gt;
# можно пользоваться гуглом;&lt;br /&gt;
# нельзя пользоваться соц. сетями и месенджерами (нельзя общаться ни с кем, кроме как с нами в чате зума);&lt;br /&gt;
# нельзя списывать (напоминаем про ответственность за нарушение академических норм);&lt;br /&gt;
# общение (см. п. 3) приравнивается к списыванию.&lt;br /&gt;
&lt;br /&gt;
Что делать, если у вас технические проблемы, из-за которых вы не можете включить камеру и демонстрацию экрана?&lt;br /&gt;
# Вы пишете письмо об этой проблеме в учебный офис, добавляя меня и Георгия в копию.&lt;br /&gt;
# Учебный офис устанавливает, уважительная ли у вас причина.&lt;br /&gt;
# Если причина уважительная, то дальше возможны варианты:&lt;br /&gt;
##   Мы решаем с вами и учебным офисом, как поступать дальше.&lt;br /&gt;
##   Мы разрешаем вам на первой контрольной (и только на ней, что делать с остальными напишем отдельно) ограничиться включенной камерой на любом устройстве.&lt;br /&gt;
# Если учебный офис не успеет ответить до контрольной (что вероятно) вы все равно можете авансом воспользоваться вариантом 3.2.&lt;br /&gt;
&lt;br /&gt;
==== Контрольная 2 ====&lt;br /&gt;
&lt;br /&gt;
Недели курса:&lt;br /&gt;
1-3&lt;br /&gt;
&lt;br /&gt;
Когда:&lt;br /&gt;
8 мая в 15:10.&lt;br /&gt;
&lt;br /&gt;
Как будет проходить:&lt;br /&gt;
# вы выключаете все соц. сети, месенджеры и прочее на всех устройствах, выключаете телефон;&lt;br /&gt;
# вы подключаетесь по зуму, включаете камеру и демонстрацию экрана;&lt;br /&gt;
# мы присылаем ссылку на яндекс.контест, состоящий из 4 задач;&lt;br /&gt;
# через 1ч 20 минут + 5 минут запаса яндекс.контест завершается.&lt;br /&gt;
&lt;br /&gt;
Правила:&lt;br /&gt;
# камера и демонстрация экрана включены в течение всей контрольной;&lt;br /&gt;
# нельзя гуглить решения заданий (увидим - засчитываем как списывание);&lt;br /&gt;
# нельзя пользоваться соц. сетями и месенджерами (нельзя общаться ни с кем, кроме как с нами в чате зума);&lt;br /&gt;
# в остальном можно пользоваться интернетом;&lt;br /&gt;
# нельзя списывать (напоминаем про ответственность за нарушение академических норм);&lt;br /&gt;
# общение (см. п. 3) приравнивается к списыванию.&lt;br /&gt;
&lt;br /&gt;
Что делать, если у вас технические проблемы, из-за которых вы не можете включить камеру и демонстрацию экрана?&lt;br /&gt;
# Вы пишете письмо об этой проблеме в учебный офис, добавляя меня и Георгия в копию.&lt;br /&gt;
# Учебный офис устанавливает, уважительная ли у вас причина.&lt;br /&gt;
# Если причина уважительная, то дальше возможны варианты:&lt;br /&gt;
##  Мы решаем с вами и учебным офисом, как поступать дальше.&lt;br /&gt;
##  Мы разрешаем вам обойтись без зума, но вы должны обеспечить запись экрана и веб-камеры на локальный компьютер, которую вы выкладываете.&lt;br /&gt;
&lt;br /&gt;
==== FAQ ====&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;Можно ли использовать бумажные конспекты?&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
- Нет.&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;OpenEdu, фото конспектов, документацию питона?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
- Да.&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;Чем карается списывание и приравниваемые к нему действия?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
- Первый раз - 0 за контрольную + докладная в учебную часть. Второй раз - 0 за курс + докладная в учебную часть.&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;А как выйти из соцсетей на всех устройствах?```&lt;br /&gt;
&lt;br /&gt;
- Во всех соцсетях есть возможность выйти со всех устройств. В вк это &amp;quot;настройки -&amp;gt; безопасность -&amp;gt; завершить все сеансы&amp;quot;. В тг это &amp;quot;настройки -&amp;gt; активные сессии&amp;quot;, там нужно убивать по одной.&lt;br /&gt;
&lt;br /&gt;
=== Домашнее задание ===&lt;br /&gt;
&lt;br /&gt;
Детали будут опубликованы как минимум за две недели до дедлайна.&lt;br /&gt;
&lt;br /&gt;
Дедлайн - 14 июня 23:59:59&lt;br /&gt;
&lt;br /&gt;
== Формула оценки ==&lt;br /&gt;
&lt;br /&gt;
Текущая = (0.3 * онлайн + 0.1 * КР1 + 0.1 * КР2 + 0.1 * КР3 + 0.1 * КР4 + 0.3 * ДЗ + 0.1 * Семинар)&lt;br /&gt;
&lt;br /&gt;
Оценка = мин(округл(Текущая); 10)&lt;br /&gt;
&lt;br /&gt;
Оценка &amp;quot;Семинар&amp;quot; ставится за активность на семинаре. Проверяем мы ее, попросив вас написать что-то в чат в зуме или как-то иначе отреагировать в какой-то случайный момент во время семинара. Если у вас плохо получается решать задачи, но вы активно пытаетесь тем не менее это сделать во время семинара - вы получаете баллы за активность. &lt;br /&gt;
&lt;br /&gt;
Дополнительное требование у Жени Каленковича: включена демонстарция экрана или у вас хорошая заранее озвученная причина, почему это невозможно.&lt;br /&gt;
&lt;br /&gt;
Посеминарную информацию про активность можно посмотреть [https://docs.google.com/spreadsheets/d/1Qs8voxyZVBjwjir74bjUX7yMCGiWoxtnYgAZd4jmx7I/edit?usp=sharing здесь].&lt;br /&gt;
&lt;br /&gt;
== Дополнительная помощь ==&lt;br /&gt;
&lt;br /&gt;
Задать вопросы по курсу можно на форуме LMS или в неофициальном общем чате в телеграме. По вопросу добавления в чат можно обратиться к преподавателям или учебным ассистентам.&lt;br /&gt;
&lt;br /&gt;
Будут организованы консультации в Zoom. Время консультаций будет объявлено после соответсвующего семинара.&lt;br /&gt;
&lt;br /&gt;
== DataCamp ==&lt;br /&gt;
&lt;br /&gt;
!!! В курсе использоваться не будет !!!&lt;br /&gt;
&lt;br /&gt;
DataCamp изменил правила, поэтому использовать мы его не сможем. Тем не менее, зарегистрировавшись по ссылке, которую мы вам прислали, вы получите доступ ко всем их курсам на полгода. Можете - по желанию - этим воспользоваться.&lt;br /&gt;
&lt;br /&gt;
Устаревшкая информация:&lt;br /&gt;
&lt;br /&gt;
Часть семинаров и проверочных работ будет проводиться на платформе [https://www.datacamp.com/ DataCamp]. &lt;br /&gt;
&lt;br /&gt;
О платформе (текст предоставлен DataCamp): &lt;br /&gt;
&lt;br /&gt;
This class is supported by [https://www.datacamp.com/ DataCamp], the most intuitive learning platform for data science and analytics. Learn any time, anywhere and become an expert in R, Python, SQL, and more. DataCamp’s learn-by-doing methodology combines short expert videos and hands-on-the-keyboard exercises to help learners retain knowledge. DataCamp offers 325+ courses by expert instructors on topics such as importing data, data visualization, and machine learning. They’re constantly expanding their curriculum to keep up with the latest technology trends and to provide the best learning experience for all skill levels. Join over 5 million learners around the world and close your skills gap.&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%9F%D1%81%D0%B8%D1%85%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_1_%D0%BA%D1%83%D1%80%D1%81_2019/2020&amp;diff=40920</id>
		<title>Python для извлечения и обработки данных Психология 1 курс 2019/2020</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%9F%D1%81%D0%B8%D1%85%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_1_%D0%BA%D1%83%D1%80%D1%81_2019/2020&amp;diff=40920"/>
		<updated>2020-05-06T11:50:26Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: Исправление форматирование правил контрольных&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== О курсе ==&lt;br /&gt;
&amp;quot;Python для извлечения и обработки данных&amp;quot; читается на 1 курсе, в 4 модуле.&lt;br /&gt;
&lt;br /&gt;
[https://www.hse.ru/edu/courses/292681829 Карточка курса и программа]&lt;br /&gt;
&lt;br /&gt;
===Преподаватели===&lt;br /&gt;
&#039;&#039;&#039;Группы 191, 192, 193, 194&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
Преподаватель: Каленкович Евгений Евгеньевич&amp;lt;br /&amp;gt;&lt;br /&gt;
E-mail: ekalenkovich@hse.ru&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Группы 195, 196, 197&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
Преподаватель: Жуликов Георгий Александрович&amp;lt;br /&amp;gt;&lt;br /&gt;
E-mail: l8doku@gmail.com&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @l8doku&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Ассистенты===&lt;br /&gt;
&lt;br /&gt;
Петров Тимур, группа 196&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @Palladain&lt;br /&gt;
&lt;br /&gt;
Масликов Егор, группы БПС193 - БПС194&amp;lt;br /&amp;gt;&lt;br /&gt;
VK: [https://vk.com/id90262659 Масликов Егор]&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/egorkapiorka @egorkapiorka]&lt;br /&gt;
&lt;br /&gt;
Котликова Анастасия, группы 191, 192&amp;lt;br /&amp;gt;&lt;br /&gt;
VK: [https://vk.com/steeeven Котликова Анастасия] &amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/steeeven @steeeven]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Участник:Markina Daria|Маркина Дарья]], группы 195 и 197&amp;lt;br /&amp;gt;&lt;br /&gt;
Vk: [https://vk.com/markina_dasha Маркина Дарья]&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/MarkinaDaria @MarkinaDaria]&lt;br /&gt;
&lt;br /&gt;
== Структура курса ==&lt;br /&gt;
&lt;br /&gt;
Рекомендуемая рабочая среда - Jupyter Notebook. Рекомендуемый способ установить Jupyter notebook - установить [https://www.anaconda.com/distribution/#download-section Anaconda].&lt;br /&gt;
&lt;br /&gt;
=== Семинары ===&lt;br /&gt;
Даты проведения семинаров:&lt;br /&gt;
&lt;br /&gt;
07.04 / 08.04&lt;br /&gt;
&lt;br /&gt;
14.04 / 15.04&lt;br /&gt;
&lt;br /&gt;
28.04 / 29.04&lt;br /&gt;
&lt;br /&gt;
19.05 / 20.05&lt;br /&gt;
&lt;br /&gt;
02.06 / 03.06&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Консультации ===&lt;br /&gt;
&lt;br /&gt;
==== С ассистентами ====&lt;br /&gt;
&lt;br /&gt;
О консультациях с ассистентнами нужно договориться с ними лично. Вы находите время, которое удобно и вам, и им - и связываетесь любым удобным вам способом.&lt;br /&gt;
&lt;br /&gt;
==== С преподавателями ====&lt;br /&gt;
&lt;br /&gt;
Формат: Zoom. &lt;br /&gt;
&lt;br /&gt;
Женя будет впускать по одному. Время на одного человека зависит от количества человек в очереди.&lt;br /&gt;
&lt;br /&gt;
Георгий будет проводить консультации открыто: любой может зайти и выйти в любое время.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Ссылки на Zoom будут присланы на корпоративную почту.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Расписание&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Консультация 1:&lt;br /&gt;
&lt;br /&gt;
11.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
Георгий: 13:40 - 15:00&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Консультация 2:&lt;br /&gt;
&lt;br /&gt;
18.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
Георгий: 13:40 - 15:00&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Консультация 2:&lt;br /&gt;
&lt;br /&gt;
25.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
=== Онлайн-курс ===&lt;br /&gt;
&lt;br /&gt;
Онлайн-курс доступен [https://courses.openedu.ru/courses/course-v1:hse+PYTHON_HSE+special_2020/ на openedu]&lt;br /&gt;
&lt;br /&gt;
Дедлайны онлайн-курса&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;
| 1 неделя&lt;br /&gt;
| 12.04&lt;br /&gt;
|-&lt;br /&gt;
| 2 неделя &lt;br /&gt;
| 19.04&lt;br /&gt;
|-&lt;br /&gt;
| 3 неделя&lt;br /&gt;
| 26.04&lt;br /&gt;
|- &lt;br /&gt;
| 4 неделя&lt;br /&gt;
| 14.05&lt;br /&gt;
|- &lt;br /&gt;
| 5 неделя&lt;br /&gt;
| 28.05&lt;br /&gt;
|- &lt;br /&gt;
| 6 неделя&lt;br /&gt;
| 11.06&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Контрольные ===&lt;br /&gt;
&lt;br /&gt;
Теория: &#039;&#039;&#039;две&#039;&#039;&#039; контрольные в общее для всех время (тест в выбором ответа или свободным ответом) - КР1 и КР3&lt;br /&gt;
&lt;br /&gt;
Практика: &#039;&#039;&#039;две&#039;&#039;&#039; контрольные в общее для всех время (решение задач на программирование на время) - КР2 и КР4&lt;br /&gt;
&lt;br /&gt;
==== Контрольная 1 ====&lt;br /&gt;
&lt;br /&gt;
Недели курса:&lt;br /&gt;
1-3&lt;br /&gt;
&lt;br /&gt;
Когда:&lt;br /&gt;
6 мая в 15:10.&lt;br /&gt;
&lt;br /&gt;
Как будет проходить:&lt;br /&gt;
# вы выключаете все соц. сети, месенджеры и прочее на всех устройствах, выключаете телефон;&lt;br /&gt;
# вы подключаетесь по зуму, включаете камеру и демонстрацию экрана;&lt;br /&gt;
# мы присылаем ссылки на папку с заданиями на гугл-драйве и на гугл-форму для заполнения ответов;&lt;br /&gt;
# вы скачиваете вариант со своим именем (правая кнопка -&amp;gt; скачать), открываете файл с заданием в бразуре, по мере решения заполняете гугл-форму;&lt;br /&gt;
# через 40 минут + 5 минут на технические вопросы мы закрываем гугл-форму.&lt;br /&gt;
&lt;br /&gt;
Правила:&lt;br /&gt;
# камера и демонстрация экрана включены в течение всей контрольной;&lt;br /&gt;
# можно пользоваться гуглом;&lt;br /&gt;
# нельзя пользоваться соц. сетями и месенджерами (нельзя общаться ни с кем, кроме как с нами в чате зума);&lt;br /&gt;
# нельзя списывать (напоминаем про ответственность за нарушение академических норм);&lt;br /&gt;
# общение (см. п. 3) приравнивается к списыванию.&lt;br /&gt;
&lt;br /&gt;
Что делать, если у вас технические проблемы, из-за которых вы не можете включить камеру и демонстрацию экрана?&lt;br /&gt;
# Вы пишете письмо об этой проблеме в учебный офис, добавляя меня и Георгия в копию.&lt;br /&gt;
# Учебный офис устанавливает, уважительная ли у вас причина.&lt;br /&gt;
# Если причина уважительная, то дальше возможны варианты:&lt;br /&gt;
##   Мы решаем с вами и учебным офисом, как поступать дальше.&lt;br /&gt;
##   Мы разрешаем вам на первой контрольной (и только на ней, что делать с остальными напишем отдельно) ограничиться включенной камерой на любом устройстве.&lt;br /&gt;
# Если учебный офис не успеет ответить до контрольной (что вероятно) вы все равно можете авансом воспользоваться вариантом 3.2.&lt;br /&gt;
&lt;br /&gt;
==== Контрольная 2 ====&lt;br /&gt;
&lt;br /&gt;
Недели курса:&lt;br /&gt;
1-3&lt;br /&gt;
&lt;br /&gt;
Когда:&lt;br /&gt;
8 мая в 15:10.&lt;br /&gt;
&lt;br /&gt;
Как будет проходить:&lt;br /&gt;
# вы выключаете все соц. сети, месенджеры и прочее на всех устройствах, выключаете телефон;&lt;br /&gt;
# вы подключаетесь по зуму, включаете камеру и демонстрацию экрана;&lt;br /&gt;
# мы присылаем ссылку на яндекс.контест, состоящий из 4 задач;&lt;br /&gt;
# через 1ч 20 минут + 5 минут запаса яндекс.контест завершается.&lt;br /&gt;
&lt;br /&gt;
Правила:&lt;br /&gt;
# камера и демонстрация экрана включены в течение всей контрольной;&lt;br /&gt;
# нельзя гуглить решения заданий (увидим - засчитываем как списывание);&lt;br /&gt;
# нельзя пользоваться соц. сетями и месенджерами (нельзя общаться ни с кем, кроме как с нами в чате зума);&lt;br /&gt;
# в остальном можно пользоваться интернетом;&lt;br /&gt;
# нельзя списывать (напоминаем про ответственность за нарушение академических норм);&lt;br /&gt;
# общение (см. п. 3) приравнивается к списыванию.&lt;br /&gt;
&lt;br /&gt;
Что делать, если у вас технические проблемы, из-за которых вы не можете включить камеру и демонстрацию экрана?&lt;br /&gt;
# Вы пишете письмо об этой проблеме в учебный офис, добавляя меня и Георгия в копию.&lt;br /&gt;
# Учебный офис устанавливает, уважительная ли у вас причина.&lt;br /&gt;
# Если причина уважительная, то дальше возможны варианты:&lt;br /&gt;
##  Мы решаем с вами и учебным офисом, как поступать дальше.&lt;br /&gt;
##  Мы разрешаем вам обойтись без зума, но вы должны обеспечить запись экрана и веб-камеры на локальный компьютер, которую вы выкладываете.&lt;br /&gt;
&lt;br /&gt;
==== FAQ ====&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;Можно ли использовать бумажные конспекты?&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
- Нет.&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;OpenEdu, фото конспектов, документацию питона?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
- Да.&lt;br /&gt;
&lt;br /&gt;
- &#039;&#039;&#039;Чем карается списывание и приравниваемые к нему действия?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
- Первый раз - 0 за контрольную + докладная в учебную часть. Второй раз - 0 за курс + докладная в учебную часть.&lt;br /&gt;
&lt;br /&gt;
=== Домашнее задание ===&lt;br /&gt;
&lt;br /&gt;
Детали будут опубликованы как минимум за две недели до дедлайна.&lt;br /&gt;
&lt;br /&gt;
Дедлайн - 14 июня 23:59:59&lt;br /&gt;
&lt;br /&gt;
== Формула оценки ==&lt;br /&gt;
&lt;br /&gt;
Текущая = (0.3 * онлайн + 0.1 * КР1 + 0.1 * КР2 + 0.1 * КР3 + 0.1 * КР4 + 0.3 * ДЗ + 0.1 * Семинар)&lt;br /&gt;
&lt;br /&gt;
Оценка = мин(округл(Текущая); 10)&lt;br /&gt;
&lt;br /&gt;
Оценка &amp;quot;Семинар&amp;quot; ставится за активность на семинаре. Проверяем мы ее, попросив вас написать что-то в чат в зуме или как-то иначе отреагировать в какой-то случайный момент во время семинара. Если у вас плохо получается решать задачи, но вы активно пытаетесь тем не менее это сделать во время семинара - вы получаете баллы за активность. &lt;br /&gt;
&lt;br /&gt;
Дополнительное требование у Жени Каленковича: включена демонстарция экрана или у вас хорошая заранее озвученная причина, почему это невозможно.&lt;br /&gt;
&lt;br /&gt;
Посеминарную информацию про активность можно посмотреть [https://docs.google.com/spreadsheets/d/1Qs8voxyZVBjwjir74bjUX7yMCGiWoxtnYgAZd4jmx7I/edit?usp=sharing здесь].&lt;br /&gt;
&lt;br /&gt;
== Дополнительная помощь ==&lt;br /&gt;
&lt;br /&gt;
Задать вопросы по курсу можно на форуме LMS или в неофициальном общем чате в телеграме. По вопросу добавления в чат можно обратиться к преподавателям или учебным ассистентам.&lt;br /&gt;
&lt;br /&gt;
Будут организованы консультации в Zoom. Время консультаций будет объявлено после соответсвующего семинара.&lt;br /&gt;
&lt;br /&gt;
== DataCamp ==&lt;br /&gt;
&lt;br /&gt;
!!! В курсе использоваться не будет !!!&lt;br /&gt;
&lt;br /&gt;
DataCamp изменил правила, поэтому использовать мы его не сможем. Тем не менее, зарегистрировавшись по ссылке, которую мы вам прислали, вы получите доступ ко всем их курсам на полгода. Можете - по желанию - этим воспользоваться.&lt;br /&gt;
&lt;br /&gt;
Устаревшкая информация:&lt;br /&gt;
&lt;br /&gt;
Часть семинаров и проверочных работ будет проводиться на платформе [https://www.datacamp.com/ DataCamp]. &lt;br /&gt;
&lt;br /&gt;
О платформе (текст предоставлен DataCamp): &lt;br /&gt;
&lt;br /&gt;
This class is supported by [https://www.datacamp.com/ DataCamp], the most intuitive learning platform for data science and analytics. Learn any time, anywhere and become an expert in R, Python, SQL, and more. DataCamp’s learn-by-doing methodology combines short expert videos and hands-on-the-keyboard exercises to help learners retain knowledge. DataCamp offers 325+ courses by expert instructors on topics such as importing data, data visualization, and machine learning. They’re constantly expanding their curriculum to keep up with the latest technology trends and to provide the best learning experience for all skill levels. Join over 5 million learners around the world and close your skills gap.&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%9F%D1%81%D0%B8%D1%85%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_1_%D0%BA%D1%83%D1%80%D1%81_2019/2020&amp;diff=40892</id>
		<title>Python для извлечения и обработки данных Психология 1 курс 2019/2020</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%9F%D1%81%D0%B8%D1%85%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_1_%D0%BA%D1%83%D1%80%D1%81_2019/2020&amp;diff=40892"/>
		<updated>2020-05-05T09:31:16Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: /* Ассистенты */ добавил, что Тимур Петров - ассистент группы БПС196&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== О курсе ==&lt;br /&gt;
&amp;quot;Python для извлечения и обработки данных&amp;quot; читается на 1 курсе, в 4 модуле.&lt;br /&gt;
&lt;br /&gt;
[https://www.hse.ru/edu/courses/292681829 Карточка курса и программа]&lt;br /&gt;
&lt;br /&gt;
===Преподаватели===&lt;br /&gt;
&#039;&#039;&#039;Группы 191, 192, 193, 194&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
Преподаватель: Каленкович Евгений Евгеньевич&amp;lt;br /&amp;gt;&lt;br /&gt;
E-mail: ekalenkovich@hse.ru&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Группы 195, 196, 197&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
Преподаватель: Жуликов Георгий Александрович&amp;lt;br /&amp;gt;&lt;br /&gt;
E-mail: l8doku@gmail.com&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @l8doku&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Ассистенты===&lt;br /&gt;
&lt;br /&gt;
Петров Тимур, группа 196&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @Palladain&lt;br /&gt;
&lt;br /&gt;
Масликов Егор, группы БПС193 - БПС194&amp;lt;br /&amp;gt;&lt;br /&gt;
VK: [https://vk.com/id90262659 Масликов Егор]&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/egorkapiorka @egorkapiorka]&lt;br /&gt;
&lt;br /&gt;
Котликова Анастасия, группы 191, 192&amp;lt;br /&amp;gt;&lt;br /&gt;
VK: [https://vk.com/steeeven Котликова Анастасия] &amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/steeeven @steeeven]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Участник:Markina Daria|Маркина Дарья]], группы 195 и 197&amp;lt;br /&amp;gt;&lt;br /&gt;
Vk: [https://vk.com/markina_dasha Маркина Дарья]&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: [https://t.me/MarkinaDaria @MarkinaDaria]&lt;br /&gt;
&lt;br /&gt;
== Структура курса ==&lt;br /&gt;
&lt;br /&gt;
Рекомендуемая рабочая среда - Jupyter Notebook. Рекомендуемый способ установить Jupyter notebook - установить [https://www.anaconda.com/distribution/#download-section Anaconda].&lt;br /&gt;
&lt;br /&gt;
=== Семинары ===&lt;br /&gt;
Даты проведения семинаров:&lt;br /&gt;
&lt;br /&gt;
07.04 / 08.04&lt;br /&gt;
&lt;br /&gt;
14.04 / 15.04&lt;br /&gt;
&lt;br /&gt;
28.04 / 29.04&lt;br /&gt;
&lt;br /&gt;
19.05 / 20.05&lt;br /&gt;
&lt;br /&gt;
02.06 / 03.06&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Консультации ===&lt;br /&gt;
&lt;br /&gt;
==== С ассистентами ====&lt;br /&gt;
&lt;br /&gt;
О консультациях с ассистентнами нужно договориться с ними лично. Вы находите время, которое удобно и вам, и им - и связываетесь любым удобным вам способом.&lt;br /&gt;
&lt;br /&gt;
==== С преподавателями ====&lt;br /&gt;
&lt;br /&gt;
Формат: Zoom. &lt;br /&gt;
&lt;br /&gt;
Женя будет впускать по одному. Время на одного человека зависит от количества человек в очереди.&lt;br /&gt;
&lt;br /&gt;
Георгий будет проводить консультации открыто: любой может зайти и выйти в любое время.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Ссылки на Zoom будут присланы на корпоративную почту.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Расписание&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Консультация 1:&lt;br /&gt;
&lt;br /&gt;
11.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
Георгий: 13:40 - 15:00&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Консультация 2:&lt;br /&gt;
&lt;br /&gt;
18.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
Георгий: 13:40 - 15:00&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Консультация 2:&lt;br /&gt;
&lt;br /&gt;
25.04.2020&lt;br /&gt;
&lt;br /&gt;
Женя: 12:45-14:25&lt;br /&gt;
&lt;br /&gt;
=== Онлайн-курс ===&lt;br /&gt;
&lt;br /&gt;
Онлайн-курс доступен [https://courses.openedu.ru/courses/course-v1:hse+PYTHON_HSE+special_2020/ на openedu]&lt;br /&gt;
&lt;br /&gt;
Дедлайны онлайн-курса&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;
| 1 неделя&lt;br /&gt;
| 12.04&lt;br /&gt;
|-&lt;br /&gt;
| 2 неделя &lt;br /&gt;
| 19.04&lt;br /&gt;
|-&lt;br /&gt;
| 3 неделя&lt;br /&gt;
| 26.04&lt;br /&gt;
|- &lt;br /&gt;
| 4 неделя&lt;br /&gt;
| 14.05&lt;br /&gt;
|- &lt;br /&gt;
| 5 неделя&lt;br /&gt;
| 28.05&lt;br /&gt;
|- &lt;br /&gt;
| 6 неделя&lt;br /&gt;
| 11.06&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Контрольные ===&lt;br /&gt;
&lt;br /&gt;
Теория: &#039;&#039;&#039;две&#039;&#039;&#039; контрольные в общее для всех время (тест в выбором ответа или свободным ответом) - КР1 и КР3&lt;br /&gt;
&lt;br /&gt;
Практика: &#039;&#039;&#039;две&#039;&#039;&#039; контрольные в общее для всех время (решение задач на программирование на время) - КР2 и КР4&lt;br /&gt;
&lt;br /&gt;
Даты будут известны как минимум за неделю до проведения.&lt;br /&gt;
&lt;br /&gt;
=== Домашнее задание ===&lt;br /&gt;
&lt;br /&gt;
Детали будут опубликованы как минимум за две недели до дедлайна.&lt;br /&gt;
&lt;br /&gt;
Дедлайн - 14 июня 23:59:59&lt;br /&gt;
&lt;br /&gt;
== Формула оценки ==&lt;br /&gt;
&lt;br /&gt;
Текущая = (0.3 * онлайн + 0.1 * КР1 + 0.1 * КР2 + 0.1 * КР3 + 0.1 * КР4 + 0.3 * ДЗ + 0.1 * Семинар)&lt;br /&gt;
&lt;br /&gt;
Оценка = мин(округл(Текущая); 10)&lt;br /&gt;
&lt;br /&gt;
Оценка &amp;quot;Семинар&amp;quot; ставится за активность на семинаре. Проверяем мы ее, попросив вас написать что-то в чат в зуме или как-то иначе отреагировать в какой-то случайный момент во время семинара. Если у вас плохо получается решать задачи, но вы активно пытаетесь тем не менее это сделать во время семинара - вы получаете баллы за активность. &lt;br /&gt;
&lt;br /&gt;
Дополнительное требование у Жени Каленковича: включена демонстарция экрана или у вас хорошая заранее озвученная причина, почему это невозможно.&lt;br /&gt;
&lt;br /&gt;
Посеминарную информацию про активность можно посмотреть [https://docs.google.com/spreadsheets/d/1Qs8voxyZVBjwjir74bjUX7yMCGiWoxtnYgAZd4jmx7I/edit?usp=sharing здесь].&lt;br /&gt;
&lt;br /&gt;
== Дополнительная помощь ==&lt;br /&gt;
&lt;br /&gt;
Задать вопросы по курсу можно на форуме LMS или в неофициальном общем чате в телеграме. По вопросу добавления в чат можно обратиться к преподавателям или учебным ассистентам.&lt;br /&gt;
&lt;br /&gt;
Будут организованы консультации в Zoom. Время консультаций будет объявлено после соответсвующего семинара.&lt;br /&gt;
&lt;br /&gt;
== DataCamp ==&lt;br /&gt;
&lt;br /&gt;
!!! В курсе использоваться не будет !!!&lt;br /&gt;
&lt;br /&gt;
DataCamp изменил правила, поэтому использовать мы его не сможем. Тем не менее, зарегистрировавшись по ссылке, которую мы вам прислали, вы получите доступ ко всем их курсам на полгода. Можете - по желанию - этим воспользоваться.&lt;br /&gt;
&lt;br /&gt;
Устаревшкая информация:&lt;br /&gt;
&lt;br /&gt;
Часть семинаров и проверочных работ будет проводиться на платформе [https://www.datacamp.com/ DataCamp]. &lt;br /&gt;
&lt;br /&gt;
О платформе (текст предоставлен DataCamp): &lt;br /&gt;
&lt;br /&gt;
This class is supported by [https://www.datacamp.com/ DataCamp], the most intuitive learning platform for data science and analytics. Learn any time, anywhere and become an expert in R, Python, SQL, and more. DataCamp’s learn-by-doing methodology combines short expert videos and hands-on-the-keyboard exercises to help learners retain knowledge. DataCamp offers 325+ courses by expert instructors on topics such as importing data, data visualization, and machine learning. They’re constantly expanding their curriculum to keep up with the latest technology trends and to provide the best learning experience for all skill levels. Join over 5 million learners around the world and close your skills gap.&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%9F%D1%81%D0%B8%D1%85%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_1_%D0%BA%D1%83%D1%80%D1%81_2019/2020&amp;diff=39950</id>
		<title>Python для извлечения и обработки данных Психология 1 курс 2019/2020</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%9F%D1%81%D0%B8%D1%85%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_1_%D0%BA%D1%83%D1%80%D1%81_2019/2020&amp;diff=39950"/>
		<updated>2020-04-01T16:24:39Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: Добавление информации об ассистентах&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== О курсе ==&lt;br /&gt;
&amp;quot;Python для извлечения и обработки данных&amp;quot; читается на 1 курсе, в 4 модуле.&lt;br /&gt;
&lt;br /&gt;
[https://www.hse.ru/edu/courses/292681829 Карточка курса и программа]&lt;br /&gt;
&lt;br /&gt;
===Преподаватели===&lt;br /&gt;
&#039;&#039;&#039;Группы 191, 192, 193, 194&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
Преподаватель: Каленкович Евгений Евгеньевич&amp;lt;br /&amp;gt;&lt;br /&gt;
E-mail: ekalenkovich@hse.ru&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Группы 195, 196, 197&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
Преподаватель: Жуликов Георгий Александрович&amp;lt;br /&amp;gt;&lt;br /&gt;
E-mail: l8doku@gmail.com&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @l8doku&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Ассистенты===&lt;br /&gt;
&lt;br /&gt;
Петров Тимур&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @Palladain&lt;br /&gt;
&lt;br /&gt;
Масликов Егор&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @egorkapiorka&lt;br /&gt;
&lt;br /&gt;
Котликова Анастасия&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @steeeven&lt;br /&gt;
&lt;br /&gt;
Маркина Дарья&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @MarkinaDaria&lt;br /&gt;
&lt;br /&gt;
== Структура курса ==&lt;br /&gt;
&lt;br /&gt;
Рекомендуемая рабочая среда - Jupyter Notebook.&lt;br /&gt;
&lt;br /&gt;
=== Семинары ===&lt;br /&gt;
Даты проведения семинаров:&lt;br /&gt;
&lt;br /&gt;
07.04 / 08.04&lt;br /&gt;
&lt;br /&gt;
14.04 / 15.04&lt;br /&gt;
&lt;br /&gt;
28.04 / 29.04&lt;br /&gt;
&lt;br /&gt;
19.05 / 20.05&lt;br /&gt;
&lt;br /&gt;
02.06 / 03.06&lt;br /&gt;
&lt;br /&gt;
=== Онлайн-курс ===&lt;br /&gt;
&lt;br /&gt;
Онлайн-курс доступен по ссылке [https://openedu.ru/course/hse/PYTHON https://openedu.ru/course/hse/PYTHON]&lt;br /&gt;
&lt;br /&gt;
Дедлайны онлайн-курса&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;
| 1 неделя&lt;br /&gt;
| 12.04&lt;br /&gt;
|-&lt;br /&gt;
| 2 неделя &lt;br /&gt;
| 19.04&lt;br /&gt;
|-&lt;br /&gt;
| 3 неделя&lt;br /&gt;
| 26.04&lt;br /&gt;
|- &lt;br /&gt;
| 4 неделя&lt;br /&gt;
| 14.05&lt;br /&gt;
|- &lt;br /&gt;
| 5 неделя&lt;br /&gt;
| 28.05&lt;br /&gt;
|- &lt;br /&gt;
| 6 неделя&lt;br /&gt;
| 11.06&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Контрольные ===&lt;br /&gt;
&lt;br /&gt;
Теория: &#039;&#039;&#039;две&#039;&#039;&#039; контрольные в общее для всех время (тест в выбором ответа или свободным ответом) - КР1 и КР3&lt;br /&gt;
&lt;br /&gt;
Практика: &#039;&#039;&#039;две&#039;&#039;&#039; контрольные в общее для всех время (решение задач на программирование на время) - КР2 и КР4&lt;br /&gt;
&lt;br /&gt;
Даты будут известны как минимум за неделю до проведения.&lt;br /&gt;
&lt;br /&gt;
=== Домашнее задание ===&lt;br /&gt;
&lt;br /&gt;
Детали будут опубликованы как минимум за две недели до дедлайна.&lt;br /&gt;
&lt;br /&gt;
Дедлайн - 14 июня 23:59:59&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Формула оценки ==&lt;br /&gt;
&lt;br /&gt;
Текущая = (0.3 * онлайн + 0.1 * КР1 + 0.1 * КР2 + 0.1 * КР3 + 0.1 * КР4 + 0.3 * ДЗ + 0.1 * Семинар)&lt;br /&gt;
&lt;br /&gt;
Оценка = мин(округл(Текущая); 10)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Дополнительная помощь ==&lt;br /&gt;
&lt;br /&gt;
Задать вопросы по курсу можно на форуме LMS или в неофициальном общем чате в телеграме. По вопросу добавления в чат можно обратиться к преподавателям или учебным ассистентам.&lt;br /&gt;
&lt;br /&gt;
Будут организованы консультации в Zoom. Время консультаций будет объявлено после соответсвующего семинара.&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
	<entry>
		<id>https://wiki.cs.hse.ru/index.php?title=Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%9F%D1%81%D0%B8%D1%85%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_1_%D0%BA%D1%83%D1%80%D1%81_2019/2020&amp;diff=39938</id>
		<title>Python для извлечения и обработки данных Психология 1 курс 2019/2020</title>
		<link rel="alternate" type="text/html" href="https://wiki.cs.hse.ru/index.php?title=Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%9F%D1%81%D0%B8%D1%85%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_1_%D0%BA%D1%83%D1%80%D1%81_2019/2020&amp;diff=39938"/>
		<updated>2020-03-31T11:18:44Z</updated>

		<summary type="html">&lt;p&gt;Gzhulikov: Создание страницы&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== О курсе ==&lt;br /&gt;
&amp;quot;Python для извлечения и обработки данных&amp;quot; читается на 1 курсе, в 4 модуле.&lt;br /&gt;
&lt;br /&gt;
[https://www.hse.ru/edu/courses/292681829 Карточка курса и программа]&lt;br /&gt;
&lt;br /&gt;
==Преподаватели==&lt;br /&gt;
&#039;&#039;&#039;Группы 191, 192, 193, 194&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
Преподаватель: Каленкович Евгений Евгеньевич&amp;lt;br /&amp;gt;&lt;br /&gt;
E-mail: ekalenkovich@hse.ru&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Группы 195, 196, 197&#039;&#039;&#039;&amp;lt;br /&amp;gt;&lt;br /&gt;
Преподаватель: Жуликов Георгий Александрович&amp;lt;br /&amp;gt;&lt;br /&gt;
E-mail: l8doku@gmail.com&amp;lt;br /&amp;gt;&lt;br /&gt;
Telegram: @l8doku&amp;lt;br /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Структура курса ==&lt;br /&gt;
&lt;br /&gt;
Рекомендуемая рабочая среда - Jupyter Notebook.&lt;br /&gt;
&lt;br /&gt;
=== Семинары ===&lt;br /&gt;
Даты проведения семинаров:&lt;br /&gt;
&lt;br /&gt;
07.04 / 08.04&lt;br /&gt;
&lt;br /&gt;
14.04 / 15.04&lt;br /&gt;
&lt;br /&gt;
28.04 / 29.04&lt;br /&gt;
&lt;br /&gt;
19.05 / 20.05&lt;br /&gt;
&lt;br /&gt;
02.06 / 03.06&lt;br /&gt;
&lt;br /&gt;
=== Онлайн-курс ===&lt;br /&gt;
&lt;br /&gt;
Онлайн-курс доступен по ссылке [https://openedu.ru/course/hse/PYTHON https://openedu.ru/course/hse/PYTHON]&lt;br /&gt;
&lt;br /&gt;
Дедлайны онлайн-курса&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;
| 1 неделя&lt;br /&gt;
| 12.04&lt;br /&gt;
|-&lt;br /&gt;
| 2 неделя &lt;br /&gt;
| 19.04&lt;br /&gt;
|-&lt;br /&gt;
| 3 неделя&lt;br /&gt;
| 26.04&lt;br /&gt;
|- &lt;br /&gt;
| 4 неделя&lt;br /&gt;
| 14.05&lt;br /&gt;
|- &lt;br /&gt;
| 5 неделя&lt;br /&gt;
| 28.05&lt;br /&gt;
|- &lt;br /&gt;
| 6 неделя&lt;br /&gt;
| 11.06&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Контрольные ===&lt;br /&gt;
&lt;br /&gt;
Теория: &#039;&#039;&#039;две&#039;&#039;&#039; контрольные в общее для всех время (тест в выбором ответа или свободным ответом) - КР1 и КР3&lt;br /&gt;
&lt;br /&gt;
Практика: &#039;&#039;&#039;две&#039;&#039;&#039; контрольные в общее для всех время (решение задач на программирование на время) - КР2 и КР4&lt;br /&gt;
&lt;br /&gt;
Даты будут известны как минимум за неделю до проведения.&lt;br /&gt;
&lt;br /&gt;
=== Домашнее задание ===&lt;br /&gt;
&lt;br /&gt;
Детали будут опубликованы как минимум за две недели до дедлайна.&lt;br /&gt;
&lt;br /&gt;
Дедлайн - 14 июня 23:59:59&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Формула оценки ==&lt;br /&gt;
&lt;br /&gt;
Текущая = (0.3 * онлайн + 0.1 * КР1 + 0.1 * КР2 + 0.1 * КР3 + 0.1 * КР4 + 0.3 * ДЗ + 0.1 * Семинар)&lt;br /&gt;
&lt;br /&gt;
Оценка = мин(округл(Текущая); 10)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Дополнительная помощь ==&lt;br /&gt;
&lt;br /&gt;
Задать вопросы по курсу можно на форуме LMS или в неофициальном общем чате в телеграме. По вопросу добавления в чат можно обратиться к преподавателям или учебным ассистентам.&lt;br /&gt;
&lt;br /&gt;
Будут организованы консультации в Zoom. Время консультаций будет объявлено после соответсвующего семинара.&lt;/div&gt;</summary>
		<author><name>Gzhulikov</name></author>
	</entry>
</feed>