This class was tough.
Course Overview:
It is a requirement for CS and CSE majors. The course teaches how to analyze algorithms and goes into the theory of how to use data structures effectively to develop the best algorithms for the problems at hand.
Course highlights:
Analyzing time complexity of algorithms. Master's theorem. Complexity of search algorithms. Using data structures effectively. Graph traversal algorithms. Dynamic programming. NP problems.
Hours per week:
6-8 hours
Advice for students:
Spend a good amount of time on this course and understanding the material thoroughly. Use other resources other than the internet and the required text, such as other text books from the library. The lessons are fundamental and will improve your programming (and problem solving skills).
Not too easy. Not too difficult.
Course Overview:
Good, you will work hard but you will pass the class.
Course highlights:
Graphs prof. likes teaching graph and he teaches well
Hours per week:
6-8 hours
Advice for students:
Project in java much easier then c++