DISCRETE STRUCTURES FOR CS
Bonidie is a good teacher. He comes off as a bit of a hardass at first but he's actually pretty cool. 441 isn't seen as the most exciting classes in CS by most, but I actually liked it a lot.
Bonidie was a great professor. 441 covers a lot of dry topics and he made it enjoyable. The tests were all pretty easy. Be warned, the second half is considerably harder than the first half of the course. I highly recommend him.
Discrete Math is a dry topic, but Bonidie does a very good job making the class interesting. The difficulty of this class is very dependent on the professor you take it with so I'd highly recommend taking it with Bonidie. I personally didn't think the class was too tough, but some of my friends who had other professors found it to be very difficult.
An introduction into the logic and math used within computer programming. This course will challenge those who have not yet seen any logic courses. The class is challenging, so I recommend speaking with classmates to work together.
This course will help you think more clearly about problems, how to define them precisely, and how to structure a solution. After this class, the logic in my code became cleaner and more robust, and it prepared me to understand the lingo in CS 1501 and 1502. For example, understanding the mechanics of combinations, permutations, mappings, etc. will be very helpful. I found it to the driest and most academic of the 4xx courses. Some lectures felt more like a series of riddles than a coherent sequence of topics. Beyond the usual advice (sleep, show up, study proactively, etc.), the successful students in this class practiced the problems from the book, worked quickly on exams by prioritizing questions, and sought out other resources when the book's approach didn't make sense (see StackOverflow, MIT Mathematics for Computer Science).
Add your review by filling out this form!