2015
Udemy
Holczer Balazs , Software Engineer
02:51:46
English
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 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.
├── 01 Introduction
│ ├── 001 Introduction.mp4
│ ├── 002 Complexity theory introduction.jpeg
│ └── 002 Complexity theory introduction.mp4
├── 02 Backtracking
│ ├── 001 Backtracking introduction.mp4
│ ├── 002 N-queens problem introduction.mp4
│ ├── 003 N-queens problem implementation.mp4
│ ├── 004 Hamiltonian cycle introduction.mp4
│ ├── 005 Hamiltonian problem - NP-hard problems.mp4
│ ├── 006 Hamiltonian cycle implementation.mp4
│ ├── 007 Coloring problem introduction.mp4
│ ├── 008 Coloring problem implementation.mp4
│ ├── 009 Knight tour introduction.mp4
│ ├── 010 Knight tour implementation.mp4
│ ├── 011 Maze problem introduction.mp4
│ └── 012 Maze problem implementation.mp4
├── 03 Dynamic Programming
│ ├── 001 Dynamic programming introduction.mp4
│ ├── 002 Fibonacci numbers introduction.mp4
│ ├── 003 Fibonacci numbers implementation.mp4
│ ├── 004 Coin change problem introduction.mp4
│ ├── 005 Coin change problem implementation.mp4
│ ├── 006 Rod cutting problem introduction.mp4
│ ├── 007 Rod cutting problem implementation.mp4
│ ├── 008 Knapsack problem introduction.mp4
│ ├── 009 Knapsack problem example.mp4
│ └── 010 Knapsack problem implementation.mp4
https://www.udemy.com/algorithmic-problems-in-python/
Download File Size:580.01 MB