The project consists of two parts:

PART1: [40%]

Develop a C Program to compute fast Fourier transform (FFT) based on the Cooley-Tukey algorithm.

The program receives input as a 64 array (float) and returns FFT as an array.

a). http://people.scs.carleton.ca/~maheshwa/courses/5703COMP/16Fall/FFT_Report.pdf

b). https://en.wikipedia.org/wiki/Cooley%E2%80%93Tukey_FFT_algorithm

c). <..i@5.7:g8h8qG2L@13/The-Cooley-Tukey-Fast-Fourier-Transform-Algorithm

PART2: Phone Book [60%]

Develop a C program to provide simple phone book functions.

1-ADD

2-Search

3-Delete

4-List

5-Exit

Insert a number and then press enter

How to submit your project:

PART1:

• Create a single PDF file that contains the following items
• • Group member's name and student ID
  • Provide the pseudocode of your method
  • Provide the structure of your program
  • Take screenshots of the output
  • Solutions MUST be typed; no other format will be accepted
• Save your file as per the following example of naming pattern:
• Group Members Name_P1.pdf
• AMIN SAFAEI_STUDENT NAME2_STUDENT NAME3_P1.PDF
• Upload the source code with as per the following example:
• GROUP MEMBERS NAME_P1.c
• AMIN SAFAEI_STUDENT NAME2_STUDENT NAME3_P1.c

PART2:

• Create a single PDF file that contains the following items
  • Group member's name and student ID.
• Provide the pseudocode of your method
• Provide the structure of your program
• Take screenshots of the output
• Solutions MUST be typed; no other format will be accepted
• Save your file as per the following example of naming pattern:
• Group Members Name_P2.pdf
• AMIN SAFAEI_STUDENT NAME2_STUDENT NAME3_P2.PDF
• Upload the source code as per the following example:
• GROUP MEMBERS NAME_P2.c
• AMIN SAFAEI_STUDENT NAME2_STUDENT NAME3_P2.c