Relations, dependencies and normal form I have some issues in understanding about relations and dependencies. I will show two examples and what I want to know:

Assume the relation GTX {G,T,X} with the following dependencies: 

G,X -&gt; T
T -&gt; X


or this one:

Relation {W,X,Y,Z}:

X,Y -&gt; Z
Z -&gt; W



So to my question, how do I properly draw a dependency diagram for
this kind of relations? (tutorials or/and explanations are much
appreciated) 
How do I see what the primary key is? (I know what a pk is) 
In which normal form are the relations?


I have never been able to understand this fully and always got confused by the tutorials I found. I appreciate all answers!
From a set of FDs, you can only infer a set of candidate keys.

A "primary key" is one particular member of that set of candidate keys that you elect to be "primary".  And there are no scientific rules that tell you which one you should choose - you can pick just any key and label it "primary".

In your first example, you should end up with a set of candidate keys

{ {T G} {G X} }

In the second example, you should end up with a singleton set of candidate keys

{ {X Y} } 

As for how to arrive at the set of keys, you can take a look at https://stackoverflow.com/questions/5735592/determine-keys-from-functional-dependencies/5736174#5736174