Data Structures and Algorithms 2022 — различия между версиями

Материал из Public ATP Wiki
Перейти к: навигация, поиск
(Новая страница: «Test»)
 
(→‎Class materials)
 
(не показано 12 промежуточных версий 2 участников)
Строка 1: Строка 1:
−
Test
+
= General Info =
 +
* 2nd Semester
 +
* Grading system: check below
 +
* all inquiries to [https://t.me/ilya101010 @ilya101010]
 +
 
 +
= Class materials =
 +
 
 +
* Classwork/homework deadline is in two weeks after the class.
 +
* TBA means "to be announced" -- wait till the class :)
 +
* Contest means programming contest; problem set means math problem set.
 +
* [https://drive.google.com/drive/folders/1cjYsKrjdV8OIxH5Aoc775emJDfwq8QDm?usp=share_link Google Drive]
 +
 
 +
{| class="wikitable"
 +
|- style="font-weight:bold;"
 +
! Subject
 +
! Classwork / homework
 +
! Date
 +
|-
 +
| Introduction
 +
|
 +
| 08.10.2022
 +
|-
 +
| Graph theory: representation
 +
| See 1.2
 +
| 13.10.2022
 +
|-
 +
| Remembering BFS<br />
 +
| [https://contest.yandex.ru/contest/41169/enter Contest 1]<br />
 +
| 15.10.2022
 +
|-
 +
| Remembering DFS<br />
 +
| [https://contest.yandex.ru/contest/41542/enter Contest 2]<br />
 +
| 18.10.2022
 +
|-
 +
| Asymptotics & master-theorem
 +
| Problem set 1 (deadline: 04.11)
 +
| 20.10.2022
 +
|-
 +
| Sorting algorithms 1
 +
| rowspan="2" | Problem set 2 (deadline: 15.11)
 +
| 29.10.2022
 +
|-
 +
| QuickSelect, deterministic QuickSort, LSD
 +
| 01.11.2022<br />
 +
|-
 +
| Heaps (binary)
 +
| rowspan="2" | Problem set 3 (deadline: 27.11)
 +
| 03.11.2022
 +
|-
 +
| Heaps (cont., binomial) + test 1
 +
| 08.11.2022
 +
|-
 +
| Hashing 1
 +
| rowspan="2" | Problem set 4 TBA (deadline: 01.11)
 +
| 10.11.2022
 +
|-
 +
| Hashing 2
 +
| 15.11.2022
 +
|-
 +
| Numerical algorithms: overview
 +
|
 +
| 17.11.2022
 +
|-
 +
| Amortized analysis
 +
| rowspan="2" | Problem set 5 TBA (deadline: 05.12)
 +
| 22.11.2022
 +
|-
 +
| Segment trees, fractional cascading
 +
| 24.12.2022
 +
|-
 +
| Test 2
 +
| Contest 3 TBA (deadline: 06.12)
 +
| 29.11.2022
 +
|-
 +
| Persistency, segment tree modifications<br />
 +
|
 +
| 01.12.2022
 +
|-
 +
| Fenwick tree
 +
|
 +
| 06.12.2022
 +
|-
 +
| Final "zachet"
 +
|
 +
| 08.12.2022
 +
|}
 +
 
 +
= Grading system =
 +
* 3 points for contests
 +
* 3 points for problem sets
 +
* 3 points for tests
 +
* 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

Текущая версия на 17:55, 14 ноября 2022

General Info

  • 2nd Semester
  • Grading system: check below
  • all inquiries to @ilya101010

Class materials

  • Classwork/homework deadline is in two weeks after the class.
  • TBA means "to be announced" -- wait till the class :)
  • Contest means programming contest; problem set means math problem set.
  • Google Drive
Subject Classwork / homework Date
Introduction 08.10.2022
Graph theory: representation See 1.2 13.10.2022
Remembering BFS
 Contest 1
 15.10.2022
Remembering DFS
 Contest 2
 18.10.2022
Asymptotics & master-theorem Problem set 1 (deadline: 04.11) 20.10.2022
Sorting algorithms 1 Problem set 2 (deadline: 15.11) 29.10.2022
QuickSelect, deterministic QuickSort, LSD 01.11.2022
Heaps (binary) Problem set 3 (deadline: 27.11) 03.11.2022
Heaps (cont., binomial) + test 1 08.11.2022
Hashing 1 Problem set 4 TBA (deadline: 01.11) 10.11.2022
Hashing 2 15.11.2022
Numerical algorithms: overview 17.11.2022
Amortized analysis Problem set 5 TBA (deadline: 05.12) 22.11.2022
Segment trees, fractional cascading 24.12.2022
Test 2 Contest 3 TBA (deadline: 06.12) 29.11.2022
Persistency, segment tree modifications
 01.12.2022
Fenwick tree 06.12.2022
Final "zachet" 08.12.2022

Grading system

  • 3 points for contests
  • 3 points for problem sets
  • 3 points for tests
  • 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
Источник — «http://wiki.atp-fivt.org/index.php?title=Data_Structures_and_Algorithms_2022&oldid=1356»