You need to activate javascript for this site.
Menu Conteúdo Rodapé
  1. Home
  2. Courses
  3. Electrical and Computer Engineering
  4. Data Structures

Data Structures

Code 8558
Year 3
Semester S1
ECTS Credits 6
Workload PL(30H)/T(30H)
Scientific area Systems and Computers
Entry requirements Notions of structured programming.
Mode of delivery Face-to-face
Work placements (Not applicable)
Learning outcomes Planning, definition and implementation of dynamic data structures. Study of algorithms to assess and search over dynamic structures, both sequential, binary and n-ary.
- Identification of requisites in terms of data structures, for a computational system.
- Planning of composed data structures
- Implementation of algorithms to assess, search and sort dynamic data structures.
- Optimization of structures and respective algorithms, in terms of the temporal and spatial computational cost.
Syllabus Introduction; Dynamic allocation of resources. Pointers.
Sequential data structures: lists, stacks and queues, jump lists.
Non-sequential data-structures: trees, search by similarity, graphs.
Main Bibliography - "Estruturas de Dados e Algoritmos em C", 2008. António Manuel Adrego da Rocha. FCA-Editora de Informática. Coleção: Tecnologias de Informação. ISBN: 9789727222957
- "Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms", 3rd Edition, 2001. By Robert Sedgewick. Addison-Wesley Professional. ISBN: 0201756080
- "Data Structures in ANSI C", 1991. S. Sengupta. Academic
- "Data Structures and Algorithm Analysis in C++", 2nd ed., Mark Allen Weiss, Addison-Wesley, 1999.
Language Portuguese. Tutorial support is available in English.
Last updated on: 2021-02-01

The cookies used in this website do not collect personal information that helps to identify you. By continuing you agree to the cookie policy.