# practice_quiz2_f16_answers.txt - 1.1 F 1.2 T 1.3 F 1.4 F...

• Test Prep
• 2

This preview shows 1 out of 2 pages.

1.1 F 1.2 T 1.3 F 1.4 F 1.5 T 1.6 F 1.7 T 1.8 F 1.9 T 1.10 T 2.1 C 2.2 B 2.3 D 3.1 A. No B. No C. Yes D. Yes 3.2 A. No B. No C. Yes D. No 3.3 A. No B. No C. No D. No 3.4 A. No B. No C. No D. No 4.1 (3 points) D 4.2 (4 points) We have three recursive calls on polynomials of degree-bound $n/2$. There are a constant number of arrays, each of size $\Theta(n)$, which are traversed in order, and hence the number of cache misses to access them is $\Theta(n/\mathcal{B})$. 4.3 (4 points) All the arrays used by the algorithm have $\Theta(n)$ elements. When $n$ is sufficiently small so that all these arrays fit into cache, we have $n\le c\mathcal{M}$. Since the \code{for} loops run through each array in

Subscribe to view the full document.

You've reached the end of this preview.
• Spring '05
• Wen
• UCI race classifications, Tour de Georgia, Union Cycliste Internationale

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern