Computer Science
Introduction to Algorithms and Data Structures
Master the core computational concepts: asymptotic analysis, sorting algorithms, graph traversals, and dynamic programming with rigorous proofs.
Dr. Elena Vasquez
Associate Professor of Computer Science & Physics
What you’ll learn
- Analyze time and space complexity using asymptotic notation (Big-O, Big-Theta, Big-Omega)
- Implement and analyze fundamental sorting and searching algorithms
- Design greedy algorithms and dynamic programming solutions for optimization problems
- Master graph algorithms including BFS, DFS, Dijkstra, and minimum spanning trees
About this course
This course offers a university-level introduction to the design and analysis of algorithms. You will explore fundamental data structures and algorithmic paradigms that form the bedrock of computer science.
Through theoretical foundations and practical examples, you will learn how to analyze the efficiency of algorithms, prove their correctness, and select the optimal approaches for complex computational challenges.
Course content
3 sections · 9 lessons · 4h 18m
Foundations & Mathematical Tools
3 lessons · 1h 16m
- Course Orientation & Algorithmic Thinking14m
- Asymptotic Analysis & Big-O Notation28m
- Recurrence Relations & Master Theorem34m
Sorting & Divide-and-Conquer
3 lessons · 1h 18m
- Merge Sort & Divide-and-Conquer Analysis26m