Data Structures & Algorithms

Data Structures & Algorithms

Module 1: Introduction

Module 2: Algorithm & Pseudocode:

Module 3: Function

Module 4: Array

Module 5: Pointer

Module 6: Structure

Module 7: Stack

Module 8: Applications of Stack

Module 9: Queue

Module 10: LinkedList

Module 11: Tree

Module 12: Manipulation

Module 13: Graph

Module 14: Hashing & Searching

Module 15: Sorting

Syllabus

Data Structures & Algorithms Basics and Advanced

Fees

Rs.3000

    Course Highlights

  • Arrays: Ordered collection of elements.
  • Linked Lists: Elements linked by pointers.
  • Trees: Hierarchical data structure with nodes and edges.
  • Hash Tables: Data structure that maps keys to values for efficient retrieval.
  • Graphs: Represent connections between nodes.
  • Tries: Tree-like structure for storing dynamic sets or associative arrays.
  • Bubble Sort: Simple sorting algorithm.
  • Merge Sort: Divide-and-conquer with merging.
  • Breadth-First Search (BFS): Explore graph level by level.
  • Depth-First Search (DFS): Explore graph deeply before backtracking.
  • Recursion: Function calls itself to solve smaller instances.

© 2024 Positive Quadrant Technologie LLP.