johnysc / msai-algorithms

Open course on Algorithms and Data Structures

MSAI Fall 2022 Launch.

Semester content:

Week	Content	Slides	WarmUp test	Contest	Soft Deadline
01	Sorting algorithms	Slides	Test	Contest	04.11.2022 19:30 GMT+3 (Updated)
02	Binary search	Slides	Test	Contest	09.11.2022 19:00 GMT+3 (Updated)
03	Basic Data sturctures	Slides	Test	Contest	11.11.2022 19:30 GMT+3
04	Dynamic programming	Slides	Test	Contest	23.11.2022 19:00 GMT+3
05	Knapsack problem	Slides	Test	Contest	25.11.2022 19:00 GMT+3
06	KMP & Heap	Slides	Test	Contest	30.11.2022 19:00 GMT+3
07	DFS & BFS	Slides	Test	Contest	07.12.2022 19:00 GMT+3
08	Shortest paths	Slides	Test	Contest	14.12.2022 19:00 GMT+3
09	RSQ & RMQ	Slides	Test	Contest	21.12.2022 19:00 GMT+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.