Sumários

TP7

16 Abril 2024, 18:30 João Pedro Guerreiro Neto


Constraint Programming exercises.

T7

16 Abril 2024, 16:30 João Pedro Guerreiro Neto


Constraint Programming. Specifying problems by defining variables and their constraints. Constraint programming as declarative programming. Introduction to Z3 and its Python interface. Solving classical problems like the 8 queens, knapsack, Golomb rules, and solving Sudoku puzzles.

TP6

9 Abril 2024, 18:30 João Pedro Guerreiro Neto


Exercises using dynamic programming.

T6

9 Abril 2024, 16:30 João Pedro Guerreiro Neto


Problem Decomposition, dynamic programming as a technique to solve problems. Bottom-up and top-down approaches to dynamic programming. The need for memoization. Solving classical examples, like longest increasing sub-sequence, the knapsack problem, and matrix multiplication.

TP5

26 Março 2024, 18:30 João Pedro Guerreiro Neto


Exercises about divide and conquer and greedy algorithm.