This Postgraduate certificate will allow you to update your knowledge in Algorithm and Complexity a practical way, 100% online, without renouncing to the maximum educational rigor”

This program is aimed at those people interested in reaching a higher level of knowledge in Algorithm and Complexity. The main objective is for students to specialize their knowledge in simulated work environments and conditions in a rigorous and realistic manner so they can later apply it in the real world.

This program will prepare scientifically and technologically, as well as to develop the professional practice of IT engineering, with a transversal and versatile approach adapted to the new technologies and innovations in this field. Students will gain extensive knowledge on Algorithm and Complexity from professionals in the field.

The students will be able to take the opportunity and study this program in a 100% online format, without neglecting their obligations.

Learn the latests techniques and strategies with this program and achieve the sucess as an IT Engineer”

This Postgraduate certificate in Algorithm and Complexity contains the most complete and up-to-date program on the market. The most important features include:

• Development of 100 simulated scenarios presented by experts in Algorithm and Complexity
• Its graphic, schematic and practical contents, with which they are conceived gather scientific and practical information on Algorithm and Complexity
• News on the latest developments in Algorithm and Complexity
• It contains practical exercises where the self-assessment process can be carried out to improve learning
• Interactive learning system based on the case method and its application to real practice
• All of this will be complemented by theoretical lessons, questions to the expert, debate forums on controversial topics, and individual reflection assignments
• Content that is accessible from any fixed or portable device with an Internet connectiont

Learn about Algorithm and Complexity with this intensive program, from the comfort of your home”

It includes in its teaching staff professionals belonging to the field of IT engineering, who bring to this program their work experience, in addition to recognized specialists belonging to reference societies and prestigious universities.

Thanks to its multimedia content developed with the latest educational technology, this Postgraduate certificate will allow the professional a situated and contextual learning, that is to say, a simulated environment that will provide an immersive learning programmed to learn in real situations.

This program is designed around Problem-Based Learning, whereby the students must try to solve the different professional practice situations that arise throughout the program. For this purpose, the professionals will be assisted by an innovative interactive video system created by renowned and experienced experts in Algorithm and Complexity and extensive teaching experience.

 Make the most of the latest educational technology to get up to date in Algorithm and Complexity without leaving your home"

Learn about the latest techniques in Postgraduate certificate from experts in the field"

The structure of the contents has been designed by a team of IT engineering professionals, aware of the relevance of current preparation in order to delve into this area of knowledge in order to humanistically enrich the students and raise the level of knowledge in Algorithmics and Complexity through the latest educational technologies available.

This Postgraduate certificate in Algorithm and Complexity contains the most complete and up-to-date program on the market”

Module 1. Algorithm and Complexity

1.1. Introduction to Algorithm Design Strategies

1.1.1. Recursion
1.1.2. Divide and Conquer
1.1.3. Other Strategies

1.2. Efficiency and Analysis of Algorithms

1.2.1. Efficiency Measures
1.2.2. Measuring the Size of the Input
1.2.3. Measuring Execution Time
1.2.4. Worst, Best and Average Case
1.2.5. Asymptotic Notation
1.2.6. Criteria for Mathematical Analysis of Non-Recursive Algorithms
1.2.7. Mathematical Analysis of Recursive Algorithms
1.2.8. Empirical Analysis of Algorithms

1.3. Sorting Algorithms

1.3.1. Concept of Sorting
1.3.2. Bubble Sorting
1.3.3. Sorting by Selection
1.3.4. Sorting by Insertion
1.3.5. Merge Sort
1.3.6. Quicksort

1.4. Algorithms with Trees

1.4.1. Tree Concept
1.4.2. Binary Trees
1.4.3. Tree Paths
1.4.4. Representing Expressions
1.4.5. Ordered Binary Trees
1.4.6. Balanced Binary Trees

1.5. Algorithms Using Heaps

1.5.1. Heaps
1.5.2. The Heapsort Algorithm
1.5.3. Priority Queues

1.6. Graph Algorithms

1.6.1. Representation
1.6.2. Traversal in Width
1.6.3. Depth Travel
1.6.4. Topological Sorting

1.7. Greedy Algorithms

1.7.1. Greedy Strategy
1.7.2. Elements of the Greedy Strategy
1.7.3. Currency Exchange
1.7.4. Traveler’s Problem
1.7.5. Backpack Problem

1.8. Minimal Path Finding

1.8.1. The Minimum Path Problem
1.8.2. Negative Arcs and Cycles
1.8.3. Dijkstra's Algorithm

1.9. Greedy Algorithms on Graphs

1.9.1. The Minimum Covering Tree
1.9.2. Prim's Algorithm
1.9.3. Kruskal’s Algorithm
1.9.4. Complexity Analysis

1.10. Backtracking

1.10.1. Backtracking
1.10.2. Alternative Techniques

A unique, key, and decisive educational experience to boost your professional development”