Esta página mostra as diferenças entre a revisão do documento que escolheu e a versão actual.
Ambos os lados da revisão anterior Revisão anterior Próxima revisão | Revisão anterior | ||
cmp601:homepage [2022/06/14 16:59] 127.0.0.1 Edição externa |
cmp601:homepage [2022/08/22 17:02] (Actual) |
||
---|---|---|---|
Linha 32: | Linha 32: | ||
| | | ** Algorithms ** | | | | | | | | | ** Algorithms ** | | | | | | ||
| 1 | 14/06 | Administrativa. Introduction. | 1 | | | 1.1 | | | 1 | 14/06 | Administrativa. Introduction. | 1 | | | 1.1 | | ||
- | | | 16/06 | //Corpus Cristi// | | | | | | + | | | 16/06 | //Corpus Cristi// | | | | | |
| 2 | 21/06 | Basics of analysis and representative problems. | | | | 1.2 | | | 2 | 21/06 | Basics of analysis and representative problems. | | | | 1.2 | | ||
| 3 | 23/06 | Basics of analysis and representative problems. | 2 | | | 2 | | | 3 | 23/06 | Basics of analysis and representative problems. | 2 | | | 2 | | ||
- | | | 24/06 | First qualification exam | | | | | | + | | | 24/06 | Qualification exam algorithms (8.30, AUD-0) | | {{eqa20221.pdf|E}} | {{seqa20221.pdf|S}} | | |
+ | | | 24/06 | Qualification exam theory (13.30, 109, 43413) | | | | | | ||
| 4 | 28/06 | Graph algorithms 1. | | | | 3.[123],4.4 | | | 4 | 28/06 | Graph algorithms 1. | | | | 3.[123],4.4 | | ||
| 5 | 30/06 | Graph algorithms 2. | | | | 3.[46] | | | 5 | 30/06 | Graph algorithms 2. | | | | 3.[46] | | ||
- | | 6 | 05/07 | Graph algorithms 3. | | | | 3.5 | | + | | 6 | 05/07 | Graph algorithms 3. | | {{q0120221.pdf|E1}} | {{sq0120221.pdf|S1}} | 3.5 | |
| 7 | 07/07 | Greedy algorithms 1. | 4 | | | 4.[12] | | | 7 | 07/07 | Greedy algorithms 1. | 4 | | | 4.[12] | | ||
| 8 | 12/07 | Greedy algorithms 2. | 4 | | | 4.5 | | | 8 | 12/07 | Greedy algorithms 2. | 4 | | | 4.5 | | ||
| 9 | 14/07 | Greedy algorithms 3. | 4 | | | 4.9 | | | 9 | 14/07 | Greedy algorithms 3. | 4 | | | 4.9 | | ||
- | | 10 | 19/07 | Divide-and-conquer algorithms 1. | 5 | | | 5.[123] | | + | | 10 | 19/07 | Divide-and-conquer algorithms 1. | 5 | {{q0220221.pdf|E2}} | {{sq0220221.pdf|S2}} | 5.[123] | |
- | | 11 | 21/07 | Divide-and-conquer algorithms 2. | 5 | | | 5.[45] | | + | | 11 | 21/07 | Divide-and-conquer algorithms 2. | 5 | | | 5.[45] | |
- | | 12 | 26/07 | Divide-and-conquer algorithms 3. | 5 | | | 5.6 | | + | | 12 | 26/07 | Divide-and-conquer algorithms 3. | 5 | | | 5.6 | |
- | | 13 | 28/07 | Dynamic programming 1. | 6 | | | 6.[12] | | + | | 13 | 28/07 | Dynamic programming 1. | 6 | {{q0320221.pdf|E3}} | {{sq0320221.pdf|S3}} | 6.[12] | |
- | | 14 | 02/08 | Dynamic programming 2. | 6 | | | 6.[45] | | + | | 14 | 02/08 | Dynamic programming 2. | 6 | | | 6.[45] | |
- | | 15 | 04/08 | Dynamic programming 3. | 6 | | | 6.[67] | | + | | 15 | 04/08 | Dynamic programming 3. | 6 | {{q0420221.pdf|E4}} | {{sq0420221.pdf|S4}} | 6.[67] | |
| | | ** Theory of computation ** | | | | | | | | | ** Theory of computation ** | | | | | | ||
| 16 | 09/08 | Theory 1: Introduction -- Noncomputability | | | | | | | 16 | 09/08 | Theory 1: Introduction -- Noncomputability | | | | | |