UDEMY 2021 - Advanced Algorithms in Java
- 1. UDEMY 2021 - Advanced Programming Paradigms (PLC IV)
- 2. UDEMY 2021 - Selenium Webdriver with Java (Basics + Advance + Architect)
- 3. UDEMY 2021 - Docker Mastery: with Kubernetes +Swarm from a Docker Captain
- 4. UDEMY 2021 - All You Need to Know About REST Integration In ServiceNow
Graph algorithms, breadth-first search, depth-first search, shortest path, arbitrage, strongly connected components
What you’ll learn
This course is about advanced algorithms focusing on graph traversal, shortest path problems, spanning trees and maximum flow problems and a lots of its applications from Google Web Crawler to taking advantage of stock market arbitrage situations.
The course is going to take approximately 10 hours to completely but I highly suggest you typing these algorithms out several times in order to get a good grasp of it. You can download the source code of the whole course at the last lecture.
You should definitely take this course if you are interested in advanced topics concerning algorithms. There are a bunch of fields where these methods can be used: from software engineering to scientific research.
Thanks for joining the course, let’s get started!
Who this course is for:
Created by Holczer BalazsLast updated 4/2019EnglishEnglish, Spanish [Auto-generated]
Size: 2.71 GB