In this lecture we start studying the algorithmic paradigm of dynamic programming where the problem is split into smaller overlapping subproblems in a rather sequential manner as opposed to the divide and conquer paradigm where the subproblems are non-overlapping and can be solved independently. The weighted interval scheduling problem is investigated as the first problem to solve using dynamic programming approach. The instruction language is Arabic, however, all material, slides, definitions, concepts, formulations, examples, etc., are all given in English.
