Most new math ideas don’t come to me quickly and I need to give them plenty of time to marinate before I’m ready to make use of them. I’ve found success in reading and studying (just a bit) problem sets as early as possible, even if I don’t plan on completing them, so that I can identify what topics I’m struggling with. This has helped me build a habit of daydreaming about math problems too, its kind of fun to be surprised by an insight walking down the sidewalk or getting ready in the morning!
Welcome to cs1800! We’ve got a whole amazing team of faculty, coordinators, and Teaching Assistants, and we’re all here to help. Discrete is one of my all-time favorite classes, and we’ll spend this semester learning about the foundational links between mathematics and computer science. We don’t expect any specific experience in math or CS; everyone is welcome in this course. Discrete is theory-based, and we work with pencil and paper, but it will feel different than other math courses you’ve taken (and more fun!). Please come to my office hours to ask questions or just say hello!
Math and computer science is often a very collaborative subject. I personally find it fun to bounce ideas of other people. My advice (and one I would give to myself in the past) is to attend some TA office hours even if you don’t have questions, need help, or don’t know if you need it. Sometimes you’ll just overhear a question someone asked and realize “That is something I didn’t think to ask and don’t know how to answer. Let me join in.” Other times you might be able to help someone else out. But in all cases, it’s a way to meet other people and make some more friends outside of recitation.
What is discrete math? It’s a big grab-bag of seemingly unrelated topics that have little in common other than that they peripherally involve… well, “discrete things”: things that we can enumerate, count, maybe even touch, things that happen instead of other things. What does Boolean algebra have to do with designing electronic circuits, and what does counting have to do with winning a poker game, and what do proof methodologies have to do with planning a concert tour? You’ll have to take this course to see! And “taking this course” is not a passive process: you’ll learn–and more importantly, retain–so much more if you engage: ask questions, venture guesses, talk to your classmates. That’s what recitations are for. So don’t just show up, take part, and make this an awesome class!
Working through different problems, discussing topics with fellow peers, and sharing different approaches of solving the same problem enriches one’s understanding of discrete math. That is mainly what recitations are about! Come ready for fun interactive sessions where all questions are welcome!
Warning
Please use Piazza, not email, for all math content related questions to the course staff. If you’d like to reach an individual below, please use email unless you hear otherwise from them (not Microsoft Teams).