Algorithms and Data Structures DSBA 2024/25 — различия между версиями
Aspronina (обсуждение | вклад) м |
Nkmakarov (обсуждение | вклад) м (Update lectures) |
||
| Строка 37: | Строка 37: | ||
== Lecture Materials == | == Lecture Materials == | ||
'''Sep 7''' | '''Sep 7''' | ||
| + | * Introduction to the course | ||
| + | * Asymptotic notation | ||
| + | * Sorting algorithms: insertion sort, merge sort, heap sort (including building a heap) | ||
| + | * Lower bounds of sorting | ||
| + | * Counting sort | ||
| + | * Radix sort | ||
| + | ''Bibliography'': Cormen, ch. 2, 3, 6, 8 | ||
==List of topics for exam in module 1== | ==List of topics for exam in module 1== | ||
Версия 20:33, 7 сентября 2024
Содержание
About
This page contains basic information for the course Algorithms and Data Structures in 2024/2025 academic year at Bachelor’s Programme in Data Science and Business Analytics (DSBA).
The full syllabus can be accessed at this page.
In case you find any inconsistencies on this page, please, contact @l_AnnaPronina_l.
Teachers and assistants
| Group | 231 | 232 | 233 | 234 | |
|---|---|---|---|---|---|
| Lecturer | Nikita Makarov | ||||
| Seminar Instructor | Andrey Borevskiy | Andrey Borevskiy | Vladimir Kurenkov | Vladimir Kurenkov | |
| Teaching Assistant | Belikov Daniil tg: @DanBel1kov |
Latyshev Ivan tg: @ne_bespokoity |
Pavlov Leonid tg: @leon1dl |
Gadaev Isa tg: @elohimapproximation | |
| Head TA | Pronina Anna tg: @l_AnnaPronina_l | ||||
Lectures
Lectures are held on Saturdays from 14:40 till 17:40.
Lecture Materials
Sep 7
- Introduction to the course
- Asymptotic notation
- Sorting algorithms: insertion sort, merge sort, heap sort (including building a heap)
- Lower bounds of sorting
- Counting sort
- Radix sort
Bibliography: Cormen, ch. 2, 3, 6, 8
List of topics for exam in module 1
List of topics for exam in module 4
Grading
Final Grade = M1 * 0.3 + M4 * 0.7
Mi = E * 0.4 + HW * 0.2 + Q * 0.2 + S * 0.2
- E - exam grade: rational number [0, 10] = sum of the grade for the oral and written parts, out of 5 each
- HW - homework grade: rational number [0, 10]
- Q - lecture quizzes grade: rational number [0, 10]
- S - seminar practice grade: rational number [0, 10]
rounding: each element in the formulae is rounded up
Plagiarism policy
If plagiarism is detected, the assessment element will be assigned a score of 0.
If the student is suspected of preparing the task not on his own, the teacher has the right to initiate additional verification or defense of this particular assessment element. Then such an assessment element will be graded based on the additional verification or the defense.
