This course offers an approach to fundamental data structures and algorithms. This work provides a comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation. It presents data structure using ADTs and their respective implementations
48 Hrs.
Prerequisites
- C / C++ Beginner to Intermediate Level (Loops/If Statements/Templates)
- Very Basic Understanding of Recursion (Factorial example suffices)
Who this course is for:
- Any one interested in learning more about Data Structures and Algorithms
- Any one who wants to know how to implement solutions to algorithmic problems in C/ C++ using data structures
- Any one who is preparing for a coding interview
- Any one who is thinking to become a software engineer and interviewing with Large companies
Outlines
- Functions
- Iterative vs. Recursive Functions “Divide & Conquer Methods”.
- Arrays and Dynamic Memory Allocations “ADT”
- Location address Calculations.
- Arrays Sorting and Searching Techniques [Bubble, Insertion, Selection, Linear, Binary]
- Strings
- Linked Lists [Single - Double]
- Stacks [Including Math Parsing, Infix and Postfix Calculations]
- Queues
- Binary Search Trees “ADT”
- Graphs [including Adjacency Matrix – Adjacency List]