We’ll discuss the basics of Fourier analysis on finite abelian groups and talk about some of its applications in additive combinatorics. Time permitting, we’ll move on to discrete geometry and perhaps will point out some techniques that were discovered while working over (F_q)^d and later were used in solving various problems in the continuous setting and vice-versa.