I have chosen an example task to see if I understood DFA and NFA correctly.
So let's say we have that task:
Given alphabet $\Sigma = \{0,1\}$ and the language $L = \{w \mid w \text{ includes two consecutive zeroes}\}$. Create a DFA and a NFA for the language with as less as possible states.
The following description is just a rough one (there are much more attitudes a DFA / NFA has). Please tell me if it's correct anyway because these are the ones I'm not sure about.
For this example, each state of the DFA needs at least two outgoing arrows. So each state needs at least one outgoing arrow $0$ and one outgoing arrow $1$ because we have $\Sigma = \{0,1\}$. We do not really need to care about incoming arrows, there can be any number of incoming arrows.
For the NFA, however, we do not need to care how many outgoing / incoming arrows we use for each state.
So here I made a DFA and a NFA where the words include two consecutive zeroes. Did I do it correctly?