Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity
Match List I with List II
|
LIST I |
LIST II |
||
|
A. |
Parallel FFT |
I. |
Θ (n2) |
|
B. |
Iterative FFT |
II. |
Θ (n) |
|
C. |
Evaluation of polynomial at n points by Horner method |
III. |
Θ (lg n) |
|
D. |
Product of two polynomials that are represented in point value form |
IV. |
Θ (n lg n) |
Choose the correct answer from the options given below:
1
A - III, B - I, C - II, D - III
2
A - II, B - I, C - III, D - IV
3
A - III, B - IV, C - I, D - II
4
A - II, B - III, C - IV, D - I