|
Teaching GuideTerm Faculty of Computer Science |
| Grao en Enxeñaría Informática |
 Subjects |
| Algorithms |
| Learning aims |
|
|
|
| Identifying Data | 2020/21 | |||||||||||||
| Subject | Algorithms | Code | 614G01011 | |||||||||||
| Study programme |
|
|||||||||||||
| Descriptors | Cycle | Period | Year | Type | Credits | |||||||||
| Graduate | 1st four-month period |
Second | Obligatory | 6 | ||||||||||
|
||||||||||||||
| Learning outcomes | Study programme competences | ||
| To know how to apply techniques for algorithmic complexity analysis. | A12 A13 |
B3 |
|
| To recognize the importance of studying algorithm complexity and to know how to perform empirical studies to determine that complexity. | A12 A13 |
B3 |
C3 |
| To know the most used techniques in algorithm design. | A12 |
B3 |
|
| To understand the elements of study about computational complexity. | A12 A13 |
B3 |
|
| To use different computational models and levels of abstraction needed for algorithm design. | A12 |
B3 |
|
| To identify data structures adapted to the studied algorithms to obtain more efficient and robust implementations. | A13 |
B3 |
C3 |
|
