Python Programming DSBA 2024/25

In case you find any inconsistencies on this page, please, contact @l_AnnaPronina_l.

Teachers and assistants

Group	241	242	243	244	245	246
Lecturer	Voznesenskaya T.V. tvoznesenskaya@hse.ru, tg: @tvozn
Workshop Instructor	241-1, 241-2: Rudakov K.A. tg: @ArcticBEARD	242-1, 242-2: Rudakov K.A. tg: @ArcticBEARD	243-1, 243-2: Kopylov I.S. tg: @DanielWalker	244-1, 244-2: Kopylov I.S. tg: @DanielWalker	245-1: Dovgopolyi I.A. tg: @TriariiMisha 245-2: Yartsev M.S. tg: @Mischay	246-1, 246-2: Chechulina L.M. tg: @love_chechulina
Teaching Assistant	Shakhmin Pavel tg: @rotanimoddFPV		Argirov George tg: @gotchaya		Khudyakov Nikita tg: @wildwoolywander	Kulakov Denis tg: @Kulakov_Denis
Head TA	Pronina Anna tg: @l_AnnaPronina_l

Grading system

Contests

Contest	Deadline	Topic
Contest 1	22 sep 2023, 23:59:59	Arithmetics
Contest 2	29 sep 2023, 23:59:59	While, float, string
Contest 3	6 oct 2023, 23:59:59	Lists and tuples
Contest 4	13 oct 2023, 23:59:59	Functions
Contest 5	13 oct 2023, 23:59:59	Sets and Dictionaries

Contest Restrictions

Contest	Special Requirements
Contest 1	#18: do not use nonlinear constructions: branches, cycles, functions
Contest 2	#11: do not use conditionals, do not use loops #13: do not use conditionals, do not use loops #17: do not use loops, do not use .count()
Contest 3	#1: do not perform unnecessary actions #10: do not change the list #11: you must change the list #14: you must change the list #15: you must change the list, you are not allowed to use additional lists #16: you must change the list, you are not allowed to use additional lists and .insert() #20: you must change the list, you can do only one pass through the list, you are not allowed to use additional lists
Contest 4	In all problems of this contest, please, make sure that the function's name, parameters and return type correspond to the problem statement #8: do not use pow(), do not use loops, do not use ** #9: complexity O(sqrt(n)) #10: complexity O(sqrt(n)) #11: do not use pow(), do not use ** #12: use +1 and -1 only, do not use loops #13: complexity O(log(n)) #16: do not use loops, recursion is obligatory #18: do not use lists, strings or similar data structures #19: do not use lists, strings or similar data structures
Contest 5	no special requirements 🥳

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.

In case of plagiarism, one task nullifies the entire work.

If (in % of full mark) Contests - CW(midterm) >= 50 then RP for сontests (all with the deadlines earlier, then CW) will be divided by 2.

Grades

The results table with all your grades can be found by this link.

Lecture & Workshop notes

All the course's materials can be found by this link.

Control work

The midterm will be conducted on Monday, October 14, at 9:30 in the offline format.

All the details you can find here.

Syllabus

https://www.hse.ru/ba/data/courses/936176275.html