Diego Perdigão Martino

Teaching

C Programming
Variables and conditional statements, loops and functions, fixed-size arrays, 2D arrays, strings, structures, pointers, dynamic memory allocation
hours
Algorithmic in Python
Variables, assignment, standard input and output, strings, booleans and conditional statements, functions and tuples, while and for loops, lists, dictionaries, recursion, sorting algorithms, reading from and writing to a file
hours
Graphs theory
Breadth-first and depth-first traversal, distance computation in weighted graphs, minimum spanning trees, scheduling problems, maximum flows, topological sorting, strongly connected components, Eulerian and Hamiltonian graphs
hours
Graphs structure
Algorithms on Eulerian graphs, breadth-first and depth-first traversal, topological sorting, strongly connected components
hours
Numerical algorithms
Linear systems, Gaussian elimination method, Cholesky method, Gauss-Seidel iterative method, Jacobi iterative method, interpolation (Lagrange, Neville, Newton), approximation (line equation, least squares), eigenvalues and eigenvectors, modeling
hours
Game theory
Zero-sum games, non-zero-sum games
hours
Operational research
Modeling of Linear Programs (LP) and Mixed-Integer Linear Programs (MILP) with OPL IDE and with the CPLEX Python API, duality, sensitivity analysis, Gomory cutting-plane algorithm, Branch-and-Cut
hours
Systems modeling and optimization
Linear relaxation, greedy heuristics, dynamic programming, reduction, preprocessing, solving MILPs with CPLEX, Lagrangian relaxation
hours
Mathematical and computational writing
Git (repository initialization, basic configurations, versioning, synchronization with remote repositories, .gitignore, conflict management, version merging, image insertion, code insertion), LaTeX (writing and compilation, internal referencing mechanism, packages, basic commands, lists, math mode, compilation mechanism with auxiliary files, tables, definition of simple and complex commands, formatting control), and mathematical remediation (recurrences, quantifiers, contrapositive, negation)
hours
Mathematical and computational writing (Git, LaTeX)
Git (repository initialization, basic configurations, versioning, synchronization with remote repositories, .gitignore, conflict management, version merging, image insertion, code insertion), LaTeX (writing and compilation, internal referencing mechanism, packages, basic commands, lists, math mode, compilation mechanism with auxiliary files, tables, definition of simple and complex commands, formatting control), and mathematical remediation (recurrences, quantifiers, contrapositive, negation)
hours
C Programming
Variables and conditional statements, loops and functions, fixed-size arrays, 2D arrays, strings, structures, pointers, dynamic memory allocation
hours
Databases
SQL database
hours
Operational research
Modeling of Linear Programs (LP) and Mixed-Integer Linear Programs (MILP) with OPL IDE and with the CPLEX Python API, duality, sensitivity analysis, Gomory cutting-plane algorithm, Branch-and-Cut
hours
Numerical algorithms
Linear systems, Gaussian elimination method, Cholesky method, Gauss-Seidel iterative method, Jacobi iterative method, interpolation (Lagrange, Neville, Newton), approximation (line equation, least squares), eigenvalues and eigenvectors, modeling
hours
Graphs structure
Algorithms on Eulerian graphs, breadth-first and depth-first traversal, topological sorting, strongly connected components
hours
C Programming
Variables and conditional statements, loops and functions, fixed-size arrays, 2D arrays, strings, structures, pointers, dynamic memory allocation
hours
Numerical algorithms
Linear systems, Gaussian elimination method, Cholesky method, Gauss-Seidel iterative method, Jacobi iterative method, interpolation (Lagrange, Neville, Newton), approximation (line equation, least squares), eigenvalues and eigenvectors, modeling
hours
Operational research
Modeling of Linear Programs (LP) and Mixed-Integer Linear Programs (MILP) with OPL IDE and with the CPLEX Python API, duality, sensitivity analysis, Gomory cutting-plane algorithm, Branch-and-Cut
hours
Systems modeling and optimization
Linear relaxation, greedy heuristics, dynamic programming, reduction, preprocessing, solving MILPs with CPLEX, Lagrangian relaxation
hours
C Programming
Variables and conditional statements, loops and functions, fixed-size arrays, 2D arrays, strings, structures, pointers, dynamic memory allocation
hours
Numerical algorithms
Linear systems, Gaussian elimination method, Cholesky method, Gauss-Seidel iterative method, Jacobi iterative method, interpolation (Lagrange, Neville, Newton), approximation (line equation, least squares), eigenvalues and eigenvectors, modeling
hours
Operational research
Modeling of Linear Programs (LP) and Mixed-Integer Linear Programs (MILP) with OPL IDE and with the CPLEX Python API, duality, sensitivity analysis, Gomory cutting-plane algorithm, Branch-and-Cut
hours
Computing project
Implementation of a card game (La Réussite des Alliances) in Python using Git for version control and LaTeX for writing the report
hours
Object-oriented programming
Manipulation of classes, inheritance, enumeration, lists, arrays, comparison of data structures, the War card game
hours
Operational research
Modeling of Linear Programs (LP) and Mixed-Integer Linear Programs (MILP) with OPL IDE and with the CPLEX Python API, duality, sensitivity analysis, Gomory cutting-plane algorithm, Branch-and-Cut
hours