Here we look at properties of categories that are common across all concrete categories from different branches of mathematics. As discussed earlier we are trying to find the properties of a category from its external interactions and universal properties give us a way to do this. In particular we may be looking for unique arrows (morphisms) that have some particular property.
In universal properties there is a unique isomorphism somewhere, this gives the 'best' of such a property.
Universal constructions happen in dual pairs:
Limits and Colimits
This is a generalisation that includes:

Linked to the ideas of universal properties and adjoint functions
(Co)Limits add two vertices to a given diagram:
 A universal vertex which represents the 'best possible' in some way.
 A vertex which represents any other possible object.
 An unique arrow between them.
So this arrow must be unique together with the condition that the various triangles formed with the preexisting diagram must commute and any requirements of the existing diagram must be met.
universal cone over diagram:  

Initial/terminal 
empty diagram 
product/sum  
pullback/pushout  
(co)equaliser 
Cone and Cocone
This is also called a wedge. For a given pair there may be many wedges. We look for a 'best possible' wedge .
example: highest common factor.
A cone/cocone can be added on to an existing diagram.
Cone  Cocone  

A cone/cocone is defined by the tuple: (X,f,g).  
We can give this a universal property if, for other tuples (X_{i},f_{i},g_{i}), there is an arrow m known as the mediating arrow. This makes (X,f,g), in some way, the 'best' for that construction.  
Example in set  union 
intersection 
Initial and Terminal Objects
These are related to the identity elements of an algebra.
In some cases (group, vectors) an object is both initial and terminal, in this case it is called a zero object or null object.
Terminal objects give a category theory version of the concept of 'element' in set theory. 1 > A allows us to pick out an arbitrary element of the set.
Terminal  Initial  

Notation  1  0 
generalisation  a kind of limit  a kind of colimit 
universal cone over diagram  empty diagram 

examples: set:  {1}or {a} ... set with one element (singleton) 
Ø = {} empty set 
group (null object)  trivial group (just identity element)  trivial group (just identity element) 
topological space  single point  empty space 
poset  greatest element (if exists)  least element (if exists) 
monoid  trivial monoid (consisting of only the identity element)  trivial monoid 
semigroup  singleton semigroup  empty semigroup 
Rng  trivial ring consisting only of a single element 0=1  ring of integers Z 
fields  does not have terminal object  does not have initial object 
Vec  zero object  zero object 
Top  onepoint space  empty space 
Grf  graph with a single vertex and a single loop  the null graph (without vertices and edges) 
ΩAlg algebra with signature Ω 
initial (term) algebra whose carrier consists of all finite trees.  
Cat  category 1 (with a single object and morphism)  empty category 
Equaliser and Coequaliser
every subset of a set occurs as an equaliser.
Equaliser  Coequaliser  

universal cone over diagram  
An equaliser is an arrow 'h' which makes 'f' and 'g' equal. 
A Coequaliser is an arrow 'h' which makes 'f' and 'g' equal. Universal Property: 'k' is a unique arrow known as the mediator. 

this is equivalent to the following diagrams commuting 
that is: 

equaliser is monic (injective)  coequaliser is epic  
Product and Sum
Product 
Sum 


universal cone over diagram  
generalisation  a kind of limit  a kind of colimit 
set example  cartesian product {a,b,c}*{x,y}= 
disjoint union {a,b,c}+{x,y}= 
group  the product is given by the cartesian product with multiplication defined componentwise.  free product the free product for groups is generated by the set of all letters from a similar "almost disjoint" union where no two elements from different sets are allowed to commute. 
Grp (abelian)  direct sum  direct sum the group generated by the "almost" disjoint union (disjoint union of all nonzero elements, together with a common zero) 
vector space  direct sum  direct sum 
poset  greatest lower bound meet 
least upper bound join 
base topological space  wedge  
POS  greatest lower bounds (meets) 
least upper bounds (joins) 
Rng  
Top  the space whose underlying set is the cartesian product and which carries the product topology  disjoint unions with their disjoint union topologies 
Grf  
category  objects: (a,b) morphism: (a,b)>(a',b') 
tensor products are not categorial products.
In the category of pointed spaces, fundamental in homotopy theory, the coproduct is the wedge sum (which amounts to joining a collection of spaces with base points at a common base point).
Sum
When generating a sum for objects with structure then the structure associated with the link can be added to the sum object.
Product
Products for groups are discussed on this page.
Pullbacks and Pushout
Pullback:
 Generalisation of both intersection an inverse.
 If a category has binary products and equalisers, then it has pullbacks.
In programming terms it is related to the concept of indexing.
The pullback is like a type of division for function composition, in other words if multiplication is function composition then what is division? This comes in left and right flavors that is:
if h = g o f
 We know f and h, how do we find g?
 We know g and h, how do we find f?
More about pullbacks on page here.
Completeness and Cocompleteness
 a category is complete if every diagram from a small (i.e. finite) category to it has a limit
 a category is cocomplete if every such functor has a colimit.
Competeness  Cocompeteness 


set example 


Set  
Grp  
Rng  
Vec  
Top  
Grf  
Cat 
Exponential
This is a universal structure but not a limit.
Example of a Limit
Lets look at a Category of Subsets (could also be looked at as a poset, which forms a lattice, but the diagrams seem more instructive if we show it as subsets) where the objects are subsets and the arrows preserve these subsets:
So, as an example, we take these three subsets:


There are various other subsets which have arrows to our original diagram:
(on this diagram I have shown an internal representation of the arrows rather than just the arrows themselves) 

But only one of these has arrows from all the others. 
We can see that this limit represents the biggest subset which is common to our original diagram. In some ways limits like this represent a more sophisticated form of 'type', so all the objects in the first diagram are a 'type' which contain {a,b}.