DSCI 512: Algorithms and Data Structures
Home
Lectures
1. Introduction, Time Complexity, and Big O Notation
Lecture Overview
1. Introduction, Time Complexity, and Big O Notation
2. Space Complexity and Basic Data Structures
3. Graphs and Sparse Matrices
4. Sparse Matrices, Stacks, Queues, and Graph Searches
On this page
Slides for Section 002
1. Introduction, Time Complexity, and Big O Notation
Course logistics, what algorithms are, and analysing running time with Big O.
Slides for Section 002
View slides in full screen
Lecture Overview
2. Space Complexity and Basic Data Structures