📗 -> Algorithm Design & Analysis
short mode
not done
tags include #class
description includes foo🔗 Critical Links
- Put important links for class
🔶 Course Description
Theory and practice of hard problems, and problems with complex algorithm solutions. NP-completeness, approximation algorithms, randomized algorithms, dynamic programming and branch and bound. Theoretical analysis, implementation and practical evaluations. Examples from parallel, string, graph, and geometric algorithms.
❗ Important
Instructor:
- Setareh Rafatirad - srafatirad@ucdavis.edu
TA:
- Zhijie Zheng - zhjzheng@ucdavis.edu
- Md Raian Latif Nabil - mnabil@ucdavis.edu
📄 Class Material
Week 1 - Algorithmic Analysis
- ECS122B-L1 - Intro to Computational Complexity
- ECS122B-D1 - Solving for theta notation
- ECS122B-L2 - Asymptotic Analysis
Week 2 - Divide and Conquer
Missed L3 and D2 - Redding
- ECS122B-L3 - DnC: Merge sort
- ECS122B-D2
- ECS122B-L4 - DnC: Integer Multiplication
ECS122B-HW1
ECS122B-Lab1
ECS122B-Lab2
Week 3 - String Matching
Missed week - Sick
- ECS122B-L5 - BF String Matching
- ECS122B-D3
- ECS122B-L6 - Rabin Karp
ECS122B-HW2
ECS122B-Lab3
Week 4 - Rabin Karp + Z-array
- ECS122B-L7 - Rabin Karp Enhanced
- ECS122B-L8 - Computing Z-Array
ECS122B Q2 - gform link
Week 5 - Suffix Trees
- ECS122B-L9 - Intro to Suffix Trees
- ECS122B-D5
- ECS122B-L10 - Intro to Suffix Arr and LCP
Week 6 - Midterm + Ukonnens
Midterm - No suffix trees
- ECS122B-L11 - Ukknonen’s Algo
Week 7 - BWT Algo
- ECS122B-L12 - BWT Transform
- ECS122B-L13 - BWT search
- Recorded Lecture
Week 8 - BWT Analysis + Random Algos
- ECS122B-L14 - Randomized Algos 1
- Also spent weirdly long on Karger’s Algo?
- ECS122B-L15
ECS122B-Lab6