Advanced Algorithms in Java

Breadth-first search, depth-first search, shortest path, arbitrage, strongly connected components and graph algorithms

Best Seller

Created by Holczer Balazs
Last updated 11/2017
English
What Will I Learn?
  • Learn about the applications of data structures
  • Implement advanced algorithms efficiently
  • Able to move towards advanced topics such as machine learning or big data analysis
  • Get a good grasp of algorithmic thinking
  • Get to know graph algorithms: BFS, DFS, shortest paths and spanning trees
Requirements
  • Core Java
  • Eclipse IDE
  • Internet connection
  • Basic knowledge of data structures
Description

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 11 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.

In the first section we are going to talk about the main graph traversal algorithms (BFS, DFS) and its applications of course such as WebCrawler or topological ordering. The next section is about shortest path algorithms: there are several applications which we are going to be familiar with from image processing to FOREX arbitrage. The next chapter is about minimum spanning trees and clustering algorithms. Then, we are going to learn about the maximum flow problem, maybe the most important algorithm in this course. The last chapter is about how to solve NP problems such as the travelling salesman problem with simulated annealing.

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.

Who is the target audience?
  • This course is meant for everyone from scientists to software developers who want to get closer to algorithmic thinking in the main

Size: 1.28G

 

Content retrieved from: https://www.udemy.com/advanced-algorithms-in-java/.

15 Comments

  1. ♕● Diana ●♕ March 30, 2018 Reply
  2. suhana February 18, 2018 Reply
  3. yoyoloit February 11, 2018 Reply
    • Cutiepie March 4, 2018 Reply
  4. ben January 25, 2018 Reply
  5. ROCK BOY January 17, 2018 Reply
  6. hackerin Juan January 14, 2018 Reply
  7. Drovosek January 13, 2018 Reply
  8. rko January 13, 2018 Reply
  9. John January 13, 2018 Reply
  10. soung January 12, 2018 Reply
  11. John Powell January 11, 2018 Reply
  12. Archanter January 10, 2018 Reply
  13. Teachex(youtube) January 10, 2018 Reply
    • vidhan January 12, 2018 Reply

Add a Comment

Your email address will not be published. Required fields are marked *