Udemy - Algorithmic Problems in Python (2015)

seeders: 1

leechers: 1

Download torrent

Added on November 25, 2015 by zeeshan65956in Other > Tutorials
Torrent verified.

Main

add to bookmarks

Udemy - Algorithmic Problems in Python (2015) (Size: 623.71 MB)

		002 Complexity theory introduction.jpeg	205.96 KB
		001 Introduction.mp4	3.87 MB
		002 Complexity theory introduction.mp4	56.22 MB
		007 Coloring problem introduction.mp4	42.08 MB
		012 Maze problem implementation.mp4	24.5 MB
		011 Maze problem introduction.mp4	7.67 MB
		006 Hamiltonian cycle implementation.mp4	29.42 MB
		001 Backtracking introduction.mp4	13.74 MB
		005 Hamiltonian problem - NP-hard problems.mp4	19.56 MB
		003 N-queens problem implementation.mp4	15.46 MB
		002 N-queens problem introduction.mp4	23.87 MB
		010 Knight tour implementation.mp4	10.36 MB
		008 Coloring problem implementation.mp4	27.46 MB
		004 Coin change problem introduction.mp4	53.13 MB
		003 Fibonacci numbers implementation.mp4	15.37 MB
		001 Dynamic programming introduction.mp4	10.59 MB
		008 Knapsack problem introduction.mp4	28.89 MB
		007 Rod cutting problem implementation.mp4	12.77 MB
		005 Coin change problem implementation.mp4	20.24 MB
		006 Rod cutting problem introduction.mp4	48.59 MB
		010 Knapsack problem implementation.mp4	29.36 MB
		002 Fibonacci numbers introduction.mp4	17.16 MB
		009 Knapsack problem example.mp4	54.29 MB

Description

Algorithmic Problems in Python

=============
[COVER:]
=============

=============
[INFO:]
=============

Year: 2015
Manufacturer: Udemy
Website: https://www.udemy.com/algorithmic-problems-in-python/
Author: Holczer Balazs, Software Engineer
Duration: 2:51:46
Type of material handed out: videos
Language: English

=============
[Description:]
=============

Learn the basic algorithmic methodologies from backtracking to dynamic programming: Sudoku, Knapsack problem. 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 we are going then 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.

IF U LIKE MY UPLOAD, TAKE A SECOND TO LIKE OR SAY THANK U

Please use 7Zip/WinRAR/Universal Extractor to EXTRACT FILES

Sharing Widget

Download torrent

623.71 MB

seeders:1

leechers:1

Udemy - Algorithmic Problems in Python (2015)