JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.
COMP 251: Divide-and-Conquer (3)
Anonymous quizz on Lecture 17 on Divide-and-Conquer
Sign in to Google
to save your progress.
Learn more
Matrix multiplication
The reccurence for the running time of the Strassen's algorithm is T(n)=7*T(n/2)+\Tetha(n^2). Which assertions are true?
The size of the sub-problems is divided by 7 after each recursive call.
The cost for combining solution is \Omega(n)
At each round, the algorithm makes 7 recursive calls.
The cost for combining solution is O(n)
The height of the recursive tree is at most log_2(n) recursive calls
Fast Fourier Transform
Which assertions are true about the Fast Fourier Transform (FFT) ?
The FFT algorithm evaluates a degree n-1 polynomial at each of the n-th roots of unity
The running time of the FFT is \Tetha(n^2)
The Discrete Fourier Transform calculates the point-value representation of a polynomial described with its coefficients.
The FFT divide one polynomial of degree n in two polynomial of degrees < n/2
Comments
Enter here any comment/question you would like to make/ask about the material covered in this lecture.
Your answer
Pace of the lecture
On a scale from 1 to 5, indicate your perception of the pace of this lecture. A score of 1 means "very slow", 2 means "slow", 3 means "OK", 4 means "fast", and 5 means "very fast".
1
2
3
4
5
Clear selection
Submit
Clear form
Never submit passwords through Google Forms.
This content is neither created nor endorsed by Google.
Report Abuse
-
Terms of Service
-
Privacy Policy
Forms
