Data Structures and Algorithms 2022: различия между версиями
Перейти к навигации
Перейти к поиску
Izaharov (обсуждение | вклад) Новая страница: «Test» |
Izaharov (обсуждение | вклад) Нет описания правки |
||
| Строка 1: | Строка 1: | ||
= General Info = | |||
* 2nd Semester | |||
* Grading system: check below | |||
* all inquiries to [https://t.me/ilya101010 @ilya101010] | |||
= Class materials = | |||
{| class="wikitable" | |||
|- style="font-weight:bold;" | |||
! # | |||
! Subject | |||
! Classwork / homework | |||
! Date | |||
|- | |||
| 0 | |||
| Introduction | |||
| | |||
| 08.10.2022 | |||
|- | |||
| 1.1 | |||
| Graph theory: representation | |||
| See 1.2 | |||
| 13.10.2022 | |||
|- | |||
| 1.2 | |||
| Remembering BFS<br /> | |||
| [https://contest.yandex.ru/contest/41169/enter Contest 1]<br /> | |||
| 15.10.2022 | |||
|- | |||
| 2.1<br /> | |||
| Remembering DFS<br /> | |||
| Contest TBA | |||
| 18.10.2022 | |||
|- | |||
| 2.2 | |||
| Asymptotics & master-theorem | |||
| Problem set TBA | |||
| 20.10.2022 | |||
|- | |||
| 2.3 | |||
| Sorting algorithms 1 | |||
| Problem set TBA | |||
| 22.10.2022 | |||
|- | |||
| 3.1 | |||
| Sorting algorithms 2 | |||
| Contest TBA | |||
| 25.10.2022 | |||
|- | |||
| 3.2 | |||
| Segment trees | |||
| Problem set & contest TBA | |||
| 27.10.2022 | |||
|- | |||
| 4.1 | |||
| Remembering Dijkstra | |||
| Contest TBA | |||
| 01.11.2022 | |||
|- | |||
| 4.2 | |||
| Dynamic programming 1 | |||
| Problem set TBA | |||
| 03.11.2022 | |||
|- | |||
| 4.3 | |||
| Dynamic programming 2 | |||
| Contest TBA | |||
| 05.11.2022 | |||
|- | |||
| 5.1 | |||
| TBA | |||
| TBA | |||
| 08.11.2022 | |||
|- | |||
| 5.2. | |||
| TBA | |||
| TBA | |||
| 10.11.2022 | |||
|- | |||
| 5.3 | |||
| TBA | |||
| TBA | |||
| 12.11.2022 | |||
|- | |||
| 6.1<br /> | |||
| TBA | |||
| TBA | |||
| 15.11.2022 | |||
|- | |||
| 6.2 | |||
| TBA | |||
| TBA | |||
| 17.11.2022 | |||
|- | |||
| 7.1<br /> | |||
| TBA | |||
| TBA | |||
| 22.11.2022 | |||
|- | |||
| 7.2 | |||
| TBA | |||
| TBA | |||
| 24.11.2022 | |||
|- | |||
| 7.3 | |||
| TBA | |||
| TBA | |||
| 26.11.2022 | |||
|- | |||
| 8.1<br /> | |||
| TBA | |||
| TBA | |||
| 29.11.2022 | |||
|- | |||
| 8.2 | |||
| TBA | |||
| TBA | |||
| 01.12.2022 | |||
|} | |||
= Grading system = | |||
* 5 points for contests | |||
* 5 points for problem sets | |||
* 2 points for attendance | |||
* 3 points for "zachet" in the end of semester (optional) | |||
* project option: practical & uses algorithms from the course; the subject needs to be discussed with Ilya by 01.11.2022 | |||
Версия от 08:31, 17 октября 2022
General Info
- 2nd Semester
- Grading system: check below
- all inquiries to @ilya101010
Class materials
| # | Subject | Classwork / homework | Date |
|---|---|---|---|
| 0 | Introduction | 08.10.2022 | |
| 1.1 | Graph theory: representation | See 1.2 | 13.10.2022 |
| 1.2 | Remembering BFS |
Contest 1 |
15.10.2022 |
| 2.1 |
Remembering DFS |
Contest TBA | 18.10.2022 |
| 2.2 | Asymptotics & master-theorem | Problem set TBA | 20.10.2022 |
| 2.3 | Sorting algorithms 1 | Problem set TBA | 22.10.2022 |
| 3.1 | Sorting algorithms 2 | Contest TBA | 25.10.2022 |
| 3.2 | Segment trees | Problem set & contest TBA | 27.10.2022 |
| 4.1 | Remembering Dijkstra | Contest TBA | 01.11.2022 |
| 4.2 | Dynamic programming 1 | Problem set TBA | 03.11.2022 |
| 4.3 | Dynamic programming 2 | Contest TBA | 05.11.2022 |
| 5.1 | TBA | TBA | 08.11.2022 |
| 5.2. | TBA | TBA | 10.11.2022 |
| 5.3 | TBA | TBA | 12.11.2022 |
| 6.1 |
TBA | TBA | 15.11.2022 |
| 6.2 | TBA | TBA | 17.11.2022 |
| 7.1 |
TBA | TBA | 22.11.2022 |
| 7.2 | TBA | TBA | 24.11.2022 |
| 7.3 | TBA | TBA | 26.11.2022 |
| 8.1 |
TBA | TBA | 29.11.2022 |
| 8.2 | TBA | TBA | 01.12.2022 |
Grading system
- 5 points for contests
- 5 points for problem sets
- 2 points for attendance
- 3 points for "zachet" in the end of semester (optional)
- project option: practical & uses algorithms from the course; the subject needs to be discussed with Ilya by 01.11.2022