Skip to content

Commit

Permalink
Initial point with full course info
Browse files Browse the repository at this point in the history
  • Loading branch information
IvanSol committed Oct 4, 2023
1 parent 115621a commit d92d2d7
Show file tree
Hide file tree
Showing 2 changed files with 63 additions and 26 deletions.
1 change: 1 addition & 0 deletions .gitignore
Original file line number Diff line number Diff line change
Expand Up @@ -129,3 +129,4 @@ dmypy.json
.pyre/

.idea
_ignored
88 changes: 62 additions & 26 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -2,20 +2,55 @@

### Semester content:

| Week | Content | Slides | Contest | Soft Deadline |
|:------:|:-----------------------|:---------------------------------------------------------------------------:|:-----------------------------------------------------------:|:----------------------:|
[ContestID_W01]: https://contest.yandex.ru/contest/<CID>/?lang=en
[ContestID_W02]: https://contest.yandex.ru/contest/<CID>/?lang=en
[ContestID_W03]: https://contest.yandex.ru/contest/<CID>/?lang=en
[ContestID_W04]: https://contest.yandex.ru/contest/<CID>/?lang=en
[ContestID_W05]: https://contest.yandex.ru/contest/<CID>/?lang=en
[ContestID_W06]: https://contest.yandex.ru/contest/<CID>/?lang=en
[ContestID_W07]: https://contest.yandex.ru/contest/<CID>/?lang=en
[ContestID_W08]: https://contest.yandex.ru/contest/<CID>/?lang=en
[ContestID_W09]: https://contest.yandex.ru/contest/<CID>/?lang=en
[ContestID_W10]: https://contest.yandex.ru/contest/<CID>/?lang=en

[WarmUp_test_W01]: https://forms.gle/<form_id>
[WarmUp_test_W02]: https://forms.gle/<form_id>
[WarmUp_test_W03]: https://forms.gle/<form_id>
[WarmUp_test_W04]: https://forms.gle/<form_id>
[WarmUp_test_W05]: https://forms.gle/<form_id>
[WarmUp_test_W06]: https://forms.gle/<form_id>
[WarmUp_test_W07]: https://forms.gle/<form_id>
[WarmUp_test_W08]: https://forms.gle/<form_id>
[WarmUp_test_W09]: https://forms.gle/<form_id>
[WarmUp_test_W10]: https://forms.gle/<form_id>
[WarmUp_test_W11]: https://forms.gle/<form_id>

[Slides_W01]: ../master/week01_sorting_algorithms/MSAI.2021.Algo.W01.slides.pdf
[Slides_W02]: ../master/week02_binary_search/MSAI.2021.Algo.W02.slides.pdf
[Slides_W03]: ../master/week03_basic_data_structures/MSAI.2021.Algo.W03.slides.pdf
[Slides_W04]: ../master/week04_dynamic_programming/MSAI.2021.Algo.W04.slides.pdf
[Slides_W05]: ../master/week05_knapsack/MSAI.2021.Algo.W05.slides.pdf
[Slides_W06]: ../master/week06_kmp_heap/MSAI.2021.Algo.W06.slides.pdf
[Slides_W07]: ../master/week07_dfs_bfs/MSAI.2021.Algo.W07.slides.pdf
[Slides_W08]: ../master/week08_shortest_paths/MSAI.2021.Algo.W08.slides.pdf
[Slides_W09]: ../master/week09_rsq_rmq/MSAI.2021.Algo.W09.slides.pdf
[Slides_W10]: ../master/week10_hashing/MSAI.2021.Algo.W10.slides.pdf
[Slides_W11]: ../master/week11_binary_search_tree/MSAI.2021.Algo.W11.slides.pdf

