Course Description
In computer science, a data structure is a particular way of organizing data in a computer so that it can be used efficiently. This course is designed for the absolute beginner, meaning no previous programming experience is required.
Introduction to Data Structures and Algorithms
- Stacks
- Queues and Linked Lists
- Dictionaries
- Hashing
- Trees
- Tree Walks / Traversals
- Ordered Dictionaries
- Deletion
- Quick Sort
- AVL Trees
- Trees
- Red Black Trees
- Insertion in Red Black Trees
- Disk Based Data Structures
- Case Study: Searching for Patterns
- Tries
- Data Compression
- Priority Queues
- Binary Heaps
- Why Sorting
- More Sorting
- Graphs
- Data Structures for Graphs
- Two Applications of Breadth First Search
- Depth First Search
- Applications of DFS
- DFS in Directed Graphs
- Applications of DFS in Directed Graphs
- Minimum Spanning Trees
- The Union
- Prims Algorithm for Minimum Spanning Trees
- Single Source Shortest Paths
- Correctness of Dijkstras Algorithm
- Single Source Shortest Paths