📗 -> Algorithm Design & Analysis
short mode
not done
tags include #class
description includes ALG🔗 Critical Links
🔶 Course Description
Complexity of algorithms, bounds on complexity, analysis methods. Searching, sorting, pattern matching, graph algorithms. Algorithm design techniques: divide-conquer, greedy, dynamic programming. Approximation methods. NP-complete problems.
❗ Important
- Dr. Frid
- Jay Liu
- George Zaets
- Tia Cheng
ECS122A-Cheatsheet
ECS122A-Final-Prep
📄 Class Material
Week 0 - Asymptotic Analysis
- Asymptotic Analysis - Non-recursive Functions; BIG-O, limit lemma
- ECS122A-L1
Week 1 - Asymptotic Analysis Recurrences
- Asymptotic Analysis / Divide and Conquer Intro
- Asymptotic Analysis Recurrence Tree
- Quiz 1 out
Week 2 - Master Theorem / Divide & Conquer
- Asymptotic Analysis Master Theorem
- Divide & Conquer Algorithm Design
- Quiz 2 out
Week 3 - Divide & Conquer / Midterm 1
ECS122A-PS2
- Divide & Conquer Algorithm Design: 10/15
- Midterm 1
Week 4 - Greedy Algorithms
- Greedy Algorithms: 10/22
- Greedy Algorithms
- Quiz 3 out
Week 5 - Dynamic Programming
ECS122A-HW3: 10/29
- Dynamic Programming
Halloween, no lecture
- Quiz 4 out
Week 6 - Suboptimality / Graph Introduction
- Suboptimality and Greedy Proof: 11/5
- Graph Introduction, BFS
- Quiz 5 out
Week 7 - DFS / Midterm 2
- DFS, Bellman: 11/12
- Midterm 2
Week 8 - Dijkstra / Prims
- Dijkstra: 11/19
- Prims
- Quiz 6 out
Week 9 - Kruskals / Thanksgiving
- Kruskals
- Thanksgiving (no class)
Week 10 - Shortest Path / P/NP
- All pairs shortest path
- P/NP
- Quiz 7 out