This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n you obtain above satisﬁes t n ≥ (7 / 2) n for all n ≥ 1. Question 3. Calculate 3 21 using Power , the recursive algorithm for exponentiation we learnt in class. Show all the steps in a tabular form. How many multiplications did you need? Question 4. Calculate 1420351 × 2104632 using the Karatsuba multiplication algorithm. Show all the steps in a tabular form, as in the lecture notes. 1...
View Full Document
This note was uploaded on 09/28/2011 for the course ECE 103 taught by Professor Nayak during the Spring '11 term at Waterloo.
- Spring '11