Introduction to the theoretical underpinnings of computer science. Topics include propositional predicate logic, set theory, functions and relations, counting, mathematical induction and recursion (generating functions).
5
UnitsLetter
Grading1, 2
PasstimeNone
Level LimitEngineering
CollegeGreat professor, if you particpate in class. She awards participation, and it is super easy to just show up to lecture and listen. She really cares about her students, especially the ones that will put in the effort. That is all you have to do for this class. Put in effort and learn and you will get an A. She deserves a higher overall rating
She is a good professor who cares about your learning.
This was a difficult class, but she did her best to support her students during OH. Her lectures weren't super clear but there were a lot of opportunities to get your questions answered outside class and get more practice. Final was easy compared to the midterm. Overall, super caring but a little unclear in terms of expectations and teaching.
Gives a HUGE advantage to students that go to her OH and participate in class. Isn't the best lecturer, but her teaching team sets up a good amt of resources to learn everything regardless. She made the midterm really hard to scare everyone (score of it is replaceable w/ online textbook work) and then made the Final super doable.
Before taking her class, I was appalled by the abysmally low rating on this platform, but I don't think she deserves this low rating. She's a very caring professor and supports struggling students who show effort, even if they don't have the best scores. Lectures are unorganized, and the homeworks were really time-consuming though.
CS 40 is hard because its discrete math. Professor Majedi is caring and kind. To succeed in this course, you need to PUT IN THE EFFORT. Majedi tries her best to teach us and help us thrive, and she does a pretty good job. Go to exam jams if you need more help. She offers to many recourses, but you need to take initiative to work hard to succeed.