Algorithmic and Combinatorial Thinking (PACT)

Completed a 4-week summer program led by Professor Rajiv Gandhi of Rutgers and the University of Pennsylvania, focusing on graph theory, permutations and combinations, and probability as they relate to computer science.
My experience at the camp was both challenging and exhilarating. I dove headfirst into the world of discrete mathematics, grappling with systematic counting and proof methods. As we progressed, I found myself unraveling the intricacies of graph theory and applying induction to prove complex theorems. The probability section was particularly eye-opening; while I had some prior knowledge, the camp took me far beyond basics, introducing me to set theory, advanced combinatorics, and the fascinating concept of linearity of expectation. The problem sets were intense, constantly pushing me to question my intuitions about probability. Towards the end, we even dipped our toes into algorithms, exploring asymptotic analysis and Big-O notation. The guest lectures were a highlight, offering tantalizing glimpses into fields like computational geometry and cryptography, and leaving me eager to explore theoretical computer science further.