Among the kinds of problems/questions you should expect are these:
{ A → α' | α' is obtained by erasing zero or more occurrences in α of nonterminals originally having λ-productions }
For example, if A → xByCz is a production and both B and C originally had λ-productions, then keep that production and add these three productions: A → xyCz | xByz | xyz.
Given a different kind of "undesirable" production, devise a method by which to remove all such productions from a CFG without changing the language that it generates.