Learn C++ Programming with Data Structures and Algorithms

Data Structures and Algorithms are very important when it comes to programming/coding rounds during campus and off-campus placements. Service-Based or Product-based companies both specifically focus more on knowledge of Data Structures and Algorithms. It is very important when it comes to code implementation. This Data Structures & Algorithms Recorded Training will help all stream students to learn DSA programming right from the basics and help them crack programming rounds for all major companies.

Our DSA recorded lectures will guide you to learn different types of data structures and algorithms and their implementations in C++

 

• 20 Hours of Recorded Course on DSA using C++ which you can access anytime.
• 20 Hours f Recorded Course on C++ Conceptual course to clear basics
• Certification after completion of course
• You can watch courses at any time on a laptop as well as mobile. It's a recorded course.
• This course covers all you need to know about DSA even if you never programmed before!

DSA Introduction

• What is an algorithm?
• Why to learn algorithms?
• Asymptotic Notations
• Master Theorem
• Divide and Conquer Algorithm
• Data Structures (Part I)
• Array
• Stack
• Queue
• Types of Queue
• Circular Queue
• Priority Queue
• Deque
• Data Structures (Part II)
• Linked List
• Linked List Operations
• Linked List Traversals
• Types of Linked List
• Hash Table
• Heap Data Structure
• Fibonacci Heap
• Decrease Key and Delete node from Fibonacci Heap
• Tree based DSA (Part I)
• Tree Data Structure
• Tree Traversal
• Binary TreeFull
• Binary Tree
• Perfect Binary Tree
• Complete Binary Tree
• Balanced Binary Tree
• Binary Search Tree
• AVL Tree
• Tree based DSA (Part II)
• B Tree
• Insertion into B-tree
• Deletion from B-tree
• B+ Tree
• Insertion on a B+ Tree
• Deletion from a B+ Tree
• Red Black Tree
• Insertion in Red Black Tree
• Deletion from Red Black Tree

Recursion

• Introduction to Recursion
• Tail Recursion
• Natural Number Check using Recursion
• Palindrome Check using Recursion
• Tower of Hanoi

Hashing

• Introduction to Hashing
• Address Table
• Collision Handling
• Open Addressing
• Double Hashing
• Chaining v/s Open Addressing

Graph based DSA

• Graph Data Structure
• Spanning Tree
• Strongly Connected Components
• Adjacency Matrix
• Adjacency List
• DFS Algorithm
• Breadth-first Search
• Bellman Ford's Algorithm

Sorting and Searching Algorithms

• Bubble Sort
• Selection Sort
• Insertion Sort
• Merge Sort
• Quick Sort
• Counting Sort
• Radix Sort
• Bucket Sort
• Heap Sort
• Shell Sort
• Linear Search
• Binary Search

Greedy Algorithms

• Greedy Algorithm
• Ford-Fulkerson Algorithm
• Dijkstra's Algorithm
• Kruskal's Algorithm
• Prim's Algorithm
• Huffman Code

Dynamic Programming

• Dynamic Programming
• Floyd Warshall Algorithm
• Longest Common Subsequence

Other Algorithms

• Backtracking Algorithm
• Rabin-Karp Algorithm
• Kadane’s Algorithm
• Shuffling Algorithm
• Sliding Window
• Rabin Karp Algorithm
• KMP Algorithm
• Loop Detection Algorithm
• Kosaraju’s Algorithm
• Tarjan’s Algorithm

Programming Basics and Overview

• Computer Programming Background
• C++ Overview
• Basic C++ Syntax
• Compiling and executing C++ Programs
• Using IDE
• Basic Input and Output
• Variables
• Practical Exercise: Create various applications with input/variable manipulation/output.

Flow Control

• If Statements
• Switch
• Loops
• While..Do…For
• Data Types
• Statements
• Practical Exercise: Create various applications that contain flow control.

C++ Basic Concepts

• Memory Management
• Arrays
• Strings
• Handling Exceptions
• Basic Debugging Skills
• Practical exercise: Create various applications that utilize new content.

OOP Basics

• What is an Object?
• Classes
• Functions (access control)
• OOP Abstract
• Constructor & Destructor
• Interface
• Polymorphism
• Encapsulation
• Inheritance
• Reading and writing to files

---

For Doubts Contact Us on Whatsapp: +91-8459943139 or mail us on contact@talentbattle.in