Design and Analysis of Algorithms

CSCI 4020 @ RPI

Numerical Methods for Differential Equations

About

Notes and files from CSCI 4020 in Spring 2020 at RPI.

Instructor: Elliot Anshelevich
Course homepage: link

Notes

Lecture 02, Jan 17: notes - Introduction
Lecture 03, Jan 21: notes - Greedy Algorithm; Exchange Argument; Scheduling to Minimize Lateness
Lecture 04, Jan 24: notes - Minimum Spanning Tree
Lecture 05, Jan 28: notes - Dynamic Programming; Weighted Interval Scheduling
Lecture 06, Jan 31: notes - Segmented Least Squares
Lecture 07, feb 04: notes - Subset Sum; Longest Increasing Subsequence Problem
Lecture 08, feb 07: notes - Sequence Alignment and Edit Distance
Lecture 09, feb 14: notes - Divide and Conquer; Merge Sort; Closest Pair of Points
Lecture 10, feb 21: notes - Multiplying Polynomial; Fast Fourier Transform

Problem Set

Problem set 1: my homework (10/10), solutions
Problem set 2: my homework (20/20), solutions
Problem set 3: my homework (20/20), solutions
Problem set 4: my homework (20/20), solutions
Problem set 5: my homework (10/10)

Note: Problem sets for this course are finished in group of two. The other author of these homework is Xuan Liu.