Wiki - Факультет компьютерных наук - Вклад [ru]

Introduction to programming DSBA 2019/2020

2019-10-15T20:35:58Z

SergeiGarshin:

== Notifications ==

== Teachers and assistants ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 191 !! 192 !! 193
|-
|| Lecturer
| colspan="3" | [https://www.hse.ru/en/staff/voznesenskaya Voznesenskaya T.V.]
[mailto:tvoznesenskaya@hse.ru tvoznesenskaya@hse.ru] , tg: [https://tlgg.ru/tvozn @tvozn]
|-
|| Workshop Instructor
|| Piatskii G.G. [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru] , tg: [https://tlgg.ru/p_george @p_george] 
Chuvilina A.A. [mailto:chuvilinaann@list.ru chuvilinaann@list.ru] , tg: [https://tlgg.ru/chuvilinaann @chuvilinaann]
|| Rudakov K.A. [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]
|| Tatarnikov A.D. [mailto:atatarnikov@hse.ru atatarnikov@hse.ru] , tg: [https://tlgg.ru/andrewt0301 @andrewt0301] 
Zhulikov G. [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]
|-
| rowspan="2" | Assistant
|| Azat Kalmykov [mailto:azotx12345@gmail.com azotx12345@gmail.com] , tg: [https://tlgg.ru/Azatik1000 @Azatik1000]
|| Sergei Garshin [mailto:sagarshin@edu.hse.ru sagarshin@edu.hse.ru] , tg: [https://tlgg.ru/Sergei_Garshin @Sergei_Garshin]
|| Lev Sushkevich [mailto:lasushkevich@edu.hse.ru lasushkevich@edu.hse.ru] , tg: [https://tlgg.ru/leviusss @leviusss]
|-
| colspan="3" | Egor Polyakov [mailto:evpolyakov@edu.hse.ru evpolyakov@edu.hse.ru] , tg: [https://tlgg.ru/poegva @poegva]
|}

== Grading system ==

The ultimate grade G for the whole course is calculated as: '''G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)''' 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.

The final grade P1 for the first part is calculated as follows: '''P1 = 0.4 · E1 + 0.6 · OA1''' 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.

The final grade P2 for the second part is calculated as follows: '''P2 = 0.4 · E2 + 0.6 · OA2''' where E2 is a grade of the second part exam, which takes place at the end of the quartile 3 (semester B), OA2 is an ongoing assessment grade of the second part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities.

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: '''OA = max([10 · (RP + BP) / RPmax ], 10)''' where, RPmax denotes the maximum possible number of points that can be taken during the module.

Regular points are granted for contests (1 per task) and control works. Bonus points are granted for extra homework (1 per task), presentations on one of the course-related topics (up to 5), quizzes at the lecture (1 per quiz), activity at almost all workshops (up to 10) and working at the board during the workshop (0.5/1).

== Lecture notes ==

'''[https://drive.google.com/file/d/1OBX1O0fX3MxNp9HZhITSG9_jxDhqFcP_/view Lecture 1: Introduction]'''

'''[https://drive.google.com/file/d/1qnjtBVWd6cOVOJjNPTgDHoIBCW8K4YS3/view Lecture 2: Simple data types. Dynamic typing. Operations of sequence's, selection, and iteration.]'''

'''[https://drive.google.com/file/d/1icJ4NzS6lUolyfCi5GhjMKNvkAE6vPjR/view Lecture 3: Real numbers. Python data types. Strings.]'''

'''[https://drive.google.com/file/d/1QvAziX24tP1GRBCP2MO57C8XGKFgJMWw/view Lecture 4: Strings. Tkinter GUI.]'''

'''[https://drive.google.com/file/d/1p7H-vsX80F5lOAA9HQv8v5qvOvLZ9tw_/view Lecture 5: Functions and recursion.]'''

'''[https://drive.google.com/file/d/13bZu-J3f0lHQ-2XATjYjDxevuufSu-_d/view Lecture 6: Lists & tuples]'''

'''[https://drive.google.com/file/d/1Rhl3-rk8lNIJyi0V6UP8lRw8dHJRA0jR/view Lecture 7: Files. Zen of python.]'''

'''[https://drive.google.com/file/d/17PNeuKHiGgyULTanTcNGDYgAEMNcUg5Z/view Lecture 9: Sets & Dictionaries.]'''

'''[https://drive.google.com/file/d/1fhbF1wZdH_6WrHCikfljyqjp3neZdO_V/view Lecture 10: Sorting algorithms]'''

== Workshop notes ==
''' [https://www.youtube.com/watch?v=5rSBPGGLkW0 PyCharm tutorial (video)]'''

'''[http://bit.ly/2lRZlVR Workshop 1]'''

'''[http://bit.ly/2lMhuEC Workshop 2]'''

'''[http://bit.ly/2kBtHvP Workshop 3]'''

'''[http://bit.ly/2mhpYE1 Workshop 4]'''

'''[http://bit.ly/2ns7Xnf Workshop 5]'''

'''[https://drive.google.com/file/d/1y_teAfZXsYVkvB1dDWKIBczOLsrsTmWE/view Workshop 6]'''

'''[https://drive.google.com/file/d/1yVNHxpWxR9UmGV4ArK3KfSdigsJV6uRT/view Workshop 7]'''

'''[http://bit.ly/2kpoeId RegExp*]'''

'''[http://bit.ly/2mPIUtX Pandas*]'''

'''[http://bit.ly/2oKINRn Visualisation*]'''

'''[http://bit.ly/33htjDb BeautifulSoup & BoW*]'''

== Homeworks ==

=== Contests ===

{| class="wikitable"
|-
! Number !! Contest !! Deadline
|-
| 1 || [https://official.contest.yandex.com/contest/13850 Contest 1] || 24.09.2019 23:59
|-
| 2 || [https://official.contest.yandex.com/contest/13993 Contest 2] || 01.10.2019 23:59
|-
| 3 || [https://official.contest.yandex.com/contest/14193 Contest 3] || 09.10.2019 23:59
|-
| 4 || [https://official.contest.yandex.com/contest/14397 Contest 4] || 16.10.2019 23:59
|-
| 5 || [https://official.contest.yandex.com/contest/14547 Contest 5] || 20.10.2019 23:59
|-
| 6 || [https://official.contest.yandex.com/contest/14682 Contest 6] || 20.10.2019 23:59
|}

=== Results ===

[https://docs.google.com/spreadsheets/d/1CCH4DZs6QaGds1jP728LWNex_nPiz3U85cefXwvLneg/edit?hl=en Results]

=== Other ===

'''Bonus points possibility (up to 3 points). Deadline 27.09.2019 23:59.''' Take one of your own programs from the Contests 1 or 2. Add code for GUI with the aid of Tkinter, which contains (somewhere): number of contest, name of task from this contest (letter.name), your surname. Send it to the teaching assistant Egor Polyakov ([mailto:evpolyakov@edu.hse.ru evpolyakov@edu.hse.ru] , tg: [https://tlgg.ru/poegva @poegva]) by 27.09.2019 23:59. Assessment: 1 – all, which are described above, is done; 2 – your GUI contains more than 1 elements or some interaction; 3 – your GUI is impressing (while remaining simple).

== Syllabus ==

'''[https://www.hse.ru/data/2019/09/06/1491591843/program-2879332837-agdwCch1lC.pdf Course syllabus at HSE website]'''

Introduction to programming DSBA 2019/2020

2019-10-15T20:31:33Z

SergeiGarshin:

== Notifications ==

== Teachers and assistants ==
{| class="wikitable" style="text-align:center"
|-
! Group !! 191 !! 192 !! 193
|-
|| Lecturer
| colspan="3" | [https://www.hse.ru/en/staff/voznesenskaya Voznesenskaya T.V.]
[mailto:tvoznesenskaya@hse.ru tvoznesenskaya@hse.ru] , tg: [https://tlgg.ru/tvozn @tvozn]
|-
|| Workshop Instructor
|| Piatskii G.G. [mailto:piatskgeorge@mail.ru piatskgeorge@mail.ru] , tg: [https://tlgg.ru/p_george @p_george] 
Chuvilina A.A. [mailto:chuvilinaann@list.ru chuvilinaann@list.ru] , tg: [https://tlgg.ru/chuvilinaann @chuvilinaann]
|| Rudakov K.A. [mailto:rudakovkirillx@gmail.com rudakovkirillx@gmail.com] , tg: [https://tlgg.ru/ArcticBEARD @ArcticBEARD]
|| Tatarnikov A.D. [mailto:atatarnikov@hse.ru atatarnikov@hse.ru] , tg: [https://tlgg.ru/andrewt0301 @andrewt0301] 
Zhulikov G. [mailto:l8doku@gmail.com l8doku@gmail.com] , tg: [https://tlgg.ru/l8doku @l8doku]
|-
| rowspan="2" | Assistant
|| Azat Kalmykov [mailto:azotx12345@gmail.com azotx12345@gmail.com] , tg: [https://tlgg.ru/Azatik1000 @Azatik1000]
|| Sergei Garshin [mailto:sagarshin@edu.hse.ru sagarshin@edu.hse.ru] , tg: [https://tlgg.ru/Sergei_Garshin @Sergei_Garshin]
|| Lev Sushkevich [mailto:lasushkevich@edu.hse.ru lasushkevich@edu.hse.ru] , tg: [https://tlgg.ru/leviusss @leviusss]
|-
| colspan="3" | Egor Polyakov [mailto:evpolyakov@edu.hse.ru evpolyakov@edu.hse.ru] , tg: [https://tlgg.ru/poegva @poegva]
|}

== Grading system ==

The ultimate grade G for the whole course is calculated as: '''G = 0.7 · min(P1, P2) + 0.3 · max(P1, P2)''' 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.

The final grade P1 for the first part is calculated as follows: '''P1 = 0.4 · E1 + 0.6 · OA1''' 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.

The final grade P2 for the second part is calculated as follows: '''P2 = 0.4 · E2 + 0.6 · OA2''' where E2 is a grade of the second part exam, which takes place at the end of the quartile 3 (semester B), OA2 is an ongoing assessment grade of the second part (both 10-point scale). The ongoing assessment OA measures participant’s performance throughout all classes and involves various types of activities.

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: '''OA = max([10 · (RP + BP) / RPmax ], 10)''' where, RPmax denotes the maximum possible number of points that can be taken during the module.

Regular points are granted for contests (1 per task) and control works. Bonus points are granted for extra homework (1 per task), presentations on one of the course-related topics (up to 5), quizzes at the lecture (1 per quiz), activity at almost all workshops (up to 10) and working at the board during the workshop (0.5/1).

== Lecture notes ==

'''[https://drive.google.com/file/d/1OBX1O0fX3MxNp9HZhITSG9_jxDhqFcP_/view Lecture 1: Introduction]'''

'''[https://drive.google.com/file/d/1qnjtBVWd6cOVOJjNPTgDHoIBCW8K4YS3/view Lecture 2: Simple data types. Dynamic typing. Operations of sequence's, selection, and iteration.]'''

'''[https://drive.google.com/file/d/1icJ4NzS6lUolyfCi5GhjMKNvkAE6vPjR/view Lecture 3: Real numbers. Python data types. Strings.]'''

'''[https://drive.google.com/file/d/1QvAziX24tP1GRBCP2MO57C8XGKFgJMWw/view Lecture 4: Strings. Tkinter GUI.]'''

'''[https://drive.google.com/file/d/1p7H-vsX80F5lOAA9HQv8v5qvOvLZ9tw_/view Lecture 5: Functions and recursion.]'''

'''[https://drive.google.com/file/d/13bZu-J3f0lHQ-2XATjYjDxevuufSu-_d/view Lecture 6: Lists & tuples]'''

'''[https://drive.google.com/file/d/1Rhl3-rk8lNIJyi0V6UP8lRw8dHJRA0jR/view Lecture 7: Files. Zen of python.]'''

'''[https://drive.google.com/file/d/17PNeuKHiGgyULTanTcNGDYgAEMNcUg5Z/view Lecture 9: Sets & Dictionaries.]'''

'''[https://drive.google.com/file/d/1fhbF1wZdH_6WrHCikfljyqjp3neZdO_V/view Lecture 10: Sorting algorithms]'''

== Workshop notes ==
''' [https://www.youtube.com/watch?v=5rSBPGGLkW0 PyCharm tutorial (video)]'''

'''[http://bit.ly/2lRZlVR Workshop 1]'''

'''[http://bit.ly/2lMhuEC Workshop 2]'''

'''[http://bit.ly/2kBtHvP Workshop 3]'''

'''[http://bit.ly/2mhpYE1 Workshop 4]'''

'''[http://bit.ly/2ns7Xnf Workshop 5]'''

'''[https://drive.google.com/file/d/1y_teAfZXsYVkvB1dDWKIBczOLsrsTmWE/view Workshop 6]'''

'''[https://drive.google.com/file/d/1yVNHxpWxR9UmGV4ArK3KfSdigsJV6uRT/view Workshop 7]'''

'''[http://bit.ly/2kpoeId RegExp*]'''

'''[http://bit.ly/2mPIUtX Pandas*]'''

'''[http://bit.ly/2oKINRn Visualisation*]'''

'''[http://bit.ly/33htjDb BeautifulSoup & BoW*]'''

== Homeworks ==

=== Contests ===

{| class="wikitable"
|-
! Number !! Contest !! Deadline
|-
| 1 || [https://official.contest.yandex.com/contest/13850 Contest 1] || 24.09.2019 23:59
|-
| 2 || [https://official.contest.yandex.com/contest/13993 Contest 2] || 01.10.2019 23:59
|-
| 3 || [https://official.contest.yandex.com/contest/14193 Contest 3] || 09.10.2019 05:00
|-
| 4 || [https://official.contest.yandex.com/contest/14397 Contest 4] || 16.10.2019 23:59
|-
| 5 || [https://official.contest.yandex.com/contest/14547 Contest 5] || 20.10.2019 23:59
|-
| 6 || [https://official.contest.yandex.com/contest/14682 Contest 6] || 20.10.2019 23:59
|}

=== Results ===

[https://docs.google.com/spreadsheets/d/1CCH4DZs6QaGds1jP728LWNex_nPiz3U85cefXwvLneg/edit?hl=en Results]

=== Other ===

'''Bonus points possibility (up to 3 points). Deadline 27.09.2019 23:59.''' Take one of your own programs from the Contests 1 or 2. Add code for GUI with the aid of Tkinter, which contains (somewhere): number of contest, name of task from this contest (letter.name), your surname. Send it to the teaching assistant Egor Polyakov ([mailto:evpolyakov@edu.hse.ru evpolyakov@edu.hse.ru] , tg: [https://tlgg.ru/poegva @poegva]) by 27.09.2019 23:59. Assessment: 1 – all, which are described above, is done; 2 – your GUI contains more than 1 elements or some interaction; 3 – your GUI is impressing (while remaining simple).

== Syllabus ==

'''[https://www.hse.ru/data/2019/09/06/1491591843/program-2879332837-agdwCch1lC.pdf Course syllabus at HSE website]'''