Lectures

  • The (theory) lectures, taught from 15:00 to 16:00, follow the plan shown below, that includes their summaries and support materials.

                 1      2     3     4     5     6 
                 7      8     9   10   11   12
                 13  14   15   16   17   18

Aula_1:   22 sep 2017
  • Introduction.
  • Computing Paradigms - Imperative Programming.
  • Variables and Assignment.
  • Data Types: Matrices in MATLAB
  • Scripts in OCTAVE
slides

Aula_2:   29 sep 2016
  • Abstractions and Functions
  • Algorithms and Execution Control
  • Sequential Execution
  • Conditional Execution - IF instruction
  • Repeated Execution - FOR instruction
slides

Aula_3:   06 oct 2017 -> 13 oct 2017
  • Iterated Execution - WHILE and DO instructions
  • Algorithms
  • Nested Functions and Recursion
  • Examples
slides

Aula_4:   13 out 2017 -> 14 oct 2017
  • Strings and Vectors
  • String Operations
  • Files and File Types
  • Text Files - Read / Write instructions
slides

Aula_5:   20 out 2017
  • Structures
  • Structure Vectors
  • Read/Write from Text Files
  • Access to Internet
slides

Aula_6:   27 0ut 2017
  • Search in Vectors
  • Sequential and Bipartite Search - Complexity
  • Simple Sorting Algorithms
  • Bubble Sort and Insert Sort - Recursion
slides

Aula_7:   3 nov 2017
  • Efficient Sorting Algorithms
  • Quick Sort, Merge Sort
  • Complexity of Sorting
slides

Aula_8:   10 nov 2017
  • (Pseudo) Random Numbers
  • Generation of Known Distributions
  • Monte Carlo Simulation
  • Example: Queuing Networks.
slides + codes

Aula_9:   17 nov 2017 -> 15 nov 2017
  • More on Stochastic Simulations.
  • (Automata, States and Events)
  • Example: Queuing Networks.
slides + codes

Aula_10: 24 nov 2017
  • Introduction to Graphs
  • Graph Representations.
  • Simple Algorithms: Test for Connectedness
slides + programs

Aula_11: 6 dec 2017
  • Polynomial Problems in Graphs
  • Dynamic Programming.
  • Minimum Spanning Tree – Prim’s Algorithm
  • Shortest Paths – Floyd-Warshall’s Algorithm
slides + programs

Aula_12:  15 dec 2017
  • Non-Polynomial Problems in Graphs
  • Optimisation vs,Satisfaction
  • Heuristic Search
  • Example: Hamiltonian Circuits (Traveling Salesperson)
slides + programs

Aula_13: 5 jan 2107
• Overview. Database Modeling - ER Model; Entities, Attributes and keys. Relational Algebra.
slides_ER, slides_RA, Planning, Syllabus

Aula_14: 12 jan 2107
• Normalisation: Functional dependencies; Closures and Normal Forms (1st, 2nd, 3rd and BCNF)
• Relational Algebra.
slides_norm

Aula_15: 19 jan 2107
• Database Querying - SQL (DDL e DML). Simple queries and joins.
slides_SQL

Aula_16: 26 jan 2107
• Database Querying - SQL (cont.).
• aggregation functions, subqueries, views, consistency, external keys and triggers.
slides_SQL, slides_triggers

Aula_17: 2 fev 2107
• Support to Project
  DB_project

Aula_18: 7 fev 2107
• No class