Data Structures and Algorithms 2022 — различия между версиями
Izaharov (обсуждение | вклад) (→Grading system) |
Izaharov (обсуждение | вклад) (→Class materials) |
||
| Строка 49: | Строка 49: | ||
|- | |- | ||
| 3.2 | | 3.2 | ||
| − | | | + | | Binary search |
| − | | | + | | Contest TBA |
| 27.10.2022 | | 27.10.2022 | ||
|- | |- | ||
| 4.1 | | 4.1 | ||
| − | | | + | | Segment trees |
| − | | | + | | Problem set & contest TBA |
| 01.11.2022 | | 01.11.2022 | ||
|- | |- | ||
| 4.2 | | 4.2 | ||
| − | | | + | | Remembering Dijkstra |
| − | | | + | | Contest TBA |
| 03.11.2022 | | 03.11.2022 | ||
|- | |- | ||
| 4.3 | | 4.3 | ||
| − | | | + | | Remembering Dijkstra 2 |
| − | | | + | | |
| 05.11.2022 | | 05.11.2022 | ||
|- | |- | ||
| 5.1 | | 5.1 | ||
| − | | | + | | Dynamic programming 1 |
| − | | TBA | + | | Problem set TBA |
| 08.11.2022 | | 08.11.2022 | ||
|- | |- | ||
| 5.2. | | 5.2. | ||
| − | | | + | | Dynamic programming 2 |
| − | | TBA | + | | Contest TBA |
| 10.11.2022 | | 10.11.2022 | ||
|- | |- | ||
| 5.3 | | 5.3 | ||
| − | | | + | | Dynamic programming 3 |
| − | | TBA | + | | Problem set TBA |
| 12.11.2022 | | 12.11.2022 | ||
|- | |- | ||
| − | | 6.1 | + | | 6.1 |
| − | | | + | | Test 1 |
| − | | | + | | |
| 15.11.2022 | | 15.11.2022 | ||
|- | |- | ||
| 6.2 | | 6.2 | ||
| − | | | + | | Hashing 1 |
| − | | TBA | + | | Problem set TBA |
| 17.11.2022 | | 17.11.2022 | ||
| + | |- | ||
| + | | 6.3<br /> | ||
| + | | Hashing 2 | ||
| + | | Contest TBA | ||
| + | | 19.11.2022 | ||
|- | |- | ||
| 7.1<br /> | | 7.1<br /> | ||
| − | | | + | | String algorithms 1 |
| TBA | | TBA | ||
| 22.11.2022 | | 22.11.2022 | ||
|- | |- | ||
| 7.2 | | 7.2 | ||
| − | | | + | | String algorithms 2 |
| TBA | | TBA | ||
| 24.11.2022 | | 24.11.2022 | ||
|- | |- | ||
| 7.3 | | 7.3 | ||
| − | | | + | | Graph algorithms 1 |
| − | | TBA | + | | Contest TBA |
| 26.11.2022 | | 26.11.2022 | ||
|- | |- | ||
| 8.1<br /> | | 8.1<br /> | ||
| − | | | + | | Graph algorithms 2 |
| TBA | | TBA | ||
| 29.11.2022 | | 29.11.2022 | ||
|- | |- | ||
| 8.2 | | 8.2 | ||
| − | | | + | | Test 2 |
| − | | | + | | |
| 01.12.2022 | | 01.12.2022 | ||
| + | |- | ||
| + | | 8.3 | ||
| + | | Project presentations & zachet | ||
| + | | | ||
| + | | 03.12.2022 | ||
|} | |} | ||
Версия 12:14, 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 | Binary search | Contest TBA | 27.10.2022 |
| 4.1 | Segment trees | Problem set & contest TBA | 01.11.2022 |
| 4.2 | Remembering Dijkstra | Contest TBA | 03.11.2022 |
| 4.3 | Remembering Dijkstra 2 | 05.11.2022 | |
| 5.1 | Dynamic programming 1 | Problem set TBA | 08.11.2022 |
| 5.2. | Dynamic programming 2 | Contest TBA | 10.11.2022 |
| 5.3 | Dynamic programming 3 | Problem set TBA | 12.11.2022 |
| 6.1 | Test 1 | 15.11.2022 | |
| 6.2 | Hashing 1 | Problem set TBA | 17.11.2022 |
| 6.3 |
Hashing 2 | Contest TBA | 19.11.2022 |
| 7.1 |
String algorithms 1 | TBA | 22.11.2022 |
| 7.2 | String algorithms 2 | TBA | 24.11.2022 |
| 7.3 | Graph algorithms 1 | Contest TBA | 26.11.2022 |
| 8.1 |
Graph algorithms 2 | TBA | 29.11.2022 |
| 8.2 | Test 2 | 01.12.2022 | |
| 8.3 | Project presentations & zachet | 03.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)
- the final grade is calculated as a minimum of sum and 10
- project option: practical & uses algorithms from the course; the subject needs to be discussed with Ilya by 01.11.2022
