3. Xpcx), p(x>:X 'is comput er 5eience

Quantification is a statement that includes 'for all', 'there exists' etc. Two types of quantification exist. These are universal quantification and existential quantification. 

The given quantification is

$\neg \forall xP\left(x\right)$

Here, the domain is the college students and 

$P\left(x\right):x$ is a computer science major.

We write the given quantification verbally.