Algorithmic Problems & Neural Networks in Python

Learn the basic algorithmic methodologies from backtracking to dynamic programming: Sudoku, Knapsack problem
4.0 (9 ratings) Instead of using a simple lifetime average, Udemy calculates a
course's star rating by considering a number of different factors
such as the number of ratings, the age of ratings, and the
likelihood of fraudulent ratings.
457 students enrolled
Instructed by Holczer Balazs IT & Software / Other
$19
$60
68% off
Take This Course
  • Lectures 44
  • Length 4.5 hours
  • Skill Level All Levels
  • Languages English
  • Includes Lifetime access
    30 day money back guarantee!
    Available on iOS and Android
    Certificate of Completion
Wishlisted Wishlist

How taking a course works

Discover

Find online courses made by experts from around the world.

Learn

Take your courses with you and learn anywhere, anytime.

Master

Learn and practice real-world skills and achieve your goals.

About This Course

Published 11/2015 English

Course Description

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.

What are the requirements?

  • Basic Python

What am I going to get from this course?

  • Understand backtracking
  • Understand dynamic programming
  • Solve problems from scratch
  • Implement feedforward neural networks from scratch

What is the target audience?

  • This course is meant for newbies who are not familiar with algorithmic problems in the main or students looking for some refresher

What you get with this course?

Not for you? No problem.
30 day money back guarantee.

Forever yours.
Lifetime access.

Learn on the go.
Desktop, iOS and Android.

Get rewarded.
Certificate of completion.

Curriculum

Section 1: Introduction
Introduction
Preview
01:16
Section 2: Complexity Theory
Complexity notations
09:31
Complexity notations example
09:10
Algorithm running times
09:37
Complexity classes
07:13
Section 3: Backtracking
Backtracking introduction
Preview
03:11
N-queens problem introduction
Preview
07:38
N-queens problem implementation
Preview
06:29
Hamiltonian cycle introduction
11:29
Hamiltonian problem - NP-hard problems
04:17
Hamiltonian cycle implementation
07:05
Coloring problem introduction
09:54
Coloring problem implementation
07:11
Knight tour introduction
02:55
Knight tour implementation
06:26
Maze problem introduction
02:52
Maze problem implementation
06:13
Section 4: Dynamic Programming
Dynamic programming introduction
02:25
Fibonacci numbers introduction
04:15
Fibonacci numbers implementation
04:18
Knapsack problem introduction
06:40
Knapsack problem example
14:42
Knapsack problem implementation
07:00
Coin change problem introduction
14:54
Coin change problem implementation
05:45
Rod cutting problem introduction
12:41
Rod cutting problem implementation
03:35
Section 5: Feedforward Neural Network Theory
Neural networks introduction
11:03
Feedforward neural networks
07:42
Training a neural network
08:37
Error calculation
03:12
Gradient calculation
08:35
Backpropagation
03:18
Resilient propagation
04:20
Deep learning
02:41
Applications of neural networks
05:56
Section 6: Neural Network Implementation
Implementation I
04:31
Implementation II
03:04
Implementation III
02:16
Implementation IV
02:47
Implementation V
04:10
Implementation VI
05:29
Section 7: Source Code
Source code
Article
Coupon codes - get any of my other courses for a discounted price
Article

Students Who Viewed This Course Also Viewed

  • Loading
  • Loading
  • Loading

Instructor Biography

Holczer Balazs, Software Engineer

Hi!

My name is Balazs Holczer. I am from Budapest, Hungary. I am qualified as a physicist and later on I decided to get a master degree in applied mathematics. At the moment I am working as a simulation engineer at a multinational company. I have been interested in algorithms and data structures and its implementations especially in Java since university. Later on I got acquainted with machine learning techniques, artificial intelligence, numerical methods and recipes such as solving differential equations, linear algebra, interpolation and extrapolation. These things may prove to be very very important in several fields: software engineering, research and development or investment banking. I have a special addiction to quantitative models such as the Black-Scholes model, or the Merton-model. Quantitative analysts use these algorithms and numerical techniques on daily basis so in my opinion these topics are definitely worth learning.

Ready to start learning?
Take This Course