CS 1MD3 - Winter 2006 - Assignment #3

Generated for Student ID: 0369864

Due Date: Monday, February 27th

(You are responsible for verifying that your student number is correct!)
The following exercises involve writing very short (but tricky) functions to manipulate data structures. One of them is a recursive function which may be written in only three lines, while the rest may be written in only one line each (and are not recursive). Function signatures (the "def functionName(x,y,z):" lines) are not counted when enumerating the number of lines. So in this context, a "one-line function" actually occupies two lines: the signature on the first line, and the body on the next line.

Note: Not all students get the same number of questions because some questions are more difficult than others. We have tried to make all the assignments of roughly equal difficulty.

Question 1:

Write a recursive function to print the elements of a list in order.

Question 2:

Write a one-line function to chain a list of dictionaries together in the style of function
composition.  For example, if d1 maps x to y, d2 maps y to z, and d3 maps z to w, then
the new dictionary would map x to w (directly).

Question 3:

The graph of a (mathematical) function is the set of all pairs (x,y) such that 
x is in the domain of f (i.e. the set of values over which f is defined), and y = f(x).
Write a one-line Python function, dom, which accepts the graph of a mathematical function 
(i.e. a set of ordered pairs) and returns its domain.