Generic selectors
Exact matches only
Search in title
Search in content
Search in posts
Search in pages
Categories
Academic
ACloudGuru Course's
AdamWathan Course's
All-in-One
Apress Course's
BBST Course's
BitDegree Coupon's
Blogs
Books
Business
Business
CAREER & MONEY
CBT Nuggets Course's
Code with Mosh
Code4Startup Course's
Coupon's
Coursera Coupon's
Coursera Course's
Crypto and Blockchain
Data Science
Design
Development
Download
E-commerce
Eduonix Coupon's
FrontendMasters Course's
Game Development
Game Development with Unity
Gamified Coding Courses
Graphic Design
Impostant News Must Read!
INE Course's
Information Security
IT & Software
JSFullstacker Course's
Language
Languages
LARACASTS Course's
LevelUpTutorials Course's
LIFESTYLE
Linkedin Course's
Linux Academy Course's
LiveLessons Course's
Lynda Course's
Marketing
Marketing
Masterclass Course's
Music
O’REILLY Course's
Office Productivity
Other Course's
Packt Course's
PentesterAcademy Course's
Personal Development
Personal Development
PERSONAL GROWTH
PHLearn
Photography
PLURALSIGHT Course's
Programming Languages
School Of Motion Course's
SkillShare Course's
Software Engineering
Spanish
StoneRivereLearning Course's
TeamTreeHouse Course's
TechnicsPub Course's
Top Books Free
TutsPlus Course's
TylerMcGinnis Course's
Udemy Coupons
Udemy Download
Uncategorized
Web Development
WintellectNow Course's




Advanced Algorithms In Java

Advanced Algorithms In Java

Graph algorithms, breadth-first search, depth-first search, shortest path, arbitrage, strongly connected components

What you’ll 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.

Section 1:

  • the basic graph traversal algorithm
  • breadth-first search algorithm
  • depth-first search algorithm

Section 2:

  • shortest path algorithms
  • Dijkstra’s algorithm
  • Bellman-Ford algorithm

Section 3:

  • what are spanning trees
  • union find data structures
  • Kruskal’s algorithm
  • Prim’s algorithm

Section 4:

  • what are strongly connected components
  • Kosaraju algorithm
  • Tarjan algorithm

Section 5:

  • the famous maximum flow problem
  • how to reduce most of the hard problems to maximum flow problem
  • Ford-Fulkerson algorithm
  • bipartite matching problem

Section 4:

  • travelling salesman problem (TSP)
  • how to deal with NP-hard problems
  • using meta-heuristics: tabu search and simulated annealing

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.

Related Posts:   Easy WordPress Challenge: How to Boost Your Site's Reach

Thanks for joining the course, let’s get started!

Who this course is for:

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

Created by Holczer Balazs
Last updated 4/2019
English
English, Spanish [Auto-generated]

Size: 2.71 GB

 

 

 

 

https://www.udemy.com/course/advanced-algorithms-in-java/.


Related Posts