Diagonalization can be useful in:
(a) To find a non recursively ennumerable language
(b) To prove undecidablility of haltig problem
(c) Both (a) and (b)
(d) None of the mentioned
The question was asked in semester exam.
Origin of the question is The Diagonalization Languages topic in section Undecidability of Automata Theory