What exactly are the meaning of the followings in the definition of a category? In Awodey's Category Theory a category is defined as follows. 

A category consists of the following data, 
  
  
*
  
*Objects: $A, B, C,\ldots$
  
*Arrows: $f,g,h,\ldots$
  
*For each arrow $f$ there are given objects, $$\operatorname{dom}(f),\ \ \operatorname{cod}(f)$$
  called the domain and codomain of $f$. We write $f : A → B$
  to indicate that $A = \operatorname{dom}(f)$ and $B = \operatorname{cod}(f)$.
  
*Given arrows $f : A → B$ and $g : B → C$, that is, with
  $\operatorname{cod}(f) = \operatorname{dom}(g)$ there is given an arrow
  $g \circ f : A → C$
  called the composite of $f$ and $g$.
  
*For each object $A$, there is given an arrow $1_A : A → A$
  called the identity arrow of A.
These data are equired to satisfy the following laws, 
  
  
*
  
*Associativity:
  $$h \circ (g \circ f)=(h \circ g) \circ f$$
  for all $f : A → B, g : B → C, h : C → D$.
  
*Unit: $f \circ 1_A = f = 1_B \circ f$ for all $f : A → B$.

My questions are,


*

*What do we mean when we say that a category "consists of" something? Do the functions and objects "belong to" the category in some more general sense of $\in$ as in $\sf{ZFC}$?

*Presumably, here Awodey talks of "collection of objects" and "collection of arrows" but what precisely is a collection here? Will it be sets? classes? or, something else?

*What is(are) the difference(s) between data and laws?

*As has been hinted in Q the Platypus's answer below, I think we may define a category to be a triple of obljects, arrows and composition. But then we need to know whether we are taking the notion of triple as a primitive notion. For if not, then naturally the question is, what is the definition of a triple? 
 A: This question is not really about category theory itself (though category theory is the first subject in which the issue you are running into cannot be easily swept under the rug). 1. and 2. could be equally well asked of set theory and basic algebra


*

*"In what way does the collection of all sets consist of sets?"

*"What are collections of sets actually?" 


Slightly more subtle is 3. but it can be asked in algebra


*"What is the difference between declaring a group to be a set equipped with a binary multiplication operation so that every element has an inverse, vs. declaring a group to be a set equipped with a binary multiplication operation and a unary inversion operation (both structures with the appropriate axioms)?"