| Week | Content | Slides | WarmUp test | Contest | Soft Deadline |
|:------:|:-----------------------|:--------------------:|:-----------------------:|:------------------------:|:----------------------:|
<!---
| 01 | Sorting algorithms | [Slides](../master/week01_sorting_algorithms/MSAI.2021.Algo.W01.slides.pdf) | [Contest](https://contest.yandex.ru/contest/<ID>/?lang=en) | 25.10.2021 19:00 GMT+3 |
| 02 | Binary search | [Slides](../master/week01_sorting_algorithms/MSAI.2021.Algo.W02.slides.pdf) | [Contest](https://contest.yandex.ru/contest/<ID>/?lang=en) | 25.10.2021 19:00 GMT+3 |
| 03 | Basic Data sturctures | [Slides](../master/week01_sorting_algorithms/MSAI.2021.Algo.W03.slides.pdf) | [Contest](https://contest.yandex.ru/contest/<ID>/?lang=en) | 01.11.2021 19:00 GMT+3 |
| 04 | Dynamic programming | [Slides](../master/week01_sorting_algorithms/MSAI.2021.Algo.W04.slides.pdf) | [Contest](https://contest.yandex.ru/contest/<ID>/?lang=en) | 08.11.2021 19:00 GMT+3 |
| 05 | Knapsack problem | [Slides](../master/week01_sorting_algorithms/MSAI.2021.Algo.W05.slides.pdf) | [Contest](https://contest.yandex.ru/contest/<ID>/?lang=en) | 15.11.2021 19:00 GMT+3 |
| 06 | KMP & Heap | [Slides](../master/week01_sorting_algorithms/MSAI.2021.Algo.W06.slides.pdf) | [Contest](https://contest.yandex.ru/contest/<ID>/?lang=en) | 22.11.2021 19:00 GMT+3 |
| 07 | DFS & BFS | [Slides](../master/week01_sorting_algorithms/MSAI.2021.Algo.W07.slides.pdf) | [Contest](https://contest.yandex.ru/contest/<ID>/?lang=en) | 29.11.2021 19:00 GMT+3 |
| 08 | Shortest paths | [Slides](../master/week01_sorting_algorithms/MSAI.2021.Algo.W08.slides.pdf) | [Contest](https://contest.yandex.ru/contest/<ID>/?lang=en) | 06.12.2021 19:00 GMT+3 |
| 09 | RSQ & RMQ | [Slides](../master/week01_sorting_algorithms/MSAI.2021.Algo.W09.slides.pdf) | [Contest](https://contest.yandex.ru/contest/<ID>/?lang=en) | 13.12.2021 19:00 GMT+3 |
| 10 | Hashing | [Slides](../master/week01_sorting_algorithms/MSAI.2021.Algo.W10.slides.pdf) | [Contest](https://contest.yandex.ru/contest/<ID>/?lang=en) | 20.12.2021 19:00 GMT+3 |
| 11 | Binary Search Tree | [Slides](../master/week01_sorting_algorithms/MSAI.2021.Algo.W11.slides.pdf) | None | None |
| 01 | Sorting algorithms | [Slides][Slides_W01] | [Test][WarmUp_test_W01] | [Contest][ContestID_W01] | ??.10.2021 19:30 GMT+3 |
| 02 | Binary search | [Slides][Slides_W02] | [Test][WarmUp_test_W02] | [Contest][ContestID_W02] | ??.11.2021 19:00 GMT+3 |
| 03 | Basic Data sturctures | [Slides][Slides_W03] | [Test][WarmUp_test_W03] | [Contest][ContestID_W03] | ??.11.2021 19:00 GMT+3 |
| 04 | Dynamic programming | [Slides][Slides_W04] | [Test][WarmUp_test_W04] | [Contest][ContestID_W04] | ??.11.2021 19:00 GMT+3 |
| 05 | Knapsack problem | [Slides][Slides_W05] | [Test][WarmUp_test_W05] | [Contest][ContestID_W05] | ??.11.2021 19:00 GMT+3 |
| 06 | KMP & Heap | [Slides][Slides_W06] | [Test][WarmUp_test_W06] | [Contest][ContestID_W06] | ??.11.2021 19:00 GMT+3 |
| 07 | DFS & BFS | [Slides][Slides_W07] | [Test][WarmUp_test_W07] | [Contest][ContestID_W07] | ??.12.2021 19:00 GMT+3 |
| 08 | Shortest paths | [Slides][Slides_W08] | [Test][WarmUp_test_W08] | [Contest][ContestID_W08] | ??.12.2021 19:00 GMT+3 |
| 09 | RSQ & RMQ | [Slides][Slides_W09] | [Test][WarmUp_test_W09] | [Contest][ContestID_W09] | ??.12.2021 19:00 GMT+3 |
| 10 | Hashing | [Slides][Slides_W10] | [Test][WarmUp_test_W10] | [Contest][ContestID_W10] | ??.12.2021 19:00 GMT+3 |
| 11 | Binary Search Tree | [Slides][Slides_W11] | None | None | None |
--->

<!--- Strict deadline for all home assignments is 25.01.2021 20:00 GMT+3. --->
Expand All @@ -30,6 +65,20 @@ You will have **practical** and **theoretical** exams.
Information about **theoretical exam** can be found [here](<link>).
--->


### Final grade:
Final grade **`G`** consists of three parts:

- Homework grade: **`H`** is an integer number within range [0; 10] (rules given below).

- Practical exam grade: **`P`** is an integer number within range [0; 10] (rules will be provided later).

- Theoretical exam grade: **`T`** is an integer number within range [0; 10] (rules will be provided later).

Your final grade is:
<pre><b>G</b> = ceil(0.6 <b>H</b> + 0.2 <b>P</b> + 0.2 <b>T</b>)</pre>


### Homework grade
Homework grade contributes the most into final grade. To increase homework grade you should solve problems from home assignments.

Expand All @@ -49,16 +98,3 @@ Scores for a problem:
- 0 otherwise

`hw_maximum_score` is total number of problems in all home asignments.


### Final grade:
Final grade **`G`** consists of three parts:

- Homework grade: **`H`** is an integer number within range [0; 10] (rules given above).

- Practical exam grade: **`P`** is an integer number within range [0; 10] (rules will be provided later).

- Theoretical exam grade: **`T`** is an integer number within range [0; 10] (rules will be provided later).

Your final grade is:
<pre><b>G</b> = ceil(0.6 <b>H</b> + 0.2 <b>P</b> + 0.2 <b>T</b>)</pre>

0 comments on commit d92d2d7

Please sign in to comment.