Curriculum
- 6 Sections
- 29 Lessons
- 60 Hours
Expand all sectionsCollapse all sections
- Introduction to Data Structures3
- Basic math operations & Asymptotic analysis4
- Algorithms Fundamentals4
- Linear Data Structures4
- Non-Linear Data Structures7
- 4.1Trees: Binary trees, binary search trees (BSTs), AVL trees, B-trees, Tree traversals
- 4.2Graphs: Representation, traversal algorithms (BFS, DFS)
- 4.3Shortest path algorithms (Dijkstra’s)
- 4.4Minimum spanning tree (Prim and Kruskal algorithms)
- 4.5Strongly connected components in directed graphs
- 4.6Topological Sorting
- 4.7AI tool to handle Non-Linear Data Structure
- Advanced Data Structures7
Technical Training Director







