CSC148 Tt2am 2012W

CSC148H1 Winter 2012 Midterm 2
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 4 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: /12
# 2: / 5
# 3: / 8
# 4: / 8
TOTAL: /33
Total Pages = 10 Page 1 contd. . .
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Downloader ID: 20780
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
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 5
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
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 5
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 5
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
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 5
Item ID: 6285
I t e m I D : 6 2 8 5
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 5
I t e m I D : 6 2 8 5
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 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
Item ID: 6285
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 5
Item ID: 6285
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 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
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 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
CSC148H1 Midterm 2 Winter 2012
Question 1. [12 marks]
In this question you will draw trees. We dont want you to draw a memory model; just circles with values
inside them and lines connecting them like weve been doing in lecture and like you see in parts (b) and
(d).
Part (a) [3 marks]
This subquestion is about binary search trees. Draw the tree that results from inserting the following
values in order:
2 6 4 3 5 1 9
Part (b) [3 marks]
This subquestion is about binary search trees. In the blank space on the right, draw the tree that results
from deleting the root value from the following tree, where we replace a deleted value with the smallest
value from the right subtree:
Student #: Page 2 of 10 contd. . .
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
Item ID: 6285
Item ID: 6285
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 5
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
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 5
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Part (c) [3 marks]
This subquestion is about min heaps. Draw the tree that results from inserting the following values in
order into a min heap.
2 6 4 3 5 1 9
Part (d) [3 marks]
This subquestion is about max heaps. In the blank space on the right, draw the tree that results from
deleting the root value from this tree:
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 5
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
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 5
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 5
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
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 5
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
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 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
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 5
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
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 5
I t e m I D : 6 2 8 5
Item ID: 6285
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 5
Item ID: 6285
Item ID: 6285
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 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
A le storing the pre-order, post-order and in-order traversals of a binary tree has been corrupted and
most values have been lost. Below, these lost values are replaced with the letter x. Draw the binary
tree that produced the le. (If you think more than one tree matches these traversals, you can draw any
of them.)
pre-order: x, 9, 2, 12, x, 5, x
post-order: x, x, 7, x, 1, x, 6
in-order: 2, x, 9, 7, 6, 1, x
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 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
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 5
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 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
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 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
Item ID: 6285
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
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 5
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 5
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
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 5
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 5
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
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 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
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 5
We have worked extensively with binary trees. This question is about trees with an arbitrary branching
factor.
Part (a) [3 marks]
Write a Node class that allows any number of children. Write only the class header and an __init__
method that sets up any instance variables.
Part (b) [5 marks]
Write a function that prints the values in a tree with an arbitrary branching factor using a preorder
traversal. The tree is made from instances of your Node class from the previous subquestion. You can
directly access any instance variables that you need.
I t e m I D : 6 2 8 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
Item ID: 6285
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 5
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 5
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 5
Item ID: 6285
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
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 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
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 5
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 5
Item ID: 6285
Two trees are mirrors of each other if they have the same contents but the left and right children are
swapped throughout. For example, these two trees are mirrors of each other:
1 1
/ \ / \
2 3 3 2
/ / \ / \ \
4 5 6 6 5 4
Complete the following function
1
.
def are_mirrors(root1, root2):
(Node, Node) -> bool
Return whether the trees rooted at root1 and root2 are mirrors of each other.
1
If you have extra time and want a fun challenge, try doing it using only a single return statement and no ifs or loops.
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
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 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
Item ID: 6285
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 5
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 5
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
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 5
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 5
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Item ID: 6285
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Use this page for rough work and for answers that didnt t elsewhere.
I t e m I D : 6 2 8 5
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
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 5
Item ID: 6285
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Item ID: 6285
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
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.
I t e m I D : 6 2 8 5
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 5
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
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 5
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
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 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
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 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
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.
Item ID: 6285
Downloader ID: 20780 I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
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 5
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
Item ID: 6285
Item ID: 6285
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 5
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
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 5
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
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 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
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 5
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 5
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
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 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Last Name: First Name:
Page 10 of 10 End of Examination
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
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 5
I t e m I D : 6 2 8 5
Item ID: 6285
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Item ID: 6285
Item ID: 6285
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
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 5
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
Item ID: 6285
Item ID: 6285
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
I t e m I D : 6 2 8 5
Item ID: 6285
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
Item ID: 6285
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 5
Item ID: 6285
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 5
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
Item ID: 6285
D o w n l o a d e r I D : 2 0 7 8 0
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
I t e m I D : 6 2 8 5
Item ID: 6285
Item ID: 6285
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 5
I t e m I D : 6 2 8 5
Powered by TCPDF (www.tcpdf.org)

CSC148 Tt2am 2012W

Загружено:

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

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

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

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

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

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

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

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

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

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

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

CSC148 Tt2am 2012W

Загружено:

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

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

CSC148H1 Winter 2012 Midterm 2

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