Algoritmos Avançados
Feedback dos Alunos
ano passado
For those who enjoy algorithms, graphs, combinatorics, and string problems, this is probably one of the best courses in MEIC.
I got the impression that the course content varies quite a bit depending on the professor. In 2023/2024, it was taught by Professor Luís Russo, and the topics covered included amortized analysis, heaps, minimum spanning trees, string matching, and Yao’s min-max principle.
There’s another review from 2021 about a different version of the course also taught by Luís Russo, but it no longer seems to reflect the...
As avaliações abaixo deste ponto podem estar desatualizadas. O conteúdo, os métodos de ensino e os requisitos da cadeira podem ter mudado desde então.
há 5 anos
In this semester, the course was taught by Professor Luís Russo. The evaluation consisted of weekly assessments throughout the semester.
Classes felt improvised, as the professor seemed to be figuring things out as he went. The only study materials available were the notes he took on his tablet during class, which were very confusing. He shared some past exams, but the questions in there were very different from the ones we had in our assessments.
Weekly Assessments & Evaluation
The weekly assessments started to be 20 minutes and then increased to 40 minutes as the professor experimented...