Not too easy. Not too difficult.
Course Overview:
It is core to any computer science education. The course is well structured and helps you develop analytical and deductive skills
Course highlights:
time complexity, fundamentals of analysis, computation trade-offs, graph algorithms, greedy algorithms, dynamic programming, linear programming, markov process, np-hard problems
Hours per week:
12+ hours
Advice for students:
Focus on basic understanding. Gear up early on the course to get your fundamentals right, so that when topics get complex, you can catch up faster. Some background in discrete mathematics earlier, will be an advantege