In this paper, we consider generalizations of two classical probability problems: the birthday problem and the coupon collector's problem. These problems are discussed in terms of urn models and captured through generating functions. Some methods for the study of the problems are presented. Furthermore, we also formulate the generalized birthday and coupon collector's problems as the waiting time problems. In each case, numerical examples are given in order to illustrate the feasibility of our methods.