About this Course

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 R& D.

Section 1:

what are recursion and recursive methods

linear and binary search

tower of Hanoi problem

Section 2:

what are selection algorithms

quickselect algorithm

the secretary problem

Section 3:

what is backtracking

n-queens problem and Hamiltonian cycle problem

knight's tour problem

Sudoku game

Section 4:

what is dynamic programming

knapsack problem

coin change problem and rod cutting problem

Section 5:

bin packing problem

closest pair of points problem

Section 6:

top interview questions (Google, Facebook and Amazon)

The first chapter is about backtracking: we will talk about problems such as n-queens problem or hamiltonian cycles, coloring problem and Sudoku problem. In the second chapter we will talk about dynamic programming, theory then the concrete examples one by one: fibonacci sequence problem and knapsack problem.

In each section we will talk about the theoretical background for all of these algorithms then we are going to implement these problems together from scratch in Java.

FINALLY YOU CAN LEARN ABOUT THE MOST COMMON INTERVIEW QUESTIONS (Google, MicroSoft, EPAM etc.)

Thanks for joining the course, let's get started!

Basic knowledge

Students should have some basic programming background (loops, classes, objects etc.)

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 R& D.

Section 1:

what are recursion and recursive methods

linear and binary search

tower of Hanoi problem

Section 2:

what are selection algorithms

quickselect algorithm

the secretary problem

Section 3:

what is backtracking

n-queens problem and Hamiltonian cycle problem

knight's tour problem

Sudoku game

Section 4:

what is dynamic programming

knapsack problem

coin change problem and rod cutting problem

Section 5:

bin packing problem

closest pair of points problem

Section 6:

top interview questions (Google, Facebook and Amazon)

The first chapter is about backtracking: we will talk about problems such as n-queens problem or hamiltonian cycles, coloring problem and Sudoku problem. In the second chapter we will talk about dynamic programming, theory then the concrete examples one by one: fibonacci sequence problem and knapsack problem.

In each section we will talk about the theoretical background for all of these algorithms then we are going to implement these problems together from scratch in Java.

FINALLY YOU CAN LEARN ABOUT THE MOST COMMON INTERVIEW QUESTIONS (Google, MicroSoft, EPAM etc.)

Thanks for joining the course, let's get started!

Basic knowledge

Students should have some basic programming background (loops, classes, objects etc.)

Students should have some basic programming background (loops, classes, objects etc.)

What you will learn

You will understand the following concepts:

Recursion

Backtracking

Search algorithms: linear and binary search

Dynamic programming

You will understand the following concepts:

Recursion

Backtracking

Search algorithms: linear and binary search

Dynamic programming

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

• Lifetime Access to Each Course

• Certificate on Completion of Course

• No Extra Charges Or Admin Fees

• Easy Access to Courses

• High Priority Support After Sales.

• Big Discounts on Individual Courses

• Certificate on Completion of Course

• No Extra Charges Or Admin Fees

• Easy Access to Courses

• High Priority Support After Sales.

• Big Discounts on Individual Courses

IT and Computing courses are available to study on our learning platform.

Adult education is the non-credential activity of gaining skills and improved education.

Online education is electronically supported learning that relies on the Internet for teacher/student interaction.

A short course is a learning programme that gives you combined content or specific skills training in a short period of time. Short courses often lean towards the more practical side of things and have less theory than a university course – this gives you a more hands-on experience within your field of interest.

Course duration is 24 hours.