NP-Hard problems which are not NP-Complete
No. E.g. the Halting problem is a decision problem which is NP-hard but not in NP and therefore not NP-complete.
In normal usage yes, because an NP-complete problem must be in NP and NP is a class of decision problems. But see Decision problems vs “real” problems that aren't yes-or-no.