https://github.com/jiiwang/ecs-122a-s19-discussion
Discussion Notes for ECS-122A: Algorithm Design and Analysis, Spring 2019 @ucdavis
https://github.com/jiiwang/ecs-122a-s19-discussion
algorithms cs-education
Last synced: 3 months ago
JSON representation
Discussion Notes for ECS-122A: Algorithm Design and Analysis, Spring 2019 @ucdavis
- Host: GitHub
- URL: https://github.com/jiiwang/ecs-122a-s19-discussion
- Owner: jiiwang
- License: mit
- Created: 2019-04-04T05:56:08.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2020-09-21T10:45:43.000Z (about 5 years ago)
- Last Synced: 2025-01-19T08:21:16.225Z (9 months ago)
- Topics: algorithms, cs-education
- Language: Python
- Homepage:
- Size: 4.52 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# ECS-122A-S19-Discussion
Discussion Notes for ECS-122A "Algorithm Design and Analysis" Spring 2019 at UC Davis.
MIT License
Copyright (c) 2019 Ji Wang
#### Week 1
1. Mathematical Induction
2. Recursion, Stack
3. Merge Sort
-------------------------------------------------------------------------------------
#### Week 2
1. Mathematical Review: Polynomial, Exponential, Logarithms, and their Derivatives
2. Asymptotic Notation
3. Solving Recurrence Relation:
- Substitution method
- Master theorem
-------------------------------------------------------------------------------------
#### Week 3
1. Mathematical Review: Polynomial, Exponential, Logarithms, and their Derivatives
2. Asymptotic Notation
3. Solving Recurrence Relation:
- Substitution method
- Master theorem
4. Divide and Conquer: Chip Testing
-------------------------------------------------------------------------------------
#### Week 4
1. Divide and Conquer: Chip Testing
2. Divide and Conquer: Stock Investment
-------------------------------------------------------------------------------------
#### Week 5
Greedy Algorithms: Off-line Caching
-------------------------------------------------------------------------------------
#### Week 6
1. Recap: Largest Common Subsequence Problem
2. Dynamic Programming VS Divide and Conquer
3. Dynamic Programming: Image Compression
-------------------------------------------------------------------------------------
#### Week 7
1. Revisit: Edit Distance
2. Implementation in Python3: Edit Distance
3. Variant: DNA Matching
-------------------------------------------------------------------------------------
#### Week 8
1. Graph Basics
2. DFS & BFS
-------------------------------------------------------------------------------------
#### Week 9
1. Minimum Spanning Tree
2. Single-Source Shortest Paths
3. MST VS SSSP
-------------------------------------------------------------------------------------
#### Week 10
Review Homework 8
1. P, NP, NP-complete
2. How to prove a problem is NP-complete