Advanced Python Programming: Data Structures and Algorithms
Elevate your Python skills by mastering advanced data structures and algorithms, unlocking efficient solutions for complex real-world problems.
...
Share
Python Foundations and Core Data Structures
Unit 1: Advanced Python Fundamentals
Decorators Demystified
Generator Functions
Context Managers
Advanced List Comprehension
Functional Programming
Unit 2: Core Data Structures: Lists and Tuples
Lists: Advanced Operations
Tuples: Immutability
List vs. Tuple
Nested Lists & Matrices
List Comprehension Recap
Unit 3: Core Data Structures: Dictionaries and Sets
Dict: Advanced Features
Sets: Operations
Dict vs. Sets
Frozen Sets
Advanced Set Operations
Unit 4: Abstract Data Types (ADTs)
ADT Principles
Stack ADT
Queue ADT
Linked List ADT
ADT Trade-offs
Abstract Data Types: Stacks, Queues, Linked Lists, Trees and Heaps
Unit 1: Stacks
Stack Intro & Definition
Stack Implementation
Stack: Push Operation
Stack: Pop Operation
Stack Applications
Unit 2: Queues
Queue Intro & Definition
Queue Implementation
Queue: Enqueue
Queue: Dequeue
Queue Applications
Unit 3: Linked Lists
LL Intro & Definition
Singly Linked List
Doubly Linked List
LL Traversal
LL Applications
Unit 4: Trees
Tree Intro & Definition
Binary Tree
Binary Search Tree
Tree Traversals
Tree Applications
Unit 5: Heaps
Heap Intro & Definition
Heap Implementation
Heap Sort
Priority Queue
Heap Applications
Algorithm Design and Analysis
Unit 1: Asymptotic Analysis with Big-O
Intro to Algorithm Analysis
Understanding Big-O
Calculating Big-O
Big-Omega & Big-Theta
Practical Big-O Examples
Unit 2: Searching and Sorting Algorithms
Linear Search
Binary Search
Bubble Sort
Merge Sort
Quick Sort
Unit 3: Hashing Techniques
Hashing Basics
Hash Functions
Collision Resolution
Hash Table Performance
Python Dictionaries
Unit 4: Dynamic Programming and Greedy Algorithms
Dynamic Programming Intro
Memoization
Tabulation
Greedy Algorithms
Greedy Example:Coin Change
Graph Algorithms and Advanced Data Structures
Unit 1: Graph Traversal and Shortest Paths
Intro to Graph Theory
Breadth-First Search
Depth-First Search
Dijkstra's Algorithm
Bellman-Ford Algorithm
Unit 2: Minimum Spanning Trees and Network Flow
Minimum Spanning Tree
Prim's Algorithm
Kruskal's Algorithm
Network Flow Concepts
Ford-Fulkerson Method
Unit 3: Topological Sorting and Advanced Trees
Topological Sorting
Introduction to AVL Trees
AVL Tree Rotations
Red-Black Trees
Red-Black Tree Ops
Unit 4: Tries, Bloom Filters, and Disjoint Sets
Introduction to Tries
Trie Operations
Bloom Filters
Disjoint Set Union
DSU Applications
Practical Applications, Optimization, and Modern Trends
Unit 1: Data Structures and Algorithms in Real-World Applications
Social Network Analysis
Recommendation Systems
Route Optimization
Financial Modeling
Bioinformatics Analysis
Unit 2: Python Code Optimization and Performance Tuning
Profiling Tools
Memory Management
Algorithmic Optimization
Compiler Optimization
Concurrency Optimization
Unit 3: Modern Trends and Libraries
NumPy Arrays
SciPy Statistics
Asyncio Intro
Multiprocessing
Dask for Parallelism