C++ Programming Language DSBA 2024/25
Материал из Wiki - Факультет компьютерных наук
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 | Gordenko M.K. mgordenko@hse.ru, tg: @mgordenko | ||||||
| Workshop Instructor Module 3 |
241-1, 241-2: Rudakov K.A. tg: @ArcticBEARD |
242-1, 242-2: Rudakov K.A. tg: @ArcticBEARD |
243-1: Yartsev M.S. tg: @Mischay 243-2: Shershakov S.A. tg: @sshersh |
244-1: Shershakov S.A. tg: @sshersh 244-1: Ovchinnikov S.A. tg: @serov0305 |
245-1: Gordenko M.K. tg: @mgordenko 245-2: Ignatov A.D. tg: @and_ignatov |
246-1: Kopylov I.S. tg: @DanielWalker 246-2: Gordenko M.K. tg: @mgordenko | |
| Workshop Instructor Module 4 |
243-1: Yartsev M.S. tg: @Mischay 243-2: Ovchinnikov S.A. tg: @serov0305 |
244-1, 244-2: Kopylov I.S. tg: @DanielWalker | |||||
| 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
0.3 * Exam + 0.2 * Colloquium + 0.2 * Midterm+ 0.2 * Homework + 0.1 Lecture_quizzes
| Date | Duration | Description | |
|---|---|---|---|
| Exam | during the 4 module exam session (20-30 June) | 120 min | Offline Test from the theoretical part + tasks in Yandex.Contest |
| Colloquium | in the 4th module | TBA | Offline An oral colloquium on the course material, where you will be given three questions that you need to answer. You may also be asked to write a small piece of code |
| Midterm | in the 3rd module | 90 min | Offline 5 tasks in the Yandex.Contest |
| Homework | weekly after the lecture | 1 week | Tasks in Yandex.Contest The mark for this control element is calculated as an average of all homework grades |
| Lecture_quizzes | weekly during the lecture | ~10 min | Offline Small test on paper The mark for this control element is calculated as an average of all quizzes grades |
AI and plagiarism policy
❗️The use of AI is strictly prohibited within the course (except for our helping bot 🙂)
❗️In case of plagiarism, one task nullifies the entire work
Defences
You may be asked to defend your solutions. This means that you are to discuss what you have done in your work with a seminar instructor or a TA.
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 not show up on the defense, you automatically get 0 points for the work that was about to be discussed.
Contests
| Contest | Type | Deadline |
|---|---|---|
| Contest 1 | Individual | 26 jan 2025, 23:59:59 |
| Contest 2 | Individual | 2 feb 2025, 23:59:59 |
| Contest 3 | Individual | 9 feb 2025, 23:59:59 |
| Contest 4 | Individual | 16 feb 2025, 23:59:59 |
| Contest 5 | Individual | 24 feb 2025, 23:59:59 |
| Contest 6 | Individual | 4 mar 2025, 23:59:59 |
| Contest 7 | Individual | 11 mar 2025, 23:59:59 |
| Contest 8 | Individual | 18 mar 2025, 23:59:59 |
| Contest 9 | Individual | 24 mar 2025, 23:59:59 |
| Contest 10 | Individual | 1 apr 2025, 23:59:59 |
| Contest 11 | ||
| Contest 12 | ||
| Contest 13 | ||
| Contest 14 | ||
| Contest 15 | ||
| Contest 16 | ||
| Contest 17 | ||
| Contest 18 | ||
| Contest 19 | ||
| Contest 20 |
Contest restrictions
| Contest | Special requirements |
|---|---|
| Contest 1 | #2: do not use conditionals, do not use loops |
| Contest 2 | #1: do not use if structures, complexity O(n) |
| Contest 3 | #3: should be solved using bitwise operations #5: sorting is prohibited #10: should be solved using bitwise operations |
| Contest 4 | Carefully read decomposition requirements for each of the problems! + #3: read the file character by character, that is, without saving the file or its individual lines in memory |
| Contest 5 | #6: implement quadratic sorting, function prototype looks like Sort(int* begin, int* end) |
| Contest 6 | #2: do not use an additional array, try to minimize the total number of operations. |
| Contest 7 | no special requirements 🥳 |
| Contest 8 | |
| Contest 9 | |
| Contest 10 | |
| Contest 11 | |
| Contest 12 | |
| Contest 13 | |
| Contest 14 | |
| Contest 15 | |
| Contest 16 | |
| Contest 17 | |
| Contest 18 | |
| Contest 19 | |
| Contest 20 |
Grades
The results table with all your grades can be found by this link.
Course materials
Lecture slides
| Date | Lecture | Topic |
|---|---|---|
| 15 jan | Lecture 0 | About the course |
| 15 jan | Lecture 1 | Introduction to the C++ language |
| 22 jan | Lecture 2 | Loops and conditionals |
| 29 jan | Lecture 3 | Expressions, operations and operators |
| 5 feb | Lecture 4 | Functions and procedures |
| 12 feb | Lecture 5 | Pointers and arrays |
| 19 feb | Lecture 6 | Arrays |
| 26 feb | Lecture 7 | Functions. Callback and templates. Files |
Workshops
A repository for practical lecture examples and seminar codes can be found by this link.
Control work
The midterm will be conducted on TBA in the offline format.
All the details you can find here.
