CSC148H1 Winter 2012 Midterm 1 Duration - 50 Minutes Aids Allowed: None

CSC148H1 Winter 2012 Midterm 1
Duration 50 minutes
Aids allowed: none
Student Number:
Lab day, time, room:
Lecture (circle one): L0101 (Paul) L0102 (Velian)
Fill in your name both here and on the back of this test:
Family Name: Given Name:
Do not turn this page until you have received the signal to start.
(Please ll out the identication section above, write your name on the back
of the test, and read the instructions below.)
Good Luck!
This test consists of 3 questions on 10 pages (including this one). When you
receive the signal to start, please make sure that your copy is complete.
Comments and docstrings are not required except where indicated, although
they may help us mark your answers. They may also get you part marks if
you cant gure out how to write the code.
Helper methods and functions are always allowed.
If you use any space for rough work, indicate clearly what you want marked.
# 1: / 8
# 2: /10
# 3: / 8
TOTAL: /26
Total Pages = 10 Page 1 contd. . .
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Downloader ID: 20780
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
CSC148H1 Midterm 1 Winter 2012
Question 1. [8 marks]
Complete the following function without using a loop. You can use len, but no other built-in functions
are allowed.
You are allowed to index into lists, take slices, and call list methods.
You can use % to get the remainder of a division in order to nd out if a number is evenly divisible by
another number.
def multiples(L, v):
(list of ints, int) -> list of ints
Return a list of values from L that are are evenly divisible by v, in
the same order as they appear in L. L is not modified.
Student #: Page 2 of 10 contd. . .
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
You will be writing some functions and methods in this question. Write docstrings indicating the correct
parameter types and return type of every function and method. You do not need to write the rest of the
docstrings: you only need to indicate the various types.
Part (a) [5 marks]
Write a class called Point that represents a 2-D Cartesian point. Point objects should have two instance
variables, x and y, which are set when each object is created. If either of the initial values passed to the
Point class constructor is not an integer, the constructor should raise a TypeError. Point objects should
show up in print statements as follows: (<value for x>, <value for y>). For example, a Point
whose x value is 3 and whose y value is 8 should print as (3, 8).
Your Point class should work with the following testing code:
p = Point(3, 8)
assert p.x == 3
assert p.y == 8
assert %s % p == (3, 8)
try:
q = Point(foo, 4)
assert False
except TypeError:
pass
Write your Point class here:
(Question continued on next page.)
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
Item ID: 6283
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
Item ID: 6283
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
Item ID: 6283
Item ID: 6283
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Assume you are writing a class called Triangle. It has an instance variable vertices, which is a list of
three Point objects. Also assume that you have written a function called length that takes two Point
objects as parameters and returns the length of the line segment that joins them.
Part (b) [3 marks]
Write a method called side_lengths (to go inside your Triangle class) that returns a list of the lengths
of the line segments formed by the Points in the Triangle. Notice that you do not need to write the
whole class; just write the side_lengths method.
Part (c) [2 marks]
A set of three points forms a triangle if and only if the length of the longest side is strictly less than the
sum of the lengths of the other two sides. Use this fact to write a method called is_valid (to go inside
your Triangle class) that returns True if and only if the three Points form a geometrically valid triangle.
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0 Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Part (d) [1 mark]
Write an InvalidTriangleError exception class as simply as you can.
Part (e) [2 marks]
Write a function called perimeter that takes a Triangle as a parameter and returns the sum of the sides
of the Triangle. If the triangle is not a valid triangle, raise an InvalidTriangleError; you do not need
to supply an error message.
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Two functions f and g are mutually recursive if the body of f depends on a call to g and the body of g
depends on a call to f.
Consider this code:
def even(i):
if i == 0:
return True
else:
return odd(i - 1)
def odd(i):
if i == 0:
return False
else:
return even(i - 1)
odd(2)
On the opposite page is a memory model diagram in the style we have used in lecture. The diagram
represents the contents of memory just after odd has been called. The if statement in odd is about to be
executed.
Complete the memory model diagram for the call to odd(2) up until one return statement has fully
executed. This statement will pop the top frame o the call stack; indicate this by drawing a big X
through the frame. As soon as you draw that X, stop tracing.
Create any boxes that you think are needed. (There are no global variables, so we have not shown the
global namespace.)
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
Item ID: 6283
Item ID: 6283
Short Python function/method descriptions:
__builtins__:
len(x) -> integer
Return the length of the list, tuple, dict, or string x.
max(L) -> value
Return the largest value in L.
min(L) -> value
Return the smallest value in L.
open(name[, mode]) -> file object
Open a file. Legal modes are "r" (read), "w" (write), and "a" (append).
range([start], stop, [step]) -> list of integers
Return a list containing the integers starting with start and ending with stop - 1
with step specifying the amount to increment (or decrement). If start is not
specified, the list starts at 0. If step is not specified, the values are incremented
by 1.
raw_input([prompt]) -> string
Read a string from standard input. The trailing newline is stripped.
sum(L) -> number
Returns the sum of the numbers in L.
dict:
D[k] -> value
Return the value associated with the key k in D.
k in d -> boolean
Return True if k is a key in D and False otherwise.
D.get(k) -> value
Return D[k] if k in D, otherwise return None.
D.keys() -> list of keys
Return the keys of D.
D.values() -> list of values
Return the values associated with the keys of D.
D.items() -> list of (key, value) pairs
Return the (key, value) pairs of D, as 2-tuples.
file (also called a "reader"):
F.close()
Close the file.
F.read([size]) -> string
Read and return at most size bytes. If the size argument is negative or omitted, read
until EOF (End of File) is reached.
F.readline([size]) -> string
Return the next line from the file. Retain newline. A non-negative size argument
limits the maximum number of bytes to return (an incomplete line may be returned
then). Return an empty string at EOF.
float:
float(x) -> floating point number
Convert a string or number to a floating point number, if possible.
int:
int(x) -> integer
Convert a string or number to an integer, if possible. A floating point argument will
be truncated towards zero.
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
list:
x in L -> boolean
Return True if x is in L and False otherwise.
L.append(x)
Append x to the end of the list L.
L.index(value) -> integer
Return the lowest index of value in L.
L.insert(index, x)
Insert x at position index.
L.pop()
Remove and return the last item from L.
L.remove(value)
Remove the first occurrence of value from L.
L.reverse()
Reverse *IN PLACE*
L.sort()
Sort the list in ascending order.
Module random:
randint(a, b)
Return random integer in range [a, b], including both end points.
str:
x in s -> boolean
Return True if x is in s and False otherwise.
str(x) -> string
Convert an object into its string representation, if possible.
S.count(sub[, start[, end]]) -> int
Return the number of non-overlapping occurrences of substring sub in string
S[start:end]. Optional arguments start and end are interpreted as in slice notation.
S.find(sub[,i]) -> integer
Return the lowest index in S (starting at S[i], if i is given) where the string sub is
found or -1 if sub does not occur in S.
S.isdigit() -> boolean
Return True if all characters in S are digits and False otherwise.
S.lower() -> string
Return a copy of the string S converted to lowercase.
S.lstrip([chars]) -> string
Return a copy of the string S with leading whitespace removed. If chars is given and
not None, remove characters in chars instead.
S.replace(old, new) -> string
Return a copy of string S with all occurrences of the string old replaced with the
string new.
S.rstrip([chars]) -> string
Return a copy of the string S with trailing whitespace removed. If chars is given and
not None, remove characters in chars instead.
S.split([sep]) -> list of strings
Return a list of the words in S, using string sep as the separator and any whitespace
string if sep is not specified.
S.strip() -> string
Return a copy of S with leading and trailing whitespace removed.
S.upper() -> string
Return a copy of the string S converted to uppercase.
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
Last Name: First Name:
Page 10 of 10 End of Examination
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
Item ID: 6283
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6283
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
I t e m I D : 6 2 8 3
D o w n l o a d e r I D : 2 0 7 8 0
Powered by TCPDF (www.tcpdf.org)

CSC148H1 Winter 2012 Midterm 1 Duration - 50 Minutes Aids Allowed: None

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

CSC148H1 Winter 2012 Midterm 1 Duration - 50 Minutes Aids Allowed: None

Загружено:

Авторское право:

Доступные форматы

CSC148H1 Winter 2012 Midterm 1

Вам также может понравиться