yes it is true because in dfa we show transition for every symbol on each state .if we have a dfa which accepts all strings (0+1)* for a given input symbols {0,1,2} then for any transition with 2 as the input symbol will lead to a dead state / trap state.when we make all the states as accepting states we include dead state also otherwise it will not be (sigma)^(*).