Your feedback has been sent to our team.
37 Ratings
Hours/Week
No grades found
— Students
Not a super intensive class, and taught differently from the other discrete classes. Professor Sullivan is a super nice guy, and genuinely wants you to learn the material. Homework assignments were not graded, and the tests and final exams were open notes which was really helpful. Definitely recommend taking it with him based on what some of my friends have told me about their experience with discrete.
This was Sullivans first semester teaching the course so it was kinda a mess. The TAs also had no idea what they were doing, that being said it forced me to learn the concepts he was trying to teach. I do not think I learned as much about discrete as other sections did, but at least it was an easy A since all exams are open note, although if you don't generally understand the concepts the tests would be somewhat hard. Also, found Sullivan to not be very helpful outside of class, hard to get a response over email often and when did, it was not very helpful.
Some examples to showcase Sullivan's teaching style:
- didn't show up for class unannounced 3 times
- forgets to assign homework
- when homework is assigned, spends two classes reviewing the answers; painstakingly slow learning
- final exam taken in Nau Hall commons because he did not reserve a room. Sure he comes off as a nice guy, but I believe in actions over words. You will not learn discrete math in his class.
Professor Sullivan is a very knowledgeable professor that knows plenty about the subject matter. He is good at explaining difficult concepts in different ways until people understand it. Unfortunately, though this class is listed as "Discrete Mathematics," that is not what this class is. A more accurate name would be "Introduction to Constructive Logic." It's certainly a valid class that some people benefit from taking. And computer science students who wish to explore proof checkers and logic would find no better intro class. But computer science students hoping to be prepared for the things discrete math should prepare you for, look elsewhere. Covered in this class: constructive logic, and predicate logic, intro to set theory. Not covered in this class: any number theory, finite state machines, graph theory, or mathematics over discrete numbers (as the name discrete mathematics would imply). I took a discrete math class in high school, and in the first three weeks of my high school discrete class, we went further than we have this semester. If I hadn't had my high school class, I would be seriously concerned about my ability to take future CS classes such as algorithms and theory of computation.
This class was the worst class I have ever experienced in my career. I have never met any professor with such incompetency and reliance of an application vs. their own knowledge. The lack of organization, lack of knowledge, lack of textbook, lack of compassion and lack of keeping his word, Kevin Sullivan has completely failed in teaching this course. The average is "decent" not because he can teach well, but because he made the information very easy to FIND, but not understand. The logistical challenges of this class are also a nightmare, today is the day before our final exam and I still don't know where I am expected to be. Why? Because he changed the date, time and location, without telling us. Sullivan doesn't email back, or post updates. It's one thing to be forgetful, it's another to be reckless. Sullivan and Hocking have been reckless with this course and have kept his students WOEFULLY unprepared for classes that build on this: 4102 and 3102. I am severely disappointed in the professor and the course directors who have allowed this incompetency to run multiple sections with very little reward.
Unacceptable and extremely flawed.
Get us started by writing a question!
It looks like you've already submitted a answer for this question! If you'd like, you may edit your original response.