Agorithms and Data Structures

TeSP - Web e Dispositivos Móveis
6 ECTS; 1º Ano, 1º Semestre, 45,0 PL + 15,0 TP

Lecturer

Prerequisites
Not applicable.

Objectives
Students will learn how to analyse a problem, design and implement algorithms as a tool for the resolution of practical problems. They will be provided with an introduction to data structures and learn C language for coding some of the learned algorithms.

Program
Flowcharts; Pseudocode; Structured programming; Data types and Primitive operations; Variables and Constants; Expressions; Internal functions; Input/Output; Algorithm design; Flow Control ; Functions; Basic data structures; Lists; Stacks; Queues; Sorting; C language.

Evaluation Methodology
There isn't Periodic Eval.
Continuous Eval.: Final Test (30%)

Final Eval.
-Continuous Eval. Grade (30%) ou Exame (30%)
-Programming Project (70%). Mandatory live discussion
Final Teste and Exame mín grade: 7 val.;
Prog. Project mín grade: 10 val

Bibliography
- Aguilar, L. (2008). Fundamentos de Programação: Algoritmos, Estruturas de Dados e Objetos. -: McGraw Hill
- Sedgewick, R. (1997). Algorithms in C: Fundamentals, Data Structures, Sorting, Searching Pts. 1-4. -: Addison Wesley
- Kerninghan, B. e Ritchie, D. (1988). The C Programming Language. -: Prentice Hall
- Damas, L. (1999). Linguagem C. Portugal: FCA

Method of interaction
Theoretical and practical classes.

Software used in class
Visual Studio (C language/compiler)