Electrical Engineering and Computer Science
Data Structures and Algorithms
- Course code
- EECS 281
- Institution
- University of Michigan
- Subject
- Electrical Engineering and Computer Science
- Available languages
- EN
Academy
Learning materials
- Lecture notes
EECS 281 Section 01 - Stack, Queue, and Priority Queue ADTs
HTML · 0.9 MB
- Lecture notes
EECS 281 Section 02 - Complexity Analysis
HTML · 0.7 MB
- Lecture notes
EECS 281 Section 03 - Measuring Runtime Performance
HTML · 0.6 MB
- Lecture notes
EECS 281 Section 04 - Recursion
HTML · 0.6 MB
- Lecture notes
EECS 281 Section 05 - Arrays and Container Classes
HTML · 0.8 MB
- Lecture notes
EECS 281 Section 06 - STL
HTML · 1.0 MB
- Lecture notes
EECS 281 Section 07 - Heaps, Priority Queues, and Heapsort
HTML · 1.2 MB
- Lecture notes
EECS 281 Section 08 - Ordered and Sorted Ranges Algorithms and Data Structures to Represent Sets
HTML · 1.2 MB
- Lecture notes
EECS 281 Section 09 - Elementary Sorting Methods
HTML · 4.7 MB
- Lecture notes
EECS 281 Section 10 - Quick Sort
HTML · 1.2 MB
- Lecture notes
EECS 281 Section 11 - Merge Sort
HTML · 1.5 MB
- Cheatsheet
EECS 281 Summary Part 1
PDF · 0.9 MB
- Lecture notes
EECS 281 Section 12 - Dictionaries and Hash Tables
HTML · 1.2 MB
- Solutions
EECS 281 Section 13 - Hash Collision and Resolution
HTML · 0.6 MB
- Lecture notes
EECS 281 Section 14 - Trees, Binary Search Trees
HTML · 2.1 MB
- Lecture notes
EECS 281 Section 15 - Graphs and Graph Algorithms
HTML · 2.2 MB
- Lecture notes
EECS 281 Section 16 - Minimum Spanning Trees
HTML · 2.1 MB
- Lecture notes
EECS 281 Section 17 - Algorithm Families
HTML · 1.3 MB
- Lecture notes
EECS 281 Section 18 - Bacltracking, Branch and Bound Algorithms
HTML · 1.6 MB
- Lecture notes
EECS 281 Section 19 - Dynamic Programming & Memoization
HTML · 0.6 MB
- Lecture notes
EECS 281 Section 20 - Knapsack Shortest Path
HTML · 3.0 MB
- Lecture notes
EECS 281 Section 21 - Strings and Sequences
HTML · 1.1 MB
- Cheatsheet
EECS 281 Summary Part 2
PDF · 0.7 MB