event cover

Webinar on Backtracking

Starts on

08:00 PM, 25 Jun 2020

Price

Free

Venue

Online

Description

Backtracking is an algorithmic technique used to solve problems recursively by building a solution incrementally, one piece at a time, removing the solutions that fail to satisfy the constraints of the problem at any point of time.

 

Backtracking can only be applied for problems which admit the concept of a "Partial Candidate Solution" and a relatively quick test of whether it can be completed to a valid solution.

 

Backtracking is an important tool for solving constraint satisfaction problems, such as crosswords, verbal arithmetic, Sudoku and many other puzzles. It is often the most convenient technique for parsing, for knapsack problems and other combinatorial optimization problems.

 

   Whereas Data Structures are structured     programmes to store ordered data, so that various operations can be performed on it easily. It represents the knowledge of data to be organised in memory. And Algorithms are a finite set of instructions or logic, written in order, to accomplish a certain predefined task.

 

 

Know more about Backtracking , Data Structures and Algorithm & its uses by registering for our Webinar on 25 June 2020, by Navdeep Sandhu.

About the Speaker:

Navdeep Sandhu holds a B.Tech Degree in Information & Technology and has previously worked with Ernst and Young. At Coding Ninjas, he works tirelessly for the student support and works closely with the Teaching Assistants to enhance the student experience during their formative classes.

 

What will you learn in this webinar?

 

- What is Backtracking

- Backtracking Algorithms

 - Recursive Backtracking

- Sum of Subset Problem using Backtracking 

- Solution of 4 Queens Problem using Backtracking

- Time Complexity of Sum of Subsets Problem using Backtracking

- Examples of Knapsack problems in Backtracking 

- How to get better at Data Structures and Algorithms

- Importance of Machine Learning in Data Structures and Algorithms

 - Linked Lists in Data Structures and Algorithms
 - Array in Data Structures and Algorithms

 

So, don't wait. Register today and know how you can solve problems with ease through Backtracking, Data Structures & Algorithms!

 

Speakers
Navdeep Sandhu
Navdeep Sandhu
Profile link
Navdeep Sandhu holds a B.Tech Degree in Information & Technology and has previously worked with Ernst and Young. At Coding Ninjas, he works tirelessly for the student support and works closely with the Teaching Assistants to enhance the student experience during their formative classes.