This (I guess) is a question oriented towards teaching/exemplifing the basic properties of the Discrete Fourier transform (DFT) - which are mostly analogous from those of the continuous transform. If you already are supposed to know them (perhaps not), you should be able to identify (or predict) each inverse 'modified' transform, thinkig of it as the transform of a 'modified' sequence.
To give a basic example (simpler than any of your five cases). Given the pair $x[n] \leftrightarrow X[k]$, you probably know that if we multiply the signal by a constant $a$, the DTF results multiplied by the same constant. So that if you think about that modified transform pair $y[n] \leftrightarrow Y[k]$ with $y[n]= a \; x[n]$, you know that $Y[k] = a X[k]$, or more compactly : $a \; x[n] \leftrightarrow a \;X[k]$.
This means that, if somebody asks you to compute the IDFT of $a X[k]$ , you know what you are going to get: the same original signal multiplied by $a$
Now, other modifications of signal-transform pairs are less trivial than this (and the five cases are such). For example, take the last one. What transformation of a signal results in the transform being conjugated? It's easy to see that for the DTFT it's time reversal (see eg here), which for the DFT should correspond to some 'ciclical' time reversal. And if you look at the result, you see that the obtained signal is esentially the original reversed in time.
For the first case you recall $x[n] * y[n] \leftrightarrow X[k] Y[k]$ (convolution) , so $x[n] * x[-n] \leftrightarrow |X[k]|^2$
So that the modified signal is a (cyclic) convolution of the original with itself reversed.
For the second, recall that that the DFT is real if the signal is even (mod N). Decompose it in a a sum of even/odd signals, and you're done.
And so on.