Data Structures and Algorithms
Bit of a joke class. Kinda disorganized but as long as you do the APTs and projects you'll get the most of the class. Don't worry that much about the grade, it's curved really easily and as long as you do old exams the midterms and finals are easy. Also, speaking from experience, you can miss like 60% of WOTOs and get an A. Lectures are kinda useless so that may be helpful advice...
Not a very hard class if you practice well and do all the assignments. It is overloaded and sometimes disorganized but good to learn concepts that help you get software internships. The class gets nicely curved in the end and a lot of people end up with A-/B+
You learn a lot, but the class is a mess. Completely disorganized. Not as hard as the later CS requisites, but not an enjoyable class.
This is a good class if you want to continue on with the Computer Science major/minor. I learned a lot more in CS201 than CS101. The concepts in 201 are a lot more difficult than 101 but it is doable. The work load is pretty strong and can get out of hand if you're not on top of things.
Good class, difficult not in content but in the sheer volume of assignments, especially near the end of the semester
The class is often overloaded, which puts a strain on the staff and results in a lower-quality class. That being said, you do learn a fair amount. For those with some prior experience, it's not difficult, though I'd be careful if you've never coded before.
Solid class. It's definitely a step up from 101 in terms of workload. You'll learn some serious structures like trees, etc - all this info is really good for any software internship interview. It's not hard and the class is nicely curved up at the end.