|Algorithms and Data Structures II||831AED2|
|2||Undergraduate||Computer Systems Engineering||6 ects|
|Learning Period:||Language of Instruction:||Total Hours:|
|Learning Outcomes of the Curricular Unit:|
|Competence levels (Dublin descriptors):1. Knowledge and understanding1.1. Notion of algorithms (ALG) and data structures (ED) of search and graphs|
1.2. Understanding these ALGs and data structures (EDs) in software projects and solving concrete problems
2. Applying knowledge and understanding2.1. Apply ALG and ED of search and graphs
2.2. Use the Java programming language in the implementation of ALG and ED.
3. Making judgements:
3.1. Choose of appropriate ED and ALG for problem solving and / or software projects.
4.1. Describe an ALG by mastering abstract representations of algorithms.
4.2. Work in a group.
4.3. Argue orally and in writing.
5. Autonomy and learning skills:
5.1. Know and deepen other existing algorithmic techniques.
5.2. Autonomy to overcome difficulties inherent to new problems
|1. Introduction to non-linear data structures|
1.1. Introduction to trees and graphs
1.2. Notation and Terminology
1.4. Applications of non-linear data structures
2. Search and tree data structures
2.1. Symbol tables
2.2. Introduction to Tree Data Structures
2.3. Binary search trees (BST - binary search trees)
2.4. Balanced trees
2.5. Hash tables
3.1. Introduction to the graph data structure and its representation
3.2. Graph traversal algorithm
3.3. Undirected graphs
3.4. Directed graphs
3.5. Weighted graphs
3.6. Weighted and directed graphs
|Demonstration of the Syllabus Coherence with the Curricular Unit's Objectives:|
|The syllabus presented are consistent with the learning objectives of the curricular unit since there is a large convergence between the table of contents and the knowledge that the student is supposed to acquire in each of the program topics.|
The fundamental concepts of algorithmic analysis and design and nonlinear data structures are presented in the introductory chapter, in the following chapters are presented various algorithms and data structures for searching and also graph algorithms.
The learning objectives are achieved by supplementing the theoretical concepts with concrete examples run in lab environment using appropriate software
|Teaching Methodologies (Including Evaluation):|
|Theoretical-practical (TP) and practical-laboratory (PL) components. In TP classes, concepts are presented interspersed with examples and exercises. In PL classes are posed and solved exercises and problems, eventually using software.|
Final_Grade_AED2 = (2/3) x Grade_TP + (1/3) x Grade_PL
Grade_TP> = 10
Grade_PL> = 10
Grade_PL: compulsory for continuous evaluation and is not subject to examination. It consists of a programming project carried out during the semester. If student does not submit the project will have zero and can only carry out the project in a subsequent edition of the UC.
Grade_PL = Practical project grade
In continuous evaluation, two frequencies F1 and F2, Grade_TP = (50%) x F1 + (50%) x F2
On exam, Grade_TP = Grade_TP_Examination
If only TP or PL is positive, it is valid for a maximum period of two academic years after the year in which the student has obtained approval in this component. During this period the UC is not completed (NC)
|Demonstration of the Coherence between the Teaching Methodologies and the Learning Outcomes:|
|The teaching/learning methodology applied in this curricular unit as well as its evaluation system is perfectly aligned with the objectives to be attained by the students at the end of the term. The theoretical concepts are presented, discussed, applied and evaluated in the context of lectures, which guarantees students a solid foundation to understand the challenges facing this area of knowledge. On the other hand, so that the study is not restricted to conceptual models, in the practical lessons are presented concrete case studies and implemented solutions for real problems using appropriate software. This combination guarantees training for students that allows them to meet the scientific goals, essential to a good understanding of the theme, as well as the ability to adapt to technological changes. The evaluation process consists of theoretical tests and practical work also guarantees a correct balance between the efforts dedicated to both components. The objective is to train professionals’ specialized in state-of-the-art techniques and tools but also ensure its ability to follow future developments. In this curriculum unit the problem of algorithms and data structures are presented and evaluated in theoretical component. These concepts are then applied in the resolution of the worksheets and practical work in the context of practical classes|
|[CLRS] Thomas H. Cormen, Leiserson, C., Rivest, R., & Stein, C. (2009). Introduction to Algorithms, third edition. MIT Press.|
[KT] Kleinberg, J., & Tardos, E. (2006). Algorithm Design. Pearson Education.
[SW] Sedgewick, R., & Wayne, K. (2011). Algorithms, 4th Edition. Pearson Education.
[VSC] Vasconcelos, J., & Carvalho, J. V. de. (2005). Algoritmia e Estrutura de Dados: programação nas linguagens C e Java. Editora Centro Atlântico.
[AAR2] Rocha, A. A. da. Estruturas de Dados e Algoritmos em Java. FCA - Editora de Informática, ISBN 978-972-722-704-4.
[AAR1] Rocha, A. A. da. (2008). Estruturas de Dados e Algoritmos em C. FCA - Editora de Informática