By completing this course, students will be able to (1) apply advanced enumeration techniques (generating functions, Möbius inversion) to solve counting problems, (2) analyze asymptotic behavior of combinatorial structures using singularity analysis, and (3) construct extremal set systems with prescribed intersection properties, connecting these methods to problems in computational complexity and discrete geometry.