
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
A computer science homework assignment from csc 490 – computer science senior seminar i, taught by professor gary locklair, for the fall 2006 semester. The assignment focuses on understanding the time complexity of standard multiplication and applying the karatsuba fast multiplication technique to multiply two numbers in o(nlog3) time.
Typology: Assignments
1 / 1
This page cannot be seen from the preview
Don't miss anything!
CSC 490 – Computer Science Senior Seminar I Professor Gary Locklair Written Homework Assignment #5 Fall 2006 Chapter 25 in The New Turing Omnibus – Fast Multiplication a) Explain why standard multiplication is O(n^2 + 2n – 1). That is, show where each term in the Big O comes from. [5] b) Using the Karatsuba fast multiplication technique, demonstrate the multiplication of 10 * 11 in O(nlog3) [10] Please word process parts A and B. Assignment is worth 15 points. CSC 490 – Computer Science Senior Seminar I Professor Gary Locklair Written Homework Assignment #5 Fall 2006 Chapter 25 in The New Turing Omnibus – Fast Multiplication a) Explain why standard multiplication is O(n^2 + 2n – 1). That is, show where each term in the Big O comes from. [5] b) Using the Karatsuba fast multiplication technique, demonstrate the multiplication of 10 * 11 in O(nlog3) [10] Please word process parts A and B. Assignment is worth 15 points.