Not too easy. Not too difficult.
Course Overview:
The course really delves into the underlying concepts of computer science, including logic and mathematics.
Course highlights:
I developed a good understanding of logic concepts, including the various types of logical sentences, not to mention mastered inductive proofs.
Hours per week:
3-5 hours
Advice for students:
Logic is probably the most important topic the class covers.
Not too easy. Not too difficult.
Course Overview:
CS 151 was a very interesting class and it helped to further my knowledge of computer science. Professor DasGupta does his best to explain things in a manner that is to easy to understand and yet still retain the core aspects of the information. His TA's also did their best to explain the information more thoroughly in discussion sections and prepare us for the exam.
Course highlights:
I feel as though I have gained a better appreciation for my major as a result of this class. It covered some of the inner workings and logic behind different aspects of computer science. It helped prepare us for classes that we will have to take in the future by already introducing us to the material, such as data structures, trees, and graphs.
Hours per week:
6-8 hours
Advice for students:
To succeed in this class you need to pay attention to the professor's lectures and take very detailed notes. Go over the material after class and ask questions immediately if you do not understand something. Definitely go to office hours fro either the professor of the TA's because they are nice and they will do their best to help you understand the material. Make a friend in this class so you can get additional help when studying for exams and someone to talk to when you don't understand a topic.
Pretty easy, overall.
Course Overview:
I'd recommend this to anyone interested in discrete math. It's not as math intensive as the name would lead you to believe. It's fairly easy.
Course highlights:
The highlights are honestly the tests. They are much simpler than what is on the homework. I learned about 1) Truth tables and Logic (predicate and propositional) 2) set theory 3)big O notation 4) algorithms
Hours per week:
0-2 hours
Advice for students:
Pay attention in lecture. Practice problems in the book and the sample test problems the teacher may post. They are most similar to the tests.