Chapter 2
Algorithm | oop作业 – 该题目是一个常规的Algorithm的练习题目代写, 是比较典型的Algorithm/oop等代写方向
The final exam will be a 120-minute exam, covering all of the course material comprehensively. It may include easy-answer questions, true/false questions, multiple choice as well as Algorithm design questions. It will not include any formal proof questions.
Chapter 2: Getting Started
Week 1: Insertion sort (2.1) 1 .
Week 1,2: L oop invariants (2.2), designing algorithms, merge sort (2.3).
Asssignment #1 due on Sunday February 14, 2021 .
Chapter 3: Growth of Functions
Week 2: Asymptotic notation (3.1).
Asssignment #2 due on Sunday February 28, 2021 .
Chapter 4: Divide-and-Conquer
Week 3: Strassens algorithm for matrix multiplication (4.2), Recursion tree method (4.4).
Week 4: Master method (4.5), Substitution method (4.3).
Chapter 7: Quicksort
Week 5: Description (7.1), worst-case performance (7.2), hiring problem (5.1), indicator random variables (5.2).
Week 5-6: Randomized algorithms (5.3), randomized quicksort (7.3), average- case analysis of quicksort (7.4).
Asssignment #3 due on Sunday March 14, 2021 .
Chapter 8: Sorting in Linear Time
Week 7: Complexity of comparison-based sorting (8.1), Counting sort (8.2), Radix sort (8.3).
Asssignment #4 due on Sunday March 28, 2021
Chapter 15: Dynamic Programming
Week 8: Rod cutting (15.1), Elements of dynamic programming (15.3),
Week 9: Subset-sum (notes will be provided by the instructor), Optimal binary search trees (15.5?).
Week 10: Longest common subsequence (15.4).
Asssignment #5 due on Sunday April 18, 2021 .
Chapter 16/23: Greedy Algorithms
Week 10: Activity selection (16.1), elements of greedy strategy (16.2), examples.
Week 11: Minimum spanning trees (23.1, 23.2?., 23.3)
Asssignment #6 due on Sunday April 25, 2021 .
Chapter 22: Elementary Graph Algorithms
Week 12: Representation of graphs (22.1), Depth-First Search (22.3).
Week 13: Topological sort (22.4), strongly connected components (22.5).
Chapter 24: Shortest Paths
Week 14: Dijkstras Algorihm (24.3), DAG-Shortest-Paths (24.2), Floyd-Warshall Algorithm (25.2?).
.