basic definition of probability, independence of events, probability distributions and expectations. CLRS has a helpful appendix but the student unfamiliar with these concepts can find numerous high ...

including time and space complexity, sorting algorithms, recurrence relations, divide and conquer algorithms, greedy algorithms, dynamic programming, linear programming, graph algorithms, problems in ...

The students are encouraged to think and use their acquired knowledge of algorithms in practical and highly applicable programming exercises. The Dynamic Programming and Optimal Control class focuses ...