NitroFlare Algorithmic Problems in Java.

Discussion in 'E-Books & Tutorials' started by mitsumi, Nov 11, 2015.

  1. mitsumi

    mitsumi Active Member

    Joined:
    Jun 8, 2012
    Messages:
    3,538
    Likes Received:
    5
    Trophy Points:
    38
    [​IMG]
    Algorithmic Problems in Java
    Duration: 4hr | Video: h264, yuv420p, 1280x720 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.

    [​IMG]

    [​IMG]

    Code:
    
    
    http://www.nitroflare.com/view/311B7E1F34860CB/h1rxw.Algorithmic.Problems.in.Java.part1.rar
    http://www.nitroflare.com/view/6238F495249BB73/h1rxw.Algorithmic.Problems.in.Java.part2.rar
    http://www.nitroflare.com/view/500D4FD6BF68C5E/h1rxw.Algorithmic.Problems.in.Java.part3.rar
    
    
    
    
    
    
     

Share This Page