1. (Basic functional programming) Assume that the following Maple statements have already
L := [1,2,3,4,5,6,7];
g := x -> (y->x*y);
h := [, [3, 9], [3, 9, 27], [3, 9, 27, 81], [3, 9, 27, 81, 243]];
What is the result of executing the following Maple statements (1 point each):
(b) map(g(a), L);
2. All of the following questions are true/false and worth 1 point each.
(a) Black box testing allows you to look at the code to generate tests.
(b) Coverage testing tells you if every execution path in a routine is tested.
(c) It is possible to have a C function return a function pointer as a return value.
(d) XML is a programming language.
(e) XSL is a programming language.
(f) It is possible to implement a linked-list of bounded length using an array.
(g) A skip list is a variation on a linked-list with a (random) number of forward pointers.
(h) The “relations” that one ﬁnds in a database are diﬀerent than relations in mathe-
3. Name the programming paradigm of each the following languages (1 point each):