MP4 | Video: h264, 1280×720 | Audio: AAC, 44.1 KHz, 2 ChGenre: eLearning | Language: English + .VTT | Duration: 6.5 hours | Size: 3.96 GBRecursion, backtracking, dynamic programming and data structures (linked lists, queues, stacks and binary search trees)What you’ll learnwhat is recursionwhat are backtracking and dynamic programmingwhat are the fundamental data structures: array, linked lists, stacks, queues and binary search treesRequirementsC++ fundamentalsDescriptionThis course is for those who are interested in computer science and want to implement the algorithms and given data structures in C++ from scratch.

In every chapter you will learn about the theory of a given data structure or algorithm and then you will implement them from scratch.

Chapter 1: Recursiontheory behind recursion (recursive function calls)recursion and stack memory of the OSrecursive problems: binary search and Towers of Hanoi problemChapter 2: Backtrackingwhat is backtrackinghow to solve problems with backtrackingN-queens problem, coloring problem and knight’s tourChapter 3: Dynamic Programmingoverlapping subproblems and dynamic programmingwhat is “memoization”Fibonacci numbers and knapsack problemChapter 4: Data Structuresdata structures and abstract data types (ADTs)arrays and linked listsstacksqueuesbinary search treespriority queues (heaps)associative arrays (maps)Thanks for joining my course, let’s get started!Who this course is for:Intermediate C++ developers curious about algorithms and data structures