> Data Structures and Algorithms (DSA) Roadmap

Data Structures and Algorithms (DSA) Roadmap

Data Structures and Algorithms (DSA) Roadmap to learn data structures and algorithms for job interview questions and to provide efficient solution to complex problems.

The best way to learn data structures and algorithms will be learn the concepts, implement it, solve the problems using concepts and then write the program in programming language you love most. Here are the steps-
-Have a good programming skills
-Learn the data structures and algorithms concepts
-Implement it
-Solve the variety of problems using the concepts you learned and program it.

Recommended Book :
Comprehensive Data Structures and Algorithms in Java
Comprehensive Data Structures and Algorithms in C++

This is the Data Structures and Algorithms (DSA) Roadmap-

Programming language

Any programming language C/C++/C#/Java/Python etc. You should have good understanding of its libraries which will help you in programming of solved problems.

Introduction to Data Structures and Algorithms

• Data Structures
• Algorithms
• Algorithms analysis
• Examples

Arrays

• One dimensional arrays
• Two dimensional array
• Array operations
• Traversal
• Insertion
• Deletion
• Matrices
• Problems

Strings

• Problems

Linked List

• Single Linked List
• Traversal
• Insertion
• Deletion
• Doubly linked list
• Circular linked list
• Sorted linked list
• Reverse
• Sorting
• Merging
• Concatenation
• Polynomial linked list
• Creation
• Addition
• Multiplication
• Implementation [ C | C++ | C# | Java | Python ]
• Problems

Stacks and Queues

• Stack
• Array implementation
• Linked List implementation
• Queue
• Array implementation
• Linked List implementation
• Circular queue
• Deque
• Priority queue
• Polish notation
• Infix expression to Postfix expression
• Evaluation of Postfix expression
• Implementation [ C | C++ | C# | Java | Python ]
• Problems

Recursion

• How recursion works?
• Implementation [ C | C++ | C# | Java | Python ]
• Problems

Trees

• Terminology
• Binary Tree
• Binary Tree representation
• Array representation
• Linked representation
• Binary Tree traversal
• Recursive traversal
  • Preorder
  • Inorder
  • Postorder
• Non recursive traversal
• Preorder
• Inorder
• Postorder
• Level order traversal
• Creation of binary tree from inorder and preorder traversal
• Creation of binary tree from inorder and postorder traversal
• Binary Search Tree (BST)
• Traversal
• Search
• Insertion
• Deletion
• Heap
• Insertion
• Deletion
• Building a heap
• B Tree
• Trie
• Insertion
• Search
• Deletion
• Startswith
• Implementation [ C | C++ | C# | Java | Python ]
• Problems

Graphs

• Undirected graph
• Directed graph
• Terminology
• Connectivity in undirected graph
• Connectivity in directed graph
• Representation of a graph
• Adjacency matrix
• Adjacency list
• Path matrix
• Warshall's Algorithm
• Traversal
• Breadth First Search (BFS)
• Depth First Search (DFS)
• Classification of edges in DFS
• Strongly connected graph and strongly connected components
• Shortest Path Problem
• Dijkstra's Algorithm
• Bellman Ford Algorithm
• Modifiled Warshall's Algorithm (Floyd's Algorithm)
• Minimum spanning tree
• Prim's Algorithm
• Kruskal's Algorithm
• Topological Sorting
• Implementation [ C | C++ | C# | Java | Python ]
• Problems

Sorting

• Selection sort
• Bubble sort
• Insertion sort
• Merge sort
• Quick sort
• Analysis of sorting
• Implementation [ C | C++ | C# | Java | Python ]
• Problems

Searching

• Linear search
• Binary search
• Implementation [ C | C++ | C# | Java | Python ]
• Problems

Hashing

• Hash Function
• Collision resolution
• Implementation [ C | C++ | C# | Java | Python ]
• Problems

Greedy algorithms

• Problems

Backtracking

• Problems

Dynamic programming

• Problems

Bit Manipulation

• Problems

Your Instructors

Suresh Kumar Srivastava has 20+ years of experience in software industry - Alcatel, BNY Mellon, Unisys and has worked on architecture and design of multiple products. He is author of popular books "C in Depth", "Data Structures through C in Depth" and "Comprehensive Data Structures and Algorithms in C++/Java" that helped 250,000+ students. He has done 'B' Level from NIELIT. He has worked on Compilers, Linkers, Debuggers, IDEs, System Utilities, System Management and Telecom/Mobile/Systems tools development. He runs online learning site CourseGalaxy and loves doing software architecture, design, coding and product engineering.

Deepali Srivastava has a Master's degree in Mathematics and is an author and educator in the field of computer science and programming. Her books "Ultimate Python Programming", "C in Depth", "Data Structures through C in Depth" and "Comprehensive Data Structures and Algorithms in C++/Java" are widely used as reference materials by students, programmers and professionals looking to enhance their understanding of programming languages and data structures. In addition to her writing, Deepali Srivastava has been involved in creating online video courses on Data structures and Algorithms, Linux and Python programming. Her books and courses have helped 350,000+ students learn computer science concepts.
This article provides good understing of Data Structures and Algorithms (DSA) Roadmap in C/C++/C#/Java/Python.