How to design a Turing Enumerator which either ends with 011 or is of odd length?
I'm assuming you're looking for a Turing machine that decides the language $L$ consisting of all words ending with 011 or of odd length.

Hint: You're lucky since $L$ is regular. Construct a DFA for $L$ and rephrase it as a Turing machine.