Number of states in NFA and DFA accepting strings from length 0 to n with alphabet Σ= {0,1}
You can define DFAs in both ways. One can require the transition function to be total, but it is indeed fine to define DFAs without this requirement. You (or your lecturer) just choose one definition and stick with it.