We cover a number of combinatorial objects which will be beneficial to the study of the Cyclic Sieving Phenomenon--a recent combinatorial field of research first introduced by Reiner, Stanton and White. By introducing the study of Dyck Paths, Set partitions, and q-analogues, we will study simple examples of how groups exhibit the Cyclic Sieving Phenomenon. We will conclude this week's presentation with a buildup to an open conjecture and our current research program progress.