Python Programming DSBA 2023/24 — различия между версиями
Tvozn (обсуждение | вклад) |
Tvozn (обсуждение | вклад) (→Lecture notes) |
||
Строка 133: | Строка 133: | ||
|- | |- | ||
| 13 nov || [https://drive.google.com/file/d/1RhwsgnD7uOcd2TCADXyL71VL4ioMilWF/view?usp=sharing Example ] || Titanic | | 13 nov || [https://drive.google.com/file/d/1RhwsgnD7uOcd2TCADXyL71VL4ioMilWF/view?usp=sharing Example ] || Titanic | ||
− | | | + | |} |
− | + | ||
− | } | + | |
== Workshop notes == | == Workshop notes == |
Версия 08:42, 13 ноября 2023
In case you find any inconsistencies on this page, please, contact @l_AnnaPronina_l.
Содержание
[убрать]Teachers and assistants
Group | 231 | 232 | 233 | 234 | 235 | |
---|---|---|---|---|---|---|
Lecturer | Voznesenskaya T.V.
tvoznesenskaya@hse.ru , tg: @tvozn | |||||
Workshop Instructor | 231-1: Rudakov K.A. tg: @ArcticBEARD 231-2: Smirnov I.V. tg: @JanKrig |
232-1: Rudakov K.A. tg: @ArcticBEARD 232-2: Smirnov I.V. tg: @JanKrig |
233-1, 233-2: Kopylov I.S. tg: @DanielWalker |
234-1: Dovgopolyi I.A. tg: @TriariiMisha 234-2: Ivanov A.P. tg: @Olenek0 |
235-1, 235-2: Rudakov K.A. tg: @ArcticBEARD | |
Teaching Assistant | 231-1: Pronina Anna tg: @l_AnnaPronina_l 231-2: Kulakov Denis tg: @Kulakov_Denis |
232-1: Pronina Anna tg: @l_AnnaPronina_l 232-2: Kulakov Denis tg: @Kulakov_Denis |
233-1, 233-2: Shakhmin Pavel tg: @rotanimoddFPV |
234-1, 234-2: Argirov George tg: @gotchaya |
235-1, 235-2: Valami Benyamin tg: @MaxmilesV | |
Head TA | Pronina Anna tg: @l_AnnaPronina_l |
Grading system
Contests
Contest | Deadline | Topic |
---|---|---|
Contest 1 | 24 sep 2023, 23:59:59 | Arithmetics |
Contest 2 | 1 oct 2023, 23:59:59 | While, float, strings |
Contest 3 | 9 oct 2023, 23:59:59 | Lists and tuples |
Contest 4 | 16 oct 2023, 23:59:59 | Functions |
Contest 5 | 23 oct 2023, 23:59:59 | Sets and dictionaries |
Contest 6 | 6 nov 2023, 23:59:59 | Sorting and searching |
Contest Restrictions
Contest | Special Requirements |
---|---|
Contest 1 |
#18: use +, -, *, /, //, %, ** only |
Contest 2 |
#11: do not use conditionals, do not use loops |
Contest 3 |
#10: do not change the initial list |
Contest 4 |
In all problems of this contest, please, make sure that the function's name, |
Contest 5 |
no special requirements |
Contest 6 |
#1: do not change initial list, do not use additional lists, one pass through the list only |
Defences
You may be asked to defend your HW solutions. This means that you are invited to discuss what you have done in your work with a seminar instructor or a TA. The defenses take places offline, the time is scheduled independently each time with consideration of the both sides’ timetables. You will be notified about the upcoming event in the direct messages in Telegram.
During the defence you may be asked to:
- explain your solution
- modify your code with correspondence to some new conditions stated by the instructor/assistant
- solve the same or a similar problem either on paper or in IDE - it is up to the instructor/assistant’s choice
- identify (recognize) your solution among some others
- etc.
Please, take into account that if you do no show up on the defense, you automatically get 0 points for the contest that was about to be discussed.
Grades
The results table with all your grades can be found by this link.
Lecture notes
Date | Lecture | Topic | |
---|---|---|---|
11 sep | Lecture 1 | Introduction | |
18 sep | Lecture 2 | Numeral systems. Real numbers. Strings | |
25 sep | Lecture 3 | Lists and tuples | |
2 oct | Lecture 4 | Functions and recursion | |
16 oct | Lecture 5 | Sorting and searching algorithms | |
13 nov | Example | Titanic |
Workshop notes
Workshop 1: Introduction
Workshop 2: Numeral systems
for pilot students: Workshops 2-3: Conditions and Loops
Workshop 3: Conditions and Loops
Workshop 4: Strings
Workshops 5-6: Lists and Tuples
Workshops 7-8: List Comprehension
Workshops 9-10: Functions and Recursion
Workshop 11: Sets and Dictionaries
Workshop 12: Sets and Dictionaries
Control work
The midterm will be conducted on Monday, October 23, at 18:10 in the offline format.
All the details you can find here.