Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Next revision
Previous revision
cs-312:hw4 [2014/12/31 15:55]
ringger created
cs-312:hw4 [2015/01/16 13:15] (current)
ringger [Questions 3-7]
Line 11: Line 11:
 Problem 1.27 in the textbook. Problem 1.27 in the textbook.
  
-Use the [http://​faculty.cs.byu.edu/​~ringger/​CS312/​readings/​ExtendedEuclidExample.pdf Extended Euclid algorithm] to find the secret key <​math>​d</​math>​.  Be sure to decrypt your message also to verify that everything is working.+Use the [http://​faculty.cs.byu.edu/​~ringger/​CS312/​readings/​ExtendedEuclidExample.pdf Extended Euclid algorithm] to find the secret key $d$.  Be sure to decrypt your message also to verify that everything is working.
  
 === Question 2=== === Question 2===
  
-In the textbook 2.1 (down to two-bit numbers; i.e., threshhold = 2)+In the textbook: exercise ​2.1 (Karatsuba divide and conquer multiplication). 
 +* You may use the threshhold value of 2.  i.e., stop recursing when the arguments ​to multiple are both two-bit numbers. 
 +* Tip: to make running the Karatsuba divide and conquer multiplication algorithm more straightforwardyou may 0-pad (on the leftthe function'​s arguments so that both arguments are always of even length.
  
 === Questions 3-7 === === Questions 3-7 ===
  
-Exercises 2.5(a-e) in the textbook: find asymptotic bounds using only the Master Theorem ​-- Big-O is sufficient.+Exercises 2.5(a-e) in the textbook: find asymptotic ​Big-O bounds using only the Master Theorem.
  
cs-312/hw4.1420066505.txt.gz · Last modified: 2014/12/31 15:55 by ringger
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0