ICS 443: Parallel Algorithms

Description: Introduction to parallel models of computation and design and analysis of parallel algorithms.


Course Learning Outcomes

Program Learning Outcomes

Prerequisites: 311 with C or better

Textbook(s): Joseph Jaja, Introduction to Parallel Algorithms, Addison Wesley, 1992.

Grading: The students will be graded on class participation (20\%), homeworks (40\%), and the final exam (40\%).

Policies: Late homework policy: Homeworks are due on Thursday at 1:30pm (the beginning of the lecture). Late homeworks can be emailed to the instructor. Penalty for late homeworks is a letter grade reduction (e.g. from A to B) for within each 24 hours that it is late. For example, submission of homework that deserves a letter grade A will be graded B if submitted between Thursday 1:30pm and Friday 1:30pm; will be graded C if submitted before Saturday 1:30pm; and will be graded D if submitted before Sunday 1:30pm. Extenuating circumstances do arise, therefore, a single homework will be accepted up to 72 hours late without any reduction in grade.