This Postgraduate certificate will allow you to update your knowledge in Advanced Algorithm Design in a practical way, 100% online, without renouncing to the highest academic rigor”

This program is intended for those interested in achieving a higher level of knowledge in Advanced Algorithms Design. The main objective is to learn student to apply in real world the knowledge acquired in this Postgraduate certificate, in a work environment that reproduces the conditions that can be found in their future, in a rigorous and realistic way.

This Postgraduate certificate will prepare the student for professional practice of computer engineering, thanks to a transversal and versatile study adapted to new technologies and innovations in this field. You will obtain wide knowledge in Advanced Algorithms Design, from the hand of professionals in the sector. 

The student will be able to take advantage of the opportunity and take this course in a 100% online format, without having to give up their obligations.

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

This Postgraduate certificate in Advanced Algorithms Design 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 Advanced Algorithms Design
• Its graphic, schematic and eminently practical contents provide scientific and practical information on Advanced Algorithms Design
• News on the latest advances in Advanced Algorithms Design 
• Contains practical exercises where the self-assessment process can be performed 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 connection 

Get qualified in Advanced Algorithms Design with this intensive program, from the comfort of your own home”

It includes in its teaching staff professionals belonging to the Computer Engineering field, who pour into this learning their work experience, as well as 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, a simulated environment that will provide an immersive learning programmed to prepare for real situations. 

The program's design is focused on Problem-Based Learning, by means of which the professor must try to solve different professional practice situations that arise throughout the Postgraduate certificate. For this, the professional will be assisted by an innovative interactive video system created by recognized experts in Advanced Algorithms Design with extensive teaching experience. 

Take advantage of the latest educational technology to get updated in Advanced Algorithms Design without leaving home"

Learn the latest techniques in Advanced Algorithms Design from experts in the field"

The content structure has been designed by a team of Computer Engineering professionals, aware of the relevance of current study in order to deepen this area of knowledge in order to humanistically enrich students and raise their knowledge level in Advanced Algorithms Design through the latest educational technologies available. 

This Postgraduate certificate in Advanced Algorithms Design contains the most complete and updated learning program in the market”

Module 1. Advanced Algorithms Design 

1.1. Analysis of Recursive and Divide and Conquer Algorithms 

1.1.1. Posing and Solving Homogeneous and Non-Homogeneous Recurrence Equations 
1.1.2. General Description of the Divide and Conquer Strategy 

1.2. Amortized Analysis 

1.2.1. Aggregate Analysis 
1.2.2. The Accounting Method 
1.2.3. The Potential Method 

1.3. Dynamic Programming and Algorithms for NP Problems 

1.3.1. Characteristics of Dynamic Programming 
1.3.2. Backtracking: Backtracking 
1.3.3. Branching and Pruning 

1.4. Combinatorial Optimization 

1.4.1. Representation 
1.4.2. 1D Optimization 

1.5. Randomization Algorithms 

1.5.1. Examples of Randomization Algorithms 
1.5.2. The Buffon Theorem 
1.5.3. Monte Carlo Algorithm 
1.5.4. Las Vegas Algorithm 

1.6. Local and Candidate Search 

1.6.1. Gradient Ascent 
1.6.2. Hill Climbing 
1.6.3. Simulated Annealing 
1.6.4. Tabu Search 
1.6.5. Candidate Search 

1.7. Formal Verification of Programs 

1.7.1. Specification of Functional Abstractions 
1.7.2. The Language of First-Order Logic 
1.7.3. Hoare's Formal System 

1.8. Verification of Iterative Programs 

1.8.1. Rules of Hoare's Formal System 
1.8.2. Concept of Invariant Iterations 

1.9. Numeric Methods

1.9.1. The Bisection Method 
1.9.2. Newton Raphson's Method 
1.9.3. The Secant Method 

1.10. Parallel Algorithms 

1.10.1. Parallel Binary Operations 
1.10.2. Parallel Operations with Networks 
1.10.3. Parallelism in Divide and Conquer 
1.10.4. Parallelism in Dynamic Programming

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