Algorithms and Data Structures
Knowledge: Basic techniques for solving problems: fundamental abstract data types (list, set, stack, queue, dictionary, ordered dictionary) and abstract data types of the problem domain; basic algorithm design techniques: fundamental data structures (vector, single and double linked list, hash table, binary trees); basic techniques of algorithm analysis: spatial and temporal complexity.
Know-how: Model programs using abstract data types; define and implement abstract data types in the problem domain; calculate the spatial and temporal complexity of algorithms; implement fundamental abstract data types, using the most adequate data structures; design and implement efficient solutions to concrete problems.
Soft-skills: Ability to evaluate solutions; ability to select the suitable techniques to solve a problem; skills in writing communication: reports of discipline projects.
Carmen Pires Morgado, Luís Manuel Marques da Costa Caires
Weekly - 5
Total - 84
There are one lecture and a lab session each week.
In the lectures, all course contents are presented using concrete practical examples. In the laboratory, students design, analyse and implement programs for specific problems by applying the knowledge gained.
Students will be evaluated by practical works and a test.
- Modeling programs, using abstract data types
- Method for the analysis and design of a solution
- Definition and implementation of abstract data types in the problem domain
- Queue (LIFO)
- Stack (FIFO)
- Ordered Dictionary
- Circular Vector,
- Singly and Doubly Linked Lists,
- Open and Closed-Hash Tables,
- Search Trees and Binary Trees.
Programs where the course is taught: