Algorithmic Problems in Java

Algorithmic Problems in Java 
Duration: 4hr | Video: h264, yuv420p, 1280×720 30fps | Audio: aac, 44100 Hz, 2 ch | 688 MB
Genre: eLearning | Language: English

Learn the basic algorithmic methodologies from backtracking to dynamic programming
* Lectures 21
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.
In each section we will talk about the theoretical background for all of these algorithms then we are going to implement these problems together.
The first chapter is about backtracking: we will talk about problems such as N-queens problem or hamiltonian cycles and coloring problem. In the second chapter we will talk about dynamic programming, theory first then the concrete examples one by one: fibonacci sequence problem and knapsack problem.

Download uploaded
http://uploaded.net/file/ngnmq0m2/algorithimJava.part1.rar
http://uploaded.net/file/il63gxlm/algorithimJava.part2.rar
http://uploaded.net/file/rkxew0fi/algorithimJava.part3.rar

Download nitroflare
http://www.nitroflare.com/view/C830BE003B33F24/algorithimJava.part1.rar
http://www.nitroflare.com/view/C63A86DF9D1A3F0/algorithimJava.part2.rar
http://www.nitroflare.com/view/C56B0467A029A60/algorithimJava.part3.rar

Download 百度云

你是VIP 1个月(1 month)赞助会员，