Publication in the Diário da República: Despacho n.º16228/2009 - 15/07/2009
6 ECTS; 2º Ano, 1º Semestre, 28,0 T + 42,0 PL + 5,0 OT + 5,0 O
Lecturer
- António Manuel Rodrigues Manso
- Paulo Alexandre Gomes dos Santos
Prerequisites
Not applicable.
Objectives
1. Describe the commonest data structures and algorithms, as well as its advantages, limitations and applications;
2. Use data structures to solve real problems;
3. Design, develop, and test code for tackling medium- and large-scale problems.
Program
1 - Algorithm development techniques
2 - Algorithm complexity analysis
3 - Sorting algorithms.
4 - Linear data structures
5 - Hierarchical data structures
6 - Graphs
Evaluation Methodology
Continuous assessment:
Theoretical part (50%): Two closed-book tests with a minimum of 7 out of 20 on the arithmetic mean of the two tests.
Practical Part (50%): Practical Work with a minimum of 10 out of 20.
Exam:
Theoretical (50%): Closed-book exam with a minimum of 7 out of 20.
Practical part (50%): mark of the practical work submitted as part of the continuous assessment or closed-book test with a minimum of 10 out 0f 20.
Bibliography
(2002). Algoritmos Teoria e Prática ? Tradução da 2ª Edição Americana. Brasil: Editora Campus
(2008). Data Structures and Algorithms. EUA:
(2002). Algoritmos Teoria e Prática ? Tradução da 2ª Edição Americana. Brasil: Editora Campus
(2008). Data Structures and Algorithms. EUA:
Teaching Method
Lectures and laboratory classes.
Software used in class
Netbeans and Java
