2. Assign five college students to three villages in a certain town. If each village must have at least one student, then the number of different assignment schemes is $\qquad$ .
2. 150 .

According to the number of college students allocated to each village, the only two types that meet the requirements are $1,1,3$ and $1, 2, 2$. Therefore, the number of different allocation schemes is
$$
C_{3}^{1} C_{5}^{3} C_{2}^{1}+C_{3}^{1} C_{5}^{2} C_{3}^{2}=60+90=150
$$