Advanced Data Structures and Algorithms for Data-Intensive Applications and AI
Master advanced data structures and algorithms to build high-performance, scalable solutions for data-intensive applications and AI challenges.
...
Share
Advanced Tree-Based Data Structures
Unit 1: B-Trees: Fundamentals and Implementation
B-Tree Intro
B-Tree Node Structure
B-Tree Insertion
B-Tree Deletion
B-Tree Search
Unit 2: KD-Trees: Spatial Data Indexing
KD-Tree Intro
KD-Tree Construction
Nearest Neighbor Search
Range Queries
KD-Tree Variations
Unit 3: R-Trees: Indexing Spatial Objects
R-Tree Intro
R-Tree Insertion
R-Tree Deletion
R-Tree Search
R-Tree Variations
Unit 4: Performance Evaluation and Use Cases
B-Tree Performance
KD-Tree Performance
R-Tree Performance
Use Case: Databases
Use Case: GIS
Graph Algorithms for Complex Data Relationships
Unit 1: PageRank Algorithm
Intro to PageRank
PageRank: Math
PageRank Implementation
PageRank: Convergence
PageRank Use Cases
Unit 2: Community Detection Algorithms
Community Detection Intro
Girvan-Newman Algorithm
Louvain Algorithm
Label Propagation
Community Eval Metrics
Unit 3: Shortest Path Algorithms
Shortest Path Intro
Dijkstra's Algorithm
Bellman-Ford Algorithm
A* Search Algorithm
Shortest Path Use Cases
Specialized Data Structures for Data Processing Pipelines
Unit 1: Bloom Filters: Efficient Membership Testing
Bloom Filter Intro
Hash Functions in Bloom
Bloom Filter Operations
Probabilities & False Positives
Bloom Filter Use Cases
Unit 2: HyperLogLog: Cardinality Estimation
HyperLogLog Intro
Harmonic Mean Intuition
HyperLogLog Algorithm
Bias Correction
HLL Use Cases
Unit 3: Count-Min Sketch: Frequency Estimation
Count-Min Sketch Intro
Hash Functions in CMS
CMS Operations
Error Estimation
CMS Use Cases
Search Algorithms and Dynamic Programming
Unit 1: Fundamentals of Search Algorithms
Intro to Search Algorithms
Breadth-First Search
Depth-First Search
Iterative Deepening DFS
Search Algorithm Comparison
Unit 2: Informed Search Algorithms
Intro to Informed Search
Greedy Best-First Search
A* Search Algorithm
A* Heuristic Design
Beam Search
Unit 3: Dynamic Programming Techniques
Intro to Dynamic Prog.
Memoization
Tabulation
Sequence Alignment
DP Optimizations
Spatial Data Structures and Real-Time Processing
Unit 1: Quadtrees for Spatial Indexing
Intro to Quadtrees
Quadtree Construction
Searching in Quadtrees
Adaptive Quadtrees
Quadtree Use Cases
Unit 2: Geohashes for Location Encoding
Intro to Geohashes
Geohash Encoding/Decoding
Geohash Neighbors
Geohash-Based Indexing
Geohash Use Cases
Unit 3: Real-Time Data Processing
Real-Time Data Streams
Stream Processing Frameworks
Windowing Techniques
Real-Time Analytics
Latency Considerations
Unit 4: Fraud and Anomaly Detection
Intro to Anomaly Detection
Statistical Methods
Machine Learning Methods
Fraud Detection
Real-Time Anomaly Detection