The answers to 1. and 2. is that you have to set up some theory that allows you to talk about collections. The standard theory do this with is first-order logic, in which every formula with free variables is a description of a collection (aka a class), and these collections may also be described by auxillary functions and relations.
Set theory is then a particular collection with an auxillary relation called "belonging" ($\in$) that satisfies certain axioms (e.g. ZFC). We call the objects that constitute this collection sets.
Peano arithmetic is another collection, called the natural numbers, equipped with a designated object $0$ and special function called "successor" subject to certain axioms. This is different (but related) to the natural numbers considered as a set, because any set determines a collection of its elements with properties mirroring the properties of the set.
Categories in general are (or rather, can be presented as) a pair of collections in the above sense (collections described by formulas with free variables in first-order logic) known as the collections of objects and collections of morphisms, equipped with auxillary functions and relations between them (identity, domain, codomain, partially-defined composition), satisfying certain axioms (identity, associativity).
Things get complicated because if you also have a fixed set theory (e.g. ZFC), then you can build categories as the collections of elements of pairs of sets equipped with set-functions and relations that satisfy the appropriate axioms. These would be so-called small categories. A fundamental category is then the category of sets because traditional mathematics is built on top of it, so you have to study the interactions of set theory (i.e. the category of sets) with all the other categories, paying attention to which ones are small and which ones are large.
A further complication is that there is no class of all class functions, for the same reason there is no set of all sets. But there is a class of all class functions whose domain is a set, i.e. a small class. So, because categories can be large, when constructing categories and generally thinking about them you have to pay attention to size issues, to whether they are small (given by classes of elements of some set or not). 
People find this to be annoying to deal with by hand, so instead they enlarge ZFC with an "axiom of universes", which asserts there is a set all of whose elements form a collection satisfying the axioms of ZFC. Such sets are then called small, the others called large, and you can then go through category theory without having to learn about first-order logic and only using this extension of ZFC in a naive fashion. Doing this, you no longer have a category of ALL sets, but you work instead with the category of small sets.
A: To say that a category "consists of the data" means that in order to specify a category, one has to tell their reader exactly the data that lies inside the definition. For instance, a monoid consists of the following data: A set $M$; a binary operation $\circ:M \times M \to M$ that is associative, i.e., $\circ(g,\circ(h,k)) = \circ(\circ(g,h),k)$; and a distinguished element $e \in M$ called the identity that has the property $\circ(g,e) = g = \circ(e,g)$ for all $g \in M$. To give a monoid $M$ is to define all of these things simultaneously. Thus to say what a category consists of is to define what makes up a category. In this sense to say that something belongs to a category, we mean that it is an element of the object "set," has a corresponding identity morphism in the morphism "set," and satisfies the necessary identities with respect to composition. Here we need some notion of "set," but whatever theory you wish to work in will be appropriate; for instance, you can use ZFC, you can use some set theory involving some appropriate notion of a Grothendieck universe in which every "set" smaller than some fixed strongly inaccessable cardinal $\kappa$ is "small" and every other "set" is large, or even a strange model of set theory. The beauty of the elementary axioms of category theory is that they hold so long as your set theory can handle the quantification and universal instantiation that is necessary to give the required data. Note that we can move past the notion of a primitive universe, say such as the category $\mathbf{Set}$, by then moving through an enrichment process, i.e., we add to our set theory all the things we need to define a universe in which our theory makes sense. If you are interested in this theory, you may want to read some enriched category theory and learn about $\mathscr{V}$-enriched universes. Note that when you enrich your set theory, even though you have, say, a new way of sovling the halting problem, you now have a $\mathscr{V}$-halting problem that you will have to enrich again to fix. This problem occurs infinitely, and needs some sort of transfinite induction to really talk about precisely.
When Awodey talks about the collection of objects and the collection of morphisms, he means a "Set" in whatever relevant set theory you care about for the moment. For instance, when we define the category $\mathbf{Set}$, the collection of objects is not, in the sense of ZFC, a set: It is a proper class! However, in this case we simply acknowledge the fact that sometimes we need to move up a universe of set theory in order to work. Again we run into the topic of enrichment, which makes this topic precise. Many people in math, myself included, just take for granted that we live in some Grothendieck universe and eventually have to move into dealing with "large" categories. These categories generally behave strangely, but are extremely important. For instance, in algebraic geometry, if $X = (X,\mathcal{O}_X)$ is a scheme, then the category $\mathbf{\mathcal{O}_X-Mod}$ is (generally) a large Abelian category, while for any ring $R$, the category of left $R$-modules with nondegenerate $R$ actions is a very nice Abelian category, al. In fact, the celebrated Mitchell-Freyd Embedding Theorem tells us that if $\mathfrak{A}$ is a small Abelian category, then there is a full and faithful embedding of $\mathfrak{A} \to \mathbf{R-Mod}$ for some ring of unit $R$ that preserves exactness. This gives us the result that essentially means that if you are arguing with a finite diagram in an Abelian category $\mathfrak{A}$, then you may as well use modules and module theory in order to make your life easier. For the most part you can treat the object "Set" and morphism "Set" of a category as if they were sets, or elements of some enriched and larger theory where such things make syntactic sense. Just be careful: objects in a category need not be sets, and you cannot argue set theoretically about some things. For instance, if we are dealing with a large Abelian category $\mathfrak{A}$ and we have an infinite diagram that we need to deal with, such as a cohomology long exact sequence, then we CANNOT, at least in general, use Mitchell-Freyd and we must argue with universal properties and such, save for special cases.
To address your third question, the difference between data and laws is that laws, in this sense, are syntactic or algebraic rules that MUST hold at all times, while data can vary. For an example, note that the categories $\mathbf{FinSet}$ of finite sets and $\mathbf{FinGrp}$ of finite groups have varying data: the morphisms in $\mathbf{FinSet}$ are very different from the morphisms in $\mathbf{FinGrp}$; however, the morphisms satisfy the same basic composition laws ($f:A \to B$ and $g:B \to C$ gives a composition $g \circ f:A \to C$), the same associativity laws ($f \circ (g \circ h) = (f \circ g) \circ h)$, and the same unit laws ($f \circ \operatorname{id} = f, \operatorname{id} \circ f = f$)!
A: A category consists of something in much the same way a group consists of an operation and a set.  Often a category is a tuple of a class of objects and a class of arrows.  However because sometimes categories deal with collections that are larger then classes it makes sense to use a vague term that basically means "Use the appropriate set/class/etc concept here"
A: Some thoughts from a definitely non expert:
When doing mathematics, you have to first choose a logical system within which to work. The first axiomatic system introduced to mathematicians is practically always ZFC, but by no means is it the only choice. 
Category theory is interested in the consequences of composition of events, and so it only defines itself in terms of what it needs:


*

*You have some logical things called objects that you find interesting

*Things happen to these objects in a compositional way that is even $more$ interesting

*One possible thing that can happen to your objects is nothing


There is then, in a sense, a different category theory for each definition of "logical thing", but not all logical systems are created equal with respect to discussing categorical questions!
As an example, we certainly have logical things called sets, functions act on sets compositionally, and the identity map certainly doesn't effect a set. So we $should$ be able to talk about the category of sets, but this is a pain to do in ZFC, because, as you have experienced first hand, when you try to talk about all of sets as an object, ZFC screams in your ear, "That's not a set, that's not a set, be suspicious of this thing's existence!"
The solution is simple: if you want to ask categorical questions about ZFC(or the theory of groups, rings, modules, and many other subjects) don't use ZFC as your logical system. You could instead use a logical system that axiomatizes things larger than sets(logical things $a$ for which $a\in b$ is not defined), and then SETS(and many other interesting things!) will be within your grasp. 
An example of such a system that is similar to ZFC is NBG(von Neumann Bernays Gödel) theory, wherein one begins with the notion of class as a starting point, but there are of course others.
Alternative, you could ask yourself if you even $want$ set theory when doing category theory. Set theory is, in a word, an axiomatic system used to describe the use of the symbol $\in$ in a way that hopefully doesn't, but possibly might lead to paradoxes. Since category theory tends to focus on $actions$(which compose) instead of $things$(which belong), this is rarely useful. So a simple, and seemingly often suggested course of action is: take what you've learned from set theory, and just stop asking $\in$ questions.
Either way, your worries are now no longer a concern: SETS is a reasonable object to consider, as you are either using a larger theory to study it, or you are not asking questions which presuppose the nonexistence of SETS.
