6 ECTS; 1º Ano, 1º Semestre, 30,0 T + 30,0 TP + 5,0 OT + 5,0 O
Lecturer
Prerequisites
Not applicable.
Objectives
1-Master the general techniques of design and analysis of algorithms.
2-Knowing the generic models of problems and algorithmic techniques associated with them.
3-In-depth study of data structures and algorithms.
4-Design and implement efficient algorithms.
Program
1-Fundamentals of algorithms and complexity analysis.
2-Sorting and orders statistics.
3-Algorithms design techniques.
4-Advanced Data Structures
Evaluation Methodology
Assessment includes two projects, a research assignment and an end-of-semester exam.
Bibliography
- Rivest, R. e Leiserson, C. e Cormen, T. e Stein, C. (2009). Introduction to Algorithms. (Vol. 1). (pp. 1-1312). Cambridge: MIT Press
- Weiss, M. (2010). Data Structures and Problem Solving Using Java. (Vol. 1). (pp. 1-1024). Pearson: Addison-Wesley
Teaching Method
Lectures: course content presentation Laboratory sessions: Laboratorial classes involving practical experiments.
Software used in class
