A function is said to be surjective if for every element in it's codomain there exists at least one element in it's domain that outputs that element. Bijective functions are a stricter subset of surjective functions as all bijective functions are surjective.