| Q/S |
Dia |
Mês |
Tópico |
Ata |
Ata de Exercícios |
| Q |
19 |
Fev |
Apresentação |
|
|
| S |
21 |
Fev |
Getting Started |
ata |
|
| Q |
26 |
Fev |
(Washington) |
|
|
| S |
28 |
Fev |
Growth of Functions |
ata |
Getting Started |
| Q |
5 |
Mar |
(Carnaval) |
|
|
| S |
7 |
Mar |
Recurrences |
ata |
Growth of Functions |
| Q |
12 |
Mar |
Heapsort |
ata |
Recurrences |
| S |
14 |
Mar |
Quicksort |
ata |
Heapsort |
| Q |
19 |
Mar |
Sorting in Linear Time |
ata |
Quicksort |
| S |
21 |
Mar |
Medians and Order Statistics |
ata |
Sorting in Linear Time |
| Q |
26 |
Mar |
Revisão |
|
Medians and Order Statistics |
| S |
28 |
Mar |
Prova Grupal 1 |
|
|
| Q |
2 |
Abr |
Dynamic Programming 1 |
ata |
|
| S |
4 |
Abr |
Dynamic Programming 2 |
ata |
Dynamic Programming 1 |
| Q |
9 |
Abr |
Greedy Algorithms 1 |
ata |
Dynamic Programming 2 |
| S |
11 |
Abr |
(Argentina) |
|
|
| Q |
16 |
Abr |
Greedy Algorithms 2 |
ata |
Greedy Algorithms 1 |
| S |
18 |
Abr |
(Semana Santa) |
|
|
| Q |
23 |
Abr |
Fibonacci Heaps |
ata |
Greedy Algorithms 2 |
| S |
25 |
Abr |
Revisão |
|
Fibonacci Heaps |
| Q |
30 |
Abr |
Prova Individual 1 |
|
|
| S |
2 |
Mai |
(Dia do Trabalho) |
|
|
| Q |
7 |
Mai |
Disjoint Sets |
ata |
|
| S |
9 |
Mai |
Graph Algorithms 1 |
ata |
Disjoint Sets |
| Q |
14 |
Mai |
Graph Algorithms 2 |
ata |
Graph Algorithms 1 |
| S |
16 |
Mai |
Minimum Spanning Tree |
ata |
Graph Algorithms 2 |
| Q |
21 |
Mai |
Single-Source Shortest Paths 1 |
ata |
Minimum Spanning Tree |
| S |
23 |
Mai |
Single-Source Shortest Paths 2 |
ata |
Single-Source Shortest Paths 1 |
| Q |
28 |
Mai |
Revisão |
|
Single-Source Shortest Paths 2 |
| S |
30 |
Mai |
Prova Grupal 2 |
|
|
| Q |
4 |
Jun |
All-Pairs Shortest Path |
* |
|
| S |
6 |
Jun |
Maximum Flow 1 |
* |
* |
| Q |
11 |
Jun |
Maximum Flow 2 |
* |
* |
| S |
13 |
Jun |
NP-completeness 1 |
* |
* |
| Q |
18 |
Jun |
NP-completeness 2 |
* |
* |
| S |
20 |
Jun |
(Corpus Christi) |
|
|
| Q |
25 |
Jun |
Revisão |
|
* |
| S |
27 |
Jun |
Prova Individual 2 |
|
|