This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Problem Set 1 Due: Feb 2 cs2me3 Winter 2007 Instructions 1. You are encouraged to work in groups of two. If you cannot find a partner, you can work alone. 2. Please submit one copy of the assignment; if you are working with a partner, both names should appear on the assignment. 3. For Part A of the assignment, you must submit an electronic copy of your Java appli cation via WebCT (by the time of the lecture on the due date of the assignment). Part A Write a Java application which implements the extended Euclid algorithm for computing the greatest common divisor of two numbers. Your program, call it euclid , should take two integers as command line input, i.e., euclid m n , and output x y , such that x m + y n = gcd( m,n ). Part B 1. Consider the version of the stable matching problem where b s and g s may be indifferent between certain options. That is, each b and each g has a ranking of the members of the opposite group where besides < (indicating preference) there may be = (indicating...
View Full
Document
 Spring '08
 Pearly

Click to edit the document details