Please note that this evaluation is based on the average score for each reviewer in all the criteria

Graphs

Untitled

<aside> 💡 Short Description of the Course Material:

Basic algorithmic analysis; Analysis of iterative and recursive algorithms; Advanced algorithmic design techniques (induction, divide and conquer, dynamic programming, backtracking); The complexity classes P and NP; Basic computability; Parallel algorithms

Prerequisites: ICS 202, ICS 253

</aside>

General Evaluation

Detailed Evaluation