Should two DFAs be complete before making an intersection of them?
So when doing the transition table of the two automata, if there is no transition, should I just ignore it like in the 3rd automaton?


If there is no transition in one of the automata, then that one won't accept the input word. Therefore, the automaton for the intersection should not accept either; not having a transition is one way to make sure of that.