Udemy – Advanced Algorithms in Java 2019-4

Description

Advanced Algorithms in Java is a video tutorial on advanced algorithms in Java from the Udemy site. This course is about advanced algorithms that focus on graph motion, shortest path problems, tree spanning and maximum flow problems, and many Google Web Crawler applications to use arbiter stock market positions. This course takes about 11 hours to complete, but I highly recommend typing these algorithms several times so you can learn about it. You can download the source code of the whole lesson in the last lecture.

In the first part we talk about the main graph transaction algorithms (BFS, DFS) and its applications such as WebCrawler or topological ordering. The next section is about the shortest path algorithms: There are several programs that we will learn about from image processing to Forex arbitrage. The next chapter is about the minimum spanning tree and the clustering algorithm. Then, on the issue of maximum flow, we will learn perhaps the most important algorithm in this lesson. The last chapter is about how to solve NP problems. If you want to remember the advanced topics related to algorithms, you should definitely do this lesson. There are a number of areas in which this method can be used: from software engineering to scientific research.

Advanced Algorithms in Java course feature

Learn more about data structure programs

Able to move towards advanced topics such as machine learning or big data analysis

Know graph graphs: BFS, DFS, shortest path and spanning tree

Implement advanced algorithms effectively

Have a good understanding of algorithmic thinking

Course details:

Duration: 09:45:36

English language

Number of lessons: 76 lessons

Movie format: AVC 1280 720

Audio: AAC 44KHz 2ch

Instructor: Holczer Balazs

Chapters of this course:

Course content 76 lectures 09:45:36

Introduction 2 lectures 11:22

Breadth-First Search 4 lectures 42:24

Depth-First Search 11 lectures 01:30:51

Shortest Path Algorithms 14 lectures 01:53:53

Spanning Trees 12 lectures 01:57:15

Strongly Connected Components 9 lectures 50:53

Maximum Flow Problem 14 lectures 01:26:11

Travelling Salesman Problem (TSP) 7 lectures 01:01:27

Euler cycle – Chinese Postman Problem 1 lecture 10:49

Course Materials (DOWNLOADS) 1 lecture 00:02

DISCOUNT FOR OTHER COURSES! 1 lecture00:59

Requirements

Core Java Eclipse IDE Internet connection Basic knowledge of data structures

Sample

Installation

After Extract, watch with your favorite Player.

English subtitle

Quality: 720p

Changes:

The 2019/4 version has increased in size by about 1.2 GB compared to the 2017/11 version.