Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/girafe-ai/msai-algorithms

Open course on Algorithms and Data Structures
https://github.com/girafe-ai/msai-algorithms

algorithms computer-science data-structures data-structures-and-algorithms python

Last synced: 3 months ago
JSON representation

Open course on Algorithms and Data Structures

Host: GitHub
URL: https://github.com/girafe-ai/msai-algorithms
Owner: girafe-ai
License: mit
Created: 2020-10-05T17:24:13.000Z (over 4 years ago)
Default Branch: master
Last Pushed: 2024-11-05T11:12:40.000Z (3 months ago)
Last Synced: 2024-11-05T12:38:46.821Z (3 months ago)
Topics: algorithms, computer-science, data-structures, data-structures-and-algorithms, python
Language: Python
Homepage:
Size: 26.7 MB
Stars: 27
Watchers: 10
Forks: 12
Open Issues: 1
Metadata Files:
- Readme: README.md
- License: LICENSE

Awesome Lists containing this project

README

        ## MSAI Fall 2024 Launch.

### Semester content:

[ContestID_W01]: https://contest.yandex.ru/contest/69200/?lang=en

[ContestID_W02]: https://contest.yandex.ru/contest/69506/?lang=en

[ContestID_W03]: https://contest.yandex.ru/contest/69814/?lang=en

[ContestID_W04]: https://contest.yandex.ru/contest/70069/?lang=en

[ContestID_W05]: https://contest.yandex.ru/contest/70070/?lang=en

[ContestID_W06]: https://contest.yandex.ru/contest/70071/?lang=en

[ContestID_W07]: https://contest.yandex.ru/contest/70072/?lang=en

[ContestID_W08]: https://contest.yandex.ru/contest/70073/?lang=en

[ContestID_W09]: https://contest.yandex.ru/contest/70074/?lang=en

[ContestID_W10]: https://contest.yandex.ru/contest/70075/?lang=en

[WarmUp_test_W01]: https://forms.gle/N7w3ogEbwN1dr1am8

[WarmUp_test_W02]: https://forms.gle/q2ir9uSz9LYg5xWd7

[WarmUp_test_W03]: https://forms.gle/rC7tCz5At9HRvNdg6

[WarmUp_test_W04]: https://forms.gle/UPYmQsU7qKCt3FhM8

[WarmUp_test_W05]: https://forms.gle/F6V36zU14HkvFMq5A

[WarmUp_test_W06]: https://forms.gle/uxtkHdyrxKR8c8i56

[WarmUp_test_W07]: https://forms.gle/EzjU2FB1hDY3QQkJA

[WarmUp_test_W08]: https://forms.gle/ftxDfdVeZDQZB1JfA

[WarmUp_test_W09]: https://forms.gle/g9QA4LTiZwg3Nbka7

[WarmUp_test_W10]: https://forms.gle/aJ5chmuBhfviNn8Q8

[WarmUp_test_W11]: https://forms.gle/AshGbamo5f7Qi8uL9

[Slides_W01]: ../master/week01_sorting_algorithms/MSAI.2024.Algo.W01.slides.pdf

[Slides_W02]: ../master/week02_binary_search/MSAI.2024.Algo.W02.slides.pdf

[Slides_W03]: ../master/week03_basic_data_structures/MSAI.2024.Algo.W03.slides.pdf

[Slides_W04]: ../master/week04_dynamic_programming/MSAI.2024.Algo.W04.slides.pdf

[Slides_W05]: ../msai22_state/week05_knapsack/MSAI.2022.Algo.W05.slides.pdf

[Slides_W06]: ../master/week06_kmp_heap/MSAI.2024.Algo.W06.slides.pdf

[Slides_W07]: ../master/week07_dfs_bfs/MSAI.2024.Algo.W07.slides.pdf

[Slides_W08]: ../master/week08_shortest_paths/MSAI.2024.Algo.W08.slides.pdf

[Slides_W09]: ../master/week09_rsq_rmq/MSAI.2024.Algo.W09.slides.pdf

[Slides_W10]: ../master/week10_hashing/MSAI.2024.Algo.W10.slides.pdf

[Slides_W11]: ../master/week11_binary_search_tree/MSAI.2024.Algo.W11.slides.pdf

| Week   | Content                | Slides               | WarmUp test             | Contest                  |     Soft Deadline      |

|:------:|:-----------------------|:--------------------:|:-----------------------:|:------------------------:|:----------------------:|

| 01     | Sorting algorithms     | [Slides][Slides_W01] | [Test][WarmUp_test_W01] | [Contest][ContestID_W01] | 14.10.2024 19:00 UTC+3 |

| 02     | Binary search          | [Slides][Slides_W02] | [Test][WarmUp_test_W02] | [Contest][ContestID_W02] | 21.10.2024 19:00 UTC+3 |

| 03     | Basic Data sturctures  | [Slides][Slides_W03] | [Test][WarmUp_test_W03] | [Contest][ContestID_W03] | 28.10.2024 19:00 UTC+3 |

| 04     | Dynamic programming    | [Slides][Slides_W04] | [Test][WarmUp_test_W04] | [Contest][ContestID_W04] | 04.11.2024 19:00 UTC+3 |

| 05     | Knapsack problem       | [Slides][Slides_W05] | [Test][WarmUp_test_W05] | [Contest][ContestID_W05] | 11.11.2024 19:00 UTC+3 |

### 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:

G = ceil(0.6 H + 0.2 P + 0.2 T)


### Homework grade

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

**Formally:**

Homework grade: **`H`** is an integer number within range [0; 10]:

H = round(hw_score / hw_maximum_score * 10)


`hw_score` is sum of scores for all problems in home assignment.

Scores for a problem:

    - 1.0 if you solved the problem (got OK verdict) before soft deadline

    

    - 0.75 if you solved the problem (got OK verdict) after soft deadline

    

    - 0 otherwise

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