CS 6515 Exam 1 ACTUAL EXAM QUESTIONS WITH
COMPLETE SOLUTION GUIDE (A+ GRADED 100%
VERIFIED) LATEST VERSION 2025!!
Binary Search - ANSWER✔✔-Input: Sorted Array, Start Index, End Index, Target
Output: Index or False
Runtime: O(log n)
Merge Sort - ANSWER✔✔-Input: Array
Output: Sorted Array
Runtime: O(n log n)
FFT - ANSWER✔✔-Input: coefficients a = (a0, ..., an-1), n roots of unity
Output: values for A
Runtime: O(n log n)
PolyMultiply - ANSWER✔✔-Input: coefficients a = (a_0, ... a_n-1), b = (b_0, ..., b_n-1) of
the same size for polynomials A(x) and B(x)
Output: coefficients c = (c_0, ..., c_n-2) for C(x) = A(x)B(x)
COPYRIGHT © 2025 BY OLIVIA GREENWAYS, ALL RIGHTS RESERVED 1
COMPLETE SOLUTION GUIDE (A+ GRADED 100%
VERIFIED) LATEST VERSION 2025!!
Binary Search - ANSWER✔✔-Input: Sorted Array, Start Index, End Index, Target
Output: Index or False
Runtime: O(log n)
Merge Sort - ANSWER✔✔-Input: Array
Output: Sorted Array
Runtime: O(n log n)
FFT - ANSWER✔✔-Input: coefficients a = (a0, ..., an-1), n roots of unity
Output: values for A
Runtime: O(n log n)
PolyMultiply - ANSWER✔✔-Input: coefficients a = (a_0, ... a_n-1), b = (b_0, ..., b_n-1) of
the same size for polynomials A(x) and B(x)
Output: coefficients c = (c_0, ..., c_n-2) for C(x) = A(x)B(x)
COPYRIGHT © 2025 BY OLIVIA GREENWAYS, ALL RIGHTS RESERVED 1
