Python Programming DSBA 2024/25 — различия между версиями

Материал из Wiki - Факультет компьютерных наук
Перейти к: навигация, поиск
м
м
 
(не показано 8 промежуточных версии этого же участника)
Строка 50: Строка 50:
 
|-
 
|-
 
|| [https://official.contest.yandex.ru/contest/71421/enter/ Contest 7] || 1 dec 2024, 23:59:59  || Algorithms and Data Structures
 
|| [https://official.contest.yandex.ru/contest/71421/enter/ Contest 7] || 1 dec 2024, 23:59:59  || Algorithms and Data Structures
 +
|-
 +
|| [https://official.contest.yandex.ru/contest/72037/enter/ Contest 8] || 15 dec 2024, 23:59:59 || Functional programming
 +
|-
 +
|| [https://official.contest.yandex.ru/contest/72758/enter/ Contest 9] || 17 dec 2024, 23:59:59 || OOP (✨bonus for all groups✨)
 
|}
 
|}
  
Строка 102: Строка 106:
 
|| Contest 7 ||
 
|| Contest 7 ||
 
no special requirements 🥳
 
no special requirements 🥳
 +
|-
 +
|| Contest 8 ||
 +
no special requirements 🥳
 +
|-
 +
|| Contest 9 ||
 +
'''#1 (А):''' the constructor must copy the list of lists, when changing the lists from which the matrix was designed, the contents of the matrix should not change <br>
 +
'''#2 (B):''' the methods should not change the contents of the matrix  <br>
 +
'''#3 (C):''' 1) the '''transpose''' method modifies the instance of the Matrix class;  2) the '''transposed''' method must be static  <br>
 +
'''#6 (F):''' use fast power <br>
 
|}
 
|}
  
Строка 148: Строка 161:
 
|-
 
|-
 
| 21 oct || [https://drive.google.com/file/d/11vyr3xNCIch1vhb7NlCEGfMyOoj2kv57/view?usp=sharing Lecture 8] || Sorting and searching
 
| 21 oct || [https://drive.google.com/file/d/11vyr3xNCIch1vhb7NlCEGfMyOoj2kv57/view?usp=sharing Lecture 8] || Sorting and searching
 +
|-
 +
| 11 nov || [https://drive.google.com/file/d/1gehUbWtGopnJy-HE7XgVScGIK5FyqTT9/view?usp=drivesdk Lecture 9] || Numpy and Pandas
 +
|-
 +
| 18 nov || [https://drive.google.com/file/d/1hl5_9FIpmjf5tKi4JVesMgKEMwZM2eRr/view?usp=drivesdk Lecture 10] || Data structures
 +
|-
 +
| 25 nov || [https://drive.google.com/file/d/1S5Qq3GwtXXGCcySvS4EfzH7tQ8EpJtjq/view?usp=sharing Lecture 11] || Data visualisation
 +
|-
 +
| 28 nov || [https://drive.google.com/file/d/1ZL2cGbDHnTBekiubkmp6y20w6nVUADRc/view?usp=sharing Lecture 12] || Functional programming 
 
|}
 
|}
  
 
=== Workshop notebooks ===
 
=== Workshop notebooks ===
  
−
All the workshop notebooks may be found by [https://drive.google.com/drive/u/0/folders/1PLuiTOEMbLQKS2nE1FrDIgN7IsnQXS7j this link].
+
All the workshop notebooks may be found by [https://drive.google.com/drive/u/0/folders/1eF0VLME0DiTe0exZ4mu_xC11ITDa7NX_ this link].
  
 
==Control work==
 
==Control work==
Строка 165: Строка 186:
  
 
== Exam ==
 
== Exam ==
 +
 +
Your exam will be conducted on '''Saturday, December 21, at 14:40''' in the '''offline''' format.
 +
 +
All the details you can find [[Python Programming DSBA 2024/25 / Exam|here]].
  
 
== Syllabus ==   
 
== Syllabus ==   
 
https://www.hse.ru/ba/data/courses/936176275.html
 
https://www.hse.ru/ba/data/courses/936176275.html

Текущая версия на 12:07, 21 декабря 2024

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

caption

Contests

Contest Deadline Topic
Contest 1 22 sep 2024, 23:59:59 Arithmetics
Contest 2 29 sep 2024, 23:59:59 While, float, string
Contest 3 6 oct 2024, 23:59:59 Lists and tuples
Contest 4 13 oct 2024, 23:59:59 Functions
Contest 5 20 oct 2024, 23:59:59 Sets and Dictionaries
Contest 6 10 nov 2024, 23:59:59 Sorting and Searching
Contest 7 1 dec 2024, 23:59:59 Algorithms and Data Structures
Contest 8 15 dec 2024, 23:59:59 Functional programming
Contest 9 17 dec 2024, 23:59:59 OOP (✨bonus for all groups✨)

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 🥳

Contest 6

#1: do not use additional lists, do not change the list
#3: complexity O(n)
#4: complexity O(n)
#5: do not use in-built functions, implement Counting Sort Algorithm
#10: do not use in-built functions, complexity O(len(A)+len(B))
#11: do not store the contents of the whole file in memory, only one line at a time
#13: do not store the contents of the whole file in memory, only one line at a time

Contest 7

no special requirements 🥳

Contest 8

no special requirements 🥳

Contest 9

#1 (А): the constructor must copy the list of lists, when changing the lists from which the matrix was designed, the contents of the matrix should not change
#2 (B): the methods should not change the contents of the matrix
#3 (C): 1) the transpose method modifies the instance of the Matrix class; 2) the transposed method must be static
#6 (F): use fast power

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 notes and Workshop materials

Lecture slides

Date Lecture Topic
5 sep Lecture 1 Introduction
9 sep Lecture 2 Numeral systems. Real numbers. Strings
16 sep Lecture 3 Lists and tuples
30 sep Lecture 4 Functions and recursion
30 sep Lecture 5 Sets and dictionaries
7 oct Lecture 6 Exceptions and errors
7 oct Lecture 7 PEP-8
21 oct Lecture 8 Sorting and searching
11 nov Lecture 9 Numpy and Pandas
18 nov Lecture 10 Data structures
25 nov Lecture 11 Data visualisation
28 nov Lecture 12 Functional programming

Workshop notebooks

All the workshop notebooks may 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.

Project

All the information regarding your course project can be found by accessing this page.

Exam

Your exam will be conducted on Saturday, December 21, at 14:40 in the offline format.

All the details you can find here.

Syllabus

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

Источник — «http://wiki.cs.hse.ru/index.php?title=Python_Programming_DSBA_2024/25&oldid=88691»