At the very beginning of Chapter 1.7 the definition of a category is given as:
A category is a class $\mathfrak{C}$ of objects (denoted $A,B,C,...$) together with
(i) a class of disjoint sets, denoted $hom(A,B)$, one for each pair of objects in $\mathfrak{C}$;(an element $f$ of $hom(A,B)$ is called morphism from $A$ to $B$ and is denoted $f: A \rightarrow B $);
(ii) ...
Definition continues with the composition property of arrows.
My problem is:
According to the part (i), $hom(A,B)$ is a class of disjoint sets. Members of this class are morphisms that is if $f,g$ are two morphisms from $A$ to $B$ then $f,g \in hom(A,B)$ and since $hom(A,B)$ consists of disjoint sets $f$ and $g$ must be disjoint sets. My question is what is the meaning of "two morphisms being disjoint".
Please do not give any other definitions of a category. If you understand my problem and can see my mistake here and if you know this book well you are more than welcome. Thanks in advance
It seems to me that you misunderstood something.
Hungerford did not say that $hom(A,B)$ is a class of disjoint sets. He said that
For each pair $(A,B)$ of objects $A, B$ of $\mathfrak C$ one has a set $hom(A,B)$ whose elements are called morphisms from $A$ to $B$.
These sets are disjoint for distinct pairs $(A,B)$ and $(A',B')$. That is, if $(A,B) \ne (A',B')$ (which means $A \ne A'$ or $B \ne B')$, then $hom(A,B) \cap hom(A',B') = \emptyset$.
He also did not say that the morphisms of $\mathfrak C$ are sets. However, in some axiomatic approaches to set theory one can regard each morphism of $\mathfrak C$ as a set because every $x$ satisfying a relation $x \in X$ is defined to be a set. But that is irrelevant here. Whether or not elements $f, g \in hom(A,B)$ are sets, we can only say that they are distinct ($f \ne g)$ or not ($f = g$). Note in particular that if $f,g$ are sets, we may have $f \ne g$ and $f \cap g \ne \emptyset$.