Faculdade de Ciências e Tecnologia

Algorithms and Data Structures



Academic unit

Faculdade de Ciências e Tecnologia


Departamento de Informática



Teacher in charge

Fernanda Maria Barquinha Tavares Vieira Barbosa, Luís Manuel Marques da Costa Caires

Weekly hours


Total hours


Teaching language



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.

Subject matter

  1. 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
  2. Introduction to Algorithm Analysis
  3. Formal specification of abstract data types:
    • Queue (LIFO)
    • Stack (FIFO)
    • List
    • Set
    • Dictionary
    • Ordered Dictionary
  4. Study of the fundamental data structures, including the analysis of the algorithmic in the best, worst and expected case:
    • Circular Vector,
    • Singly and Doubly Linked Lists,
    • Open and Closed-Hash Tables,
    • Search Trees and Binary Trees.


Mark Allen Weiss.
Data Structures and Algorithm Analysis in C (second edition).
Addison-Wesley, 1997.
ISBN 0-201-49840-5 (Hard cover)

Linguagem de Programação C

Brian Kernighan and Dennis Ritchie
The C Programming Language (second edition).
Prentice-Hall, 1988.
ISBN 0-13-110362-8 (Paperback)

Pedro Guerreiro.
Elementos de Programação com C (3ª edição).
FCA - Editora de Informática, 2005.

Luis Damas.
Linguagem C (12ª edição).
FCA - Editora de Informática, 2005.

Teaching method

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.

Evaluation method

The student assessment consists of a theoretical component and a laboratory component held throughout the semester.

The theoretical component consists of 2 single evaluations (1 laboratory test and a test), and the laboratory component by 1 individual work and 1 group work (programming project).

All assessment (tests, works and exam) are rated on a scale of 0 to 20.


Laboratory component
During the classes, students must perform two laboratory works (tp1and tp2) with weights of 15% and 25% of the final grade, respectively. The tp1 work will be held and delivered individually in laboratory classes. The tp2 work will be done in group (group''''s size 2).

Laboratory component grade (NCL) will be awarded according to the following formula:  NCL = 0.15 * tp1 + 0.25 * tp2


Theoretical-pratical Component

Students must perform two individual tests (t1 and t2) between classes, or an exam. 

Continuous assessment: The practical test t1 and test t2 will have weights of 25% and 35% respectively, of the final grade. The grade the theoretical-practical component (NCT) will be awarded according to the following formula: NCT = 0.25 * t1 + 0.35 * t2.

Appeal: the exam (ex) will be 60% of the final grade.  NCT = 0.6*ex.

Final Grade
The final grade (NF) will be awarded according to the following formula, rounded to the units: NF = NCL + NCT.