Question

17. Your job is to choose a data s 17x 4x30x2 6x12x tructure to implement polynomials whose coefficients are positive integers, such as Here are three possible implementations. As a two-dimensional array boolean values: coeff [cl ti1 is true if and only if c x is a tem of the polynomial. As a tree map with Integer keys and values. If c * x? is a term of the polynomial, then we added the following correspondence to the map: coeff.put (new Integer (i), new Integer (c) III. As a hash set of objects of type public class Termi //based on power public int hashcode (t... public Boolean equals (Object obj)... private int coefficient; //based on power private int power;

Answer 1

option D is false beacuse hashcode() can be easily overridden for any type of object or reference. For this implementation we can use degree and coefficient of a term to generate a hashcode for a particular method.