Course Staff
Note
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 (not Microsoft Teams) unless you hear otherwise from them.
Instructors
Matt Higger (he/him) |
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 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! |
Ariel Hamlin (she/they) |
Read the homework early! That way even if you don’t start right away you can be thinking about the problems throughout the week. |
Ghita Amor-Tijani (she/her) |
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! |
Matt Jones (todo) |
todo |
Carter Ithier (he/they) |
Redo homeworks when you’re studying for exams to make sure you’ve really mastered the concepts! |
Jesse Stern (he/him/any) |
One of the great things that discrete structures has to offer is the ability to take a problem that you may already have some intuition about, break it down, and clearly express the problem and its answer. Often in computer science the devil is in the details. Even if you have a rough idea of how something works initially, there may be many “small” factors that have significant impact. Does the algorithm involve a graph? If so, how is the graph represented by the machine? Does this effect how long various sub-routines will take? Are all the algorithms loops going to work correctly? Maybe we can verify this last one with induction before we even run the code! The answers to all of these questions and more are rooted in discrete structures, and I and the rest of the faculty/staff look forward to guiding you in learning these fundamental concepts and skills. |
Academic Coordinator
Liz O’Reilly e.oreilly@northeastern.edu (she/her) |
Teaching Assistants
Ronhit Neema (he/him) |
Sameer Ahire (he/him) |
Hana Ahmed (she/her) |
Prathamesh (Pratham) Akole (he/him) |
Salma Alawi (she/her) |
Luke Albinger (he/him) |
Laasya Anantha Prasad (she/her) |
Pranav Kanth (Pranav) Anbarasan (he/him) |
Ami Ashman (he/him) |
Ruhan Bhakta (he/him) |
Harris Bubalo (he/him) |
Sachin (Sachin) Channabasavarajendra (he/him) |
Hamza Akmal Chaudary (he/him) |
Raghav Gali (he/him) |
Priyanka Gujar (she/her) |
Akshay Gunjur Surya Prakash (he/him) |
John (Jack) Heidrick (Any/All) |
Gabriella (Gabby) Hylton (she/her) |
Raj Jagirdar (he/him) |
Damyant Jain (he/him) |
Aiyan Jiang (he/him) |
Jayesh Katade (he/him) |
Chaitanya (Chai or CK) Kharche (he/him) |
Anisha Kushwaha (she/her) |
Trym Kyvaag (he/him) |
Avery Leiss (she/her) |
Andrew Lengyel (he/him) |
Lauren Li (she/her) |
Jia-Li (Lily) Lin (she/her) |
Yun (Lauren) Lu (she/her) |
Ananya Mahendra (she/her) |
Dhananjaya Kumar (Dj) Mittapalli (he/him) |
Sukruth Mundaragi Surendranath (he/him) |
Sankalp Mundra (he/him) |
Yanxi Na (she/her) |
Sri Charan (Charan) Namana (he/him) |
Vasumathi Narayanan (she/her) |
Pruthvi Prakash Navada (he/him) |
Gillian Palmer (she/her) |
Sai Chandra Pandraju (he/him) |
Isabelle Papa (she/her) |
Sourabh Pawar (he/him) |
Neha Ravuri (she/her) |
Riya Roy (she/her) |
Aneri Shah (she/her) |
Katie Elyse (Katie) Song (she/her) |
Caroline Southard-Smith (she/her) |
Katherine (Kate) Stuntz (she/her) |
Manh Tran (he/him) |
Meng-Hsien (Joey) Tsai (he/him) |
Aravind Venkatapathy (he/him) |
Shishir Volety (he/him) |
Xiu Xiu (Xiu Xiu) Ying (she/her) |
David Zhang (he/him) |
Jieyi (Jenny) Zhou (she/her) |
amanda fong (she/her) |