We had learned how to find the discrete Fourier transform of a signal in theory lectures. In class, we have practised it by the formula method and the matrix method as well. Thus we were aware of the procedure to find DFT. We broke the code into parts: taking the input, the function, displaying the output. Among these, the function was the most challenging part. The calculated results of DFT we displayed in the rectangular form. We manually found out the polar form and plotted the magnitude and phase spectrum on paper. We then appended the signal with zeroes and observed the results. We noted that the shape of the spectrum remains the same but frequency spacing decreases. Thus we noted that the number of points in the input signal affects various factors of the DFT signal such as accuracy, frequency spacing, resolution. While executing the program we got a few errors, however by patiently checking the program step by step, we were able to debug them.