Labs Homeworks |
## HW2## HW2 ( Due: Fri Feb 2nd, 11:59:59pm)Q1. (10 points; 5 points per part) Give an algorithm (pseudo code, with explanation) to compute \(2^{2^n}\) in linear time, assuming multiplication of Q2. (10 points total; 5 points per part) Consider the problem of computing N! = 1 · 2 · 3···N. Q3. (10 points; 5 points per part) Find the GCD of 1492 and 1776, using a) the prime factorization method and using Euclid's method, and b) express the GCD as an integer linear combination of the two inputs. |

Page last modified on January 30, 2018, at 12:11 PM