Why Fourier transforms reveal frequencies in SciPy - Test Your Understanding

Practice - 5 Tasks

1fill in blank

easy

Complete the code to import the Fourier transform function from scipy.

SciPy

from scipy.fft import [1]

Drag options to blanks, or click blank then click option'

Afft

Bsin

Ccos

Dintegrate

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'sin' or 'cos' instead of 'fft' because they are trigonometric functions, not transform functions.

Trying to import 'integrate' which is unrelated here.

The fft function computes the Fast Fourier Transform, which reveals frequency components.

2fill in blank

medium

Complete the code to create a time array from 0 to 1 second with 500 points.

SciPy

import numpy as np
time = np.linspace(0, [1], 500)

Drag options to blanks, or click blank then click option'

A100

B1

C0.1

D10

Attempts:

3 left

💡 Hint

Common Mistakes

Using 10 or 100 which are too large for 1 second duration.

Using 0.1 which is too short.

The time array should span 1 second, so the end value is 1.

3fill in blank

hard

Fix the error in the code to generate a signal with frequency 5 Hz.

SciPy

freq = 5
signal = np.sin(2 * np.pi * freq * [1])

Drag options to blanks, or click blank then click option'

Anp.pi

Bfreq

Cnp.linspace

Dtime

Attempts:

3 left

💡 Hint

Common Mistakes

Using frequency variable instead of time inside the sine function.

Using np.linspace which is a function, not a variable.

The signal depends on time, so the variable time must be used inside the sine function.

4fill in blank

hard

Fill both blanks to compute the Fourier transform and get the frequency bins.

SciPy

yf = [1](signal)
xf = np.fft.fftfreq(len(signal), [2])

Drag options to blanks, or click blank then click option'

Afft

B0.002

C0.01

Dsin

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'sin' instead of 'fft' for the transform.

Using wrong sample spacing like 0.01 which does not match 500 points per second.

fft computes the Fourier transform. The second blank is the sample spacing, which is 1/500 = 0.002 seconds.

5fill in blank

hard

Fill both blanks to create a dictionary of frequencies and their amplitudes above a threshold.

SciPy

result = {xf[1]: abs(yf) for i, yf in enumerate(yf) if abs(yf) [2] 10}

Drag options to blanks, or click blank then click option'

A[i]

B>

D<

Attempts:

3 left

💡 Hint

Common Mistakes

Using parentheses instead of square brackets for indexing.

Using less than instead of greater than for filtering.

The frequency at index i is xf[i]. The amplitude is abs(yf). We filter amplitudes greater than 10.

Practice

1. Why does a Fourier transform help us understand a signal better?

easy

A. Because it averages the signal values over time

B. Because it removes noise from the signal

C. Because it changes the signal into a longer time series

D. Because it shows the different frequencies inside the signal

Solution

1. Step 1: Understand what a Fourier transform does

   A Fourier transform breaks a signal into its frequency parts, showing which frequencies are present.

2. Step 2: Compare options to this understanding

   Only Because it shows the different frequencies inside the signal correctly states that it reveals the different frequencies inside the signal.

3. Final Answer:

   Because it shows the different frequencies inside the signal -> Option D

4. Quick Check:

   Fourier transform = frequency breakdown [OK]

Hint: Fourier transform = signal to frequency parts [OK]

Common Mistakes:

• Thinking Fourier transform removes noise
• Confusing time and frequency domains
• Believing it averages signal values

2. Which of the following is the correct way to import the Fourier transform function from scipy?

easy

A. import scipy.fftpack.fft

B. from scipy.fft import fft

C. from scipy import fourier_transform

D. import fft from scipy

Solution

1. Step 1: Recall the correct scipy module for Fourier transforms

   The modern scipy module for Fourier transforms is scipy.fft, and the function is fft.

2. Step 2: Check each import statement

   Only 'from scipy.fft import fft' is valid Python syntax and correct module usage.

3. Final Answer:

   from scipy.fft import fft -> Option B

4. Quick Check:

   Correct import = from scipy.fft import fft [OK]

Hint: Use scipy.fft for Fourier transforms in recent versions [OK]

Common Mistakes:

• Using scipy.fftpack which is older
• Wrong import syntax causing errors
• Assuming function name is fourier_transform

3. What is the output of this code snippet?

import numpy as np
from scipy.fft import fft

signal = np.array([1, 0, -1, 0])
result = fft(signal)
print(np.round(result, 2))

medium

A. [0.+0.j 2.+0.j 0.+0.j 2.+0.j]

B. [0.+0.j 2.+0.j 0.-0.j 2.-0.j]

C. [0.+0.j 1.+0.j 0.+0.j 1.+0.j]

D. [0.+0.j 0.+0.j 0.+0.j 0.+0.j]

Solution

1. Step 1: Understand the input signal and FFT output

   The signal is [1, 0, -1, 0], a simple wave. FFT returns complex numbers representing frequency components.

2. Step 2: Calculate FFT and round results

   FFT of this signal is [0.+0.j 2.+0.j 0.+0.j 2.+0.j]. Rounding to 2 decimals keeps these values.

3. Final Answer:

   [0.+0.j 2.+0.j 0.+0.j 2.+0.j] -> Option A

4. Quick Check:

   FFT output matches [0.+0.j 2.+0.j 0.+0.j 2.+0.j] [OK]

Hint: FFT output shows complex frequency components [OK]

Common Mistakes:

• Ignoring complex part signs
• Confusing zeros with small imaginary parts
• Misreading array values

4. Identify the error in this code that tries to compute the Fourier transform:

import numpy as np
from scipy.fft import fft

signal = [1, 2, 3, 4]
result = fft(signal, n=2)
print(result)

medium

A. fft does not accept the parameter n

B. The signal must be a numpy array, not a list

C. The parameter n=2 truncates the signal incorrectly

D. The import statement is incorrect

Solution

1. Step 1: Check fft function parameters

   The fft function accepts n, which sets the length of the transform. Setting n=2 truncates or pads the signal to length 2.

2. Step 2: Understand effect of n=2 on signal length

   The original signal length is 4, but n=2 means fft uses only first 2 elements, effectively truncating the signal.

3. Final Answer:

   The parameter n=2 truncates the signal incorrectly -> Option C

4. Quick Check:

   n parameter changes transform length [OK]

Hint: n parameter sets FFT length, can truncate signal [OK]

Common Mistakes:

• Thinking fft requires numpy array input
• Believing fft does not accept n parameter
• Assuming import is wrong

5. You have a noisy signal composed of two sine waves at 5 Hz and 20 Hz. How can Fourier transform help you separate these frequencies?

hard

A. By converting the signal to frequency domain, peaks at 5 Hz and 20 Hz appear clearly

B. By filtering the signal in time domain before transform

C. By averaging the signal values over time to remove noise

D. By applying inverse Fourier transform directly

Solution

1. Step 1: Understand the purpose of Fourier transform on noisy signals

   Fourier transform converts time signals into frequency domain, showing frequency peaks clearly.

2. Step 2: Identify how frequency peaks help separate components

   In frequency domain, the 5 Hz and 20 Hz sine waves appear as distinct peaks, allowing separation despite noise.

3. Final Answer:

   By converting the signal to frequency domain, peaks at 5 Hz and 20 Hz appear clearly -> Option A

4. Quick Check:

   Frequency peaks reveal signal components [OK]

Hint: Fourier transform reveals frequency peaks in noisy signals [OK]

Common Mistakes:

• Thinking noise is removed before transform
• Confusing time and frequency domain filtering
• Using inverse transform without frequency analysis