MATH 2220 Final: MATH 2220 Cornell Final Exam
Document Summary
11 march 2004: true/false [10 pts] (parts a e; 4 points off for each wrong answer, 2 points off for each blank answer, minimum problem score 0. ) a. b. c. d. e. In a data abstraction, a given abstract value may be represented by more than one concrete value. In sml, unbound variables are always detected at compile time. Polymorphism is the language feature that provides recursive datatypes. Black-box test cases are written without reading the implementation that is being tested: speci cations [20 pts] (parts a e) Consider the following speci cations and code for functions named f of type int*int->int: (a) (* f(x,y) = x + 1. * requires: x >= 0 *) (b) (* f(x,y) >= 0. * requires: x >= 0 & y >= 0 *) (c) (* f(x,y) = x + y. * requires: x >= 0 & y >= 0 *) (d) (* f(x,y) >= 0.
