Algorithmic Problems in Java 2018
Algorithmic Problems in Java
.MP4, AVC, 300 kbps, 1280x720 | English, AAC, 192 kbps, 2 Ch | 6h 55m | 948 MB
  
Backtracking, dynamic programming, Sudoku, knapsack problem, binpacking, closest pair of points, recursion, monte carlo


This course is about the fundamental concepts of algorithmic problems, focusing on backtracking and dynamic programming. As far as I am concerned these techniques are very important nowadays, algorithms can be used (and have several applications) in several fields from software engineering to investment banking or research & development.

The first chapter is about backtracking: we will talk about problems such as N-queens problem or hamiltonian cycles, coloring problem and Sudoku problem. In the second chapter we will talk about dynamic programming, theory then the concrete examples one by one: fibonacci sequence problem and knapsack problem.

In each section we will talk about the theoretical background for all of these algorithms then we are going to implement these problems together from scratch in Java.

 

More info - https://www.udemy.com/algorithmic-problems-in-java/

 

Algorithmic Problems in Java 2018


SpyOFF VPN

 TO MAC USERS: If RAR password doesn't work, use this archive program: 

RAR Expander 0.8.5 Beta 4  and extract password protected files without error.


 TO WIN USERS: If RAR password doesn't work, use this archive program: 

Latest Winrar  and extract password protected files without error.


 Gamystyle   |  

Information
Members of Guests cannot leave comments.


Videohive Wow Pack Series
Videohive Wow Pack Series
Venom 2018


rss