Classes/Consulting

Algorithms

Development and Evaluation

Performance Increase

Complexity (Θ,Ω,O)


Formal Language Theory

RL, CFL, NCFL

DFA e NFA

DPDA e NPDA

Turing Machines

Pumping Lemma


Graphs Theory

Paths and Circuits

Conectivity and Coloration

Algorithms (BP,BL,Tarjan,Dijkstra,Floyd..)

Induction and Denial Proof


Computer Architecture

Assembly

Circuits and Karnaugh Map

Mono/Multicycle Architecture

Performance

Cache Management (Hit/Miss Ratio)


Distributed and Parallel Programming

Sockets TCP/UDP

Fault Tolerance (deadlocks, packet lost, connection lost..)

Task Distribution

OpenMP

Background Operations

Sincronism Algorithms

Semaphores

Multicore Processing

Barrier

Threads


Operationg Systems

Memory Management

Disk Management

Process Management

Victim Choosing Algorithms


Graphic Aplications

Linear Transformation

Image Signals

Geometric Transformations

Bilinear Interpolation

Bicubic Interpolation


Requiriments Analysis (Agile Development)

Define the Requeriments of the Project

Set Up the First Prototype Requirements

Create the Agile Enviroment for the Project

SCRUM