Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

CSC 490 Fall 2006 Homework Assignment: Fast Multiplication - Prof. Gary Locklair, Assignments of Computer Science

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

Pre 2010

Uploaded on 07/23/2009

koofers-user-nge
koofers-user-nge 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
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(n2 + 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(n2 + 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.

Partial preview of the text

Download CSC 490 Fall 2006 Homework Assignment: Fast Multiplication - Prof. Gary Locklair and more Assignments Computer Science in PDF only on Docsity!

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.