Alg quiz - Study guides, Class notes & Summaries

alg quiz Consider the following generalization of the Activity Selection Problem: You are given a set of n activities each with a start time si, a finish time fi, and a weight wi. Design a dynamic programming algorithm to find the weight of a set of non-conflicting activities with maximum weight. - ANSWER-Formula: (Sort by finish time) A[i] = max (from activity 1 to i) { A[i - 1] max{A[x]} + wi } (x being activity whose finish time <= activity i's start time) A contiguous subseque...

Consider the following generalization of the Activity Selection Problem: You are given a set of n activities each with a start time si, a finish time fi, and a weight wi. Design a dynamic programming algorithm to find the weight of a set of non-conflicting activities with maximum weight. - ANSWER-Formula: (Sort by finish time) A[i] = max (from activity 1 to i) { A[i - 1] max{A[x]} + wi } (x being activity whose finish time <= activity i's start time) A contiguous subsequence of a l...

Notes for Northeastern University's differential equations and linear algebra course throughout the entire semester (or diff eqs and lin alg in general). Differential equations topics include 1st order differential equations, 2nd order differential equations, homogeneous systems, non-homogenous systems, separable equations, mechanical vibrations etc. Linear algebra topics include Laplace transform, shifting theorem, convolution, matrices, systems of equations, eigenvalues, eigenvectors, etc. In...