Algorithm | oop | 代做Python | assignment – EXAMINATIONS CSC148H1F

EXAMINATIONS CSC148H1F

Algorithm | oop | 代做Python | assignment – 这是一个关于Algorithm的题目, 主要考察了关于Algorithm的内容,是一个比较经典的题目, 是有一定代表意义的express/Algorithm/oop/Python等代写方向, 该题目是值得借鉴的assignment代写的题目

``````Faculty of Arts and Science
``````
``````DECEMBER 2017 EXAMINATIONS CSC148H1F
``````

Student Number:

• Please print your name and student number on the front of the exam.
• This examination has 10 questions. There are a total of22 pages, DOUBLE-SIDED.
• You may always write helper functions/methods unless explicitly asked not to.
• Docstrings arenotrequired unless explicitly asked for.
• You must earn a grade ofat least 40% on this exam to pass this course.

Good luck!

Total 80

1.[7 marks] Short answer questions. Point-form is acceptable; you do not need to write a lot for full marks.

``````(a)[1 mark]Suppose we have a function with the following header, and we know it does no input or output:
def mystery(number: int, bunch: tuple(str, float, str)) -> None:
It is impossible to write a body for this function that would make this function useful. Explain why.
``````
``````(b)[2 marks]Heres the beginning of a method inside a classMyClass:
def silly(self, number: int) -> None:
# Some code omitted
this = that + number + self.thing
What must be true when we reach the  assignment statement so that this method runs without raising an error?
``````
``````(c)[4 marks]Consider thisincorrectimplementation of method__getitem__for classLinkedList:
def __getitem__(self, index: int) -> object:
"""Return the item at position <index> in this list.
Raise an IndexError if <index> is out of bounds."""
curr = self._first
curr_index = 0
while curr is not None and curr_index < index:
curr = curr.next
curr_index += 1
``````
``````if curr_index == index:
return curr.item
else:
raise IndexError
What do you know will be true immediately after the while loop?  express it as an executable assertion.
``````
``````Give a doctest example that this method would fail.
``````
``````Describe the problem with this method.
``````

2.[9 marks] Short answer questions. Point-form is acceptable; you do not need to write a lot for full marks.

``````(a)[2 marks]Consider this tree:
``````
``````Suppose we traverse the tree using post-order traversal, and we push each value onto a stack as we go. If we
pop those values out of the stack, write down the items in the order they will come out.
``````
``````(b)[2 marks]Explain the meaning of the termcomposition.
``````
``````Give one example of composition we have used in this course (e.g., from lecture, a lab, exercise, assignment).
``````
``````(c)[2 marks]Explain the meaning of the termabstract class.
``````
``````Give one example of an abstract class we have used in this course (e.g., from lecture, a lab, exercise, assignment).
``````
``````(d)[3 marks]How do we indicate that an instance attribute is private?
``````
``````What restriction on client code does that imply?
``````
``````Give two advantages of making an instance attribute private.
1.
``````
2.

3.[12 marks] Suppose you are working on a replacement for ROSI/ACORN. One small part of it is keeping records about undergraduate and graduate students. They are similar, but have several differences:

• An undergrad needs a grade of at least 50 to earn credit for a course, but a graduate student needs at least 70.
• A grad student has a supervisor, as well as a committee of professors (including the supervisor) who help guide his or her research.
``````The following code (on the left), and its expected output (on the right), demonstrate some features that we need:
``````
``````Code:
``````
``````# Construct two undergrads and a grad student.
# They start out with no courses.
# Jen's supervisor is named Zemel.
s3 = Grad('Jen Campbell', 5555, 'Zemel')
``````
``````# Record that they completed some courses.
s1.complete_course('CSC108', 80)
s1.complete_course('BIO350', 40)
s1.complete_course('BIO350', 90) # Second try.
s3.complete_course('CSC2128', 80)
s3.complete_course('CSC3534', 60)
``````
``````# Give Jen more committee members than just Zemel.
``````
``````# Print everyone's basic info and their average.
# All grades count towards a student's average.
# Paul has completed no courses yet,
# so his average is reported as 0.0.
for s in [s1, s2, s3]:
print(f'{str(s)}:')
print(f' {s.num_credits()} credits and ' +
f'an average of {s.average()}')
# Print Jen's basic info and committee size.
print(f'{str(s3)} has {s3.committee_size()} members')
``````
``````Output:
``````
``````Jacqueline Smith (1234):
2 credits and an average of 70.
Paul Gries (2345):
0 credits and an average of 0.
Jen Campbell (5555):
1 credits and an average of 70.
Jen Campbell (5555) has 4 members
``````
``````On the next two pages, write thedocumentationfor the classes, including their methods, that are necessary for
this code to run and produce the expected output. Your class design should use inheritance effectively to capture
common attributes and methods.
Write excellent docstrings for classes and methods, but do not write doctests.Do not spend time writing any
method bodies, except that if a method should be abstract, clearly mark it as such by raising the appropriate
error in the method body. If a method overrides an inherited method, the docstring in the subclass method does not
need to repeat information from the superclass methods docstring; it should just briefly explain why the method is
being overridden.
Remember to include in each class:
``````
• a class docstring describing instanc attributes and their representation invariants
• type declarations for all attributes
• the header (including type contracts) and docstring for each public method in the class
``````Dont forget: Except for abstract methods,do not spend time writing any method bodies.
``````

4.[5 marks] Short answer questions. Point-form is acceptable; you do not need to write a lot for full marks.

``````(a)[2 marks]Suppose we have a  Python list with 1000 items, and a linked list with 1000 items. We want to
insert a new item at position 500 in each list. Is doing this faster in the Python list, faster in the linked list, or
roughly the same amount of time in each? Circle one:
``````
``````faster in the Python list faster in the linked list roughly the same
``````
``````Explain your answer.
``````
``````(b)[3 marks]Here is a function which copies a list.Hint: It is quite similar to mergesort.
``````
``````def copy(lst: list) -> list:
"""Return a new list with the same elements as <lst>.
``````
``````>>> lst1 = [13, 4, 8, 7, 11, 25]
>>> lst2 = copy(lst1)
>>> lst
[13, 4, 8, 7, 11, 25]
>>> lst2 is lst
False
"""
if len(lst) < 2:
return lst[:]
else:
mid = len(lst) // 2
left = copy(lst[:mid])
right = copy(lst[mid:])
for item in right:
left.append(item)
return left
``````
``````What is the worst-case Big-Oh running time for this algorithm, in terms ofn, the length of the input list?
``````
``````Explain your answer.
``````
``````Why is the  Algorithm used by this implementation ofcopya poor choice for solving the problem?
``````

5.[9 marks] The code below defines and calls a function.

``````def duplicate(matrix: List[List[int]]) -> List[List[int]]:
for item in matrix:
``````
``````if __name__ == '__main__':
m1 = [[1, 2], [3, 4]]
m2 = duplicate(m1)
``````
``````(a)[2 marks]Below, we have drawn the state of memory when we callduplicate(m1), right before the first line
of the function body,answer = [], has been executed. Modify the diagram to show the state of memory after
the function has returned andm2has been initialized. You may show references using arrows, id values, or both.
``````

(b)[2 marks]For each assertion below, circleYesorNo to indicate whether it would succeed if we ran it immediately after the linem2 = duplicate(m1). Explain your answers.

``````assert m1 == m2 Yes No
Explain:
``````
``````assert m1 is m2 Yes No
``````
``````Explain:
``````
``````(c)[2 marks]Suppose that afterm2is initialized, we changem2by running the line of code:
m2[1][1] = 99
For each assertion below, circleYesorNoto indicate whether it would succeed if we ran it immediately after
``````
``````assert m2 == [[1, 2], [3, 99]] Yes No
``````
``````Explain:
``````
``````assert m1 == [[1, 2], [3, 4]] Yes No
``````
``````Explain:
``````

(d)[3 marks]Suppose we callduplicateon an input list of that containsnlists, where each inner list contains mitems. Use Big-Oh notation to describe how long this function takes to run, in terms ofnand/orm. Do not assume anything about the relationship betweennandm.

``````Explain your answer.
``````

6.[11 marks] Consider the following linked list method:

``````class LinkedList:
def bisect(self, i: int) -> LinkedList:
"""Remove from this linked list the nodes at position i and beyond,
and return them in a new linked list.
``````
``````The nodes in the new linked list should be in the same order as they
were in <self>.
``````
``````Raise an IndexError if i < 0 or i >= the length of this linked list.
``````
``````Note: this is a mutating method because it modifies the contents
of <self>.
"""
``````
``````(a)[3 marks]Write two doctests examples for this method, usingstrto display the values of the linked list. The
examples must illustratedifferentcases for the method behaviour. We have started the first doctest for you.
``````
``````Doctest 1
'[1 -> 2 -> 3 -> 4]'
``````
``````Doctest 2:
``````
``````(b)[2 marks]You will need awhilel oop to iterate to thei-th node in the linked list (or to discover thatiis out
of bounds). Suppose we have a counterindexthat begins at 0, and a variablecurrthat begins by referencing
the first node of the linked list.
``````
``````Under what conditions should the loop stop, in terms ofindexandcurr?
``````
``````Under what conditions should the loop continue, in terms ofindexandcurr?
``````

(c)[6 marks]Implement thebisectmethod, including thewhileloop as described above.

``````You may not use anyLinkedListor Nodemethods other than their initializers; you may access all attributes
(public or private) of both theLinkedListand Nodeclasses.
``````
``````def bisect(self, i: int) -> LinkedList:
"""Remove from this linked list the nodes at position i and beyond,
and return them in a new linked list.
``````
``````The nodes in the new linked list should be in the same order as they
were in <self>.
``````
``````Raise an IndexError if i < 0 or i >= the length of this linked list.
``````
``````Note: this is a mutating method because it modifies the contents
of <self>.
"""
``````

7.[5 marks] Recall from Assignment 2 the definition of theBlockclass. Weve provided the full docstring as a reference, but you wont need most of it for this question.

``````class Block:
"""A square block in the Blocky game.
``````
``````=== Public Attributes ===
position:
The (x, y) coordinates of the upper left corner of this Block.
Note that (0, 0) is the top left corner of the window.
size:
The height and width of this Block. Since all blocks are square,
we needn't represent height and width separately.
colour:
If this block is not subdivided, <colour> stores its colour.
Otherwise, <colour> is None and this block's sublocks store their
individual colours.
level:
The level of this block within the overall block structure.
The outermost block, corresponding to the root of the tree,
is at level zero. If a block is at level i, its children are at
level i+1.
max_depth:
The deepest level allowed in the overall block structure.
highlighted:
True iff the user has selected this block for action.
children:
The blocks into which this block is subdivided. The children are
stored in this order: upper-right child, upper-left child,
lower-left child, lower-right child.
parent:
The block that this block is directly within.
``````
``````=== Representation Invariations ===
``````
• len(children) == 0 or len(children) == 4
• If this Block has children,
• their max_depth is the same as that of this Block,
• their size is half that of this Block,
• their level is one greater than that of this Block,
• their position is determined by the position and size of this Block, as defined in the Assignment 2 handout, and
• this Block’s colour is None
• If this Block has no children,
• its colour is not None
• level <= max_depth """ position: Tuple[int, int] size: int colour: Optional[Tuple[int, int, int]] level: int max_depth: int highlighted: bool children: List[‘Block’] parent: Optional[‘Block’]

Implement the newBlockmethodcolourvalidaccording to its docstring. Your solution must be recursive; you may not useanyBlockmethods, but you may access allBlockattributes.

``````def colour_valid(self) -> bool:
"""Return whether this Block and all Blocks contained in this block
satisfy these representation invariants:
``````
• If a Block has children, it has exactly four children and its own colour is None.
• If a Block has no children, its colour is not None.
``````Note: normally we assume that representation invariants are always satisfied.
But the purpose of this method is to write an explicit check for these invariants,
so don't simply write 'return True'.
"""
``````

8.[11 marks] Please refer to the documentation for theBinarySearchTreeclass for this question.

``````(a)[3 marks]Here is the code for theBinarySearchTreemethodheight.
1 def height(self) -> int:
2 """Return the height of this BST.
3 """
4 if self.is_empty():
5 return 0
6 else:
7 return 1 + max(self._left.height(), self._right.height())
``````
``````What would happen if eitherself.leftorself.rightwereNoneat line 7?
``````
``````How do we know that neither of them can beNonewhen we reach this line? Be specific.
``````
``````(b)[2 marks]Suppose we have a binary search tree withnitems and heighth. What is the Big-Oh running time
of this method, in terms ofnand/orh? Be as specific as possible, and explain your reasoning.
``````

(c)[6 marks]TheBinaryTreeclass is the same as theBinarySearchTreeclass, except that its instances do not necessarily satisfy the BST property. You are given the following documentation for the class:

``````class BinaryTree:
# === Private Attributes ===
_root: Optional[object]
_left: Optional['BinaryTree']
_right: Optional['BinaryTree']
``````
``````def is_empty(self) -> bool:
"""Return whether this binary tree is empty."""
``````
``````def min_max(self) -> Tuple[int, int]:
"""Return the minimum and maximum value stored in this binary tree.
The returned tuple contains (min value, max value), in that order.
``````
``````Precondition: this binary tree contains only integers.
"""
``````
``````Implement the followingBinaryTreemethod according to its docstring. You may access allBinaryTreeat-
tributes, but the onlyBinaryTreemethods you may use areisemptyandminmax(assume theyre implemented
``````
``````def is_bst(self) -> bool:
"""Return whether this binary tree is a binary *search* tree.
``````
``````An empty binary tree satisfies the binary search tree property.
"""
``````

9.[6 marks] The followingTreemethod contains multiple errors.

``````class Tree:
def num_at_or_below(self, depth: int) -> int:
"""Return the number of items in this tree at depth >= the given depth.
The tree's root has depth 1.
"""
sum = 0
if depth <= 1:
# Count the root
sum = sum + 1
for subtree in self._subtrees:
# Count the relevant items for each subtree
subtree.num_at_or_below(depth - 1)
return sum
``````
``````(a)[2 marks]For each test case in the table below, write what the methodshould return (according to its
docstring) for the given tree and value ofdepth. Note that we have drawn only the tree structure; the actual
values stored in the tree do not affect the behaviour of this method.
``````
``````Tree Expected result fordepth = 1 Expected result fordepth = 3
Test case 1 Test case 2
empty tree
``````
``````Test case 3 Test case 4
``````
``````Test case 5 Test case 6
``````
``````Test case 7 Test case 8
``````
``````(b)[4 marks]Identify two different code errors in the given implementation ofnumatorbelow, and for each one
explain how it would cause one of the test cases from the previous part to have an incorrectactualresult.
``````
``````Problem 1:
``````
``````Problem 2:
``````

10.[5 marks] At McDonalds, it is possible to buy chicken nuggets (McNuggets) in packs of 4, 6, or 25. Consider the following function, which takes a number and returns whether it is possible to buyexactlythat many chicken nuggets from McDonalds.

``````def buyable(n: int) -> bool:
"""Return whether one can buy exactly <n> McNuggets.
``````
``````It is considered possible to buy exactly 0 McNuggets.
``````
``````Precondition: n >= 0
``````
``````>>> buyable(6)
True
True
False
False
"""
``````
``````(a)[1 mark]Suppose you know that its possible to buy exactly 1231 McNuggets. Is it possible to buy 1235
McNuggets? How do you know?
``````
``````(b)[4 marks]Implement thebuyablefunction. Your solution must be recursive, and you may not write any
helper functions for this question.
``````

List methods

lst = [1, 2, 3] len(lst) # 3 lst[0] # 1 lst[0:2] # [1, 2] lst[0] = ‘howdy’ # lst == [‘howdy’, 2, 3] lst.append(29) # lst == [‘howdy’, 2, 3, 29] lst.pop() # lst == [‘howdy’, 2, 3], returns 29 lst.pop(1) # lst == [‘howdy’, 3], returns 2 lst.insert(1, 100) # lst == [‘howdy’, 100, 3] lst.extend([4, 5]) # lst == [‘howdy’, 100, 3, 4, 5] 3 in lst # returns True

Dictionary methods

d = {‘hi’: 4, ‘bye’: 100} d[‘hi’] # 4 d[100] # raises KeyError! ‘hi’ in d # True 4 in d # False d[‘howdy’] = 15 # adds new key-value pair d[‘hi’] = -100 # changes a key-value pair

Classes

class Point: x: int y: int

``````def __init__(self, x: int, y: int) -> None:
self.x = x
self.y = y
``````
``````def size(self) -> float:
return (self.x ** 2 + self.y ** 2) ** 0.5
``````

p = Point(3, 4) # initializer p.x # attribute access: returns 3 p.size() # method call: returns 5.0

class MyWeirdClass(Point): # inheritance pass

Exceptions

class MyCustomError(Exception): pass

raise MyCustomError

Stack and Queues

``````s = Stack()
s.is_empty()
s.push(10)
s.pop() # Raises an EmptyStackError if the stack is empty.
``````
``````q = Queue()
q.is_empty()
q.enqueue(10)
q.dequeue() # Returns None if the Queue is empty
``````

``````class _Node:
"""A node in a linked list.
``````
``````=== Attributes ===
item: The data stored in this node.
next:
The next node in the list, or None if there are
no more nodes in the list.
"""
item: object
next: Optional['_Node']
``````
``````def __init__(self, item: object) -> None:
"""Initialize a new node storing <item>,
with no 'next' node.
"""
``````
``````class LinkedList:
"""
# === Private Attributes ===
# _first:
# The first node in the linked list,
# or None if the list is empty.
_first: Optional['_Node']
``````
``````def __init__(self, items: list) -> None:
"""Initialize a linked list with the given items.
``````
``````The first node in the linked list contains the
first item in <items>.
"""
``````

class Tree:

The item stored at this tree’s root, or None if the tree is empty.

_root: Optional[object]

The list of all subtrees of this tree.

_subtrees: List[‘Tree’]

``````# === Representation Invariants ===
# - If self._root is None then self._subtrees is an empty list.
# This setting of attributes represents an empty Tree.
# - self._subtrees may be empty when self._root is not None.
# This setting of attributes represents a tree consisting of just one
# node.
``````
``````def __init__(self, root: object, subtrees: List['Tree']) -> None:
"""Initialize a new Tree with the given root value and subtrees.
``````
``````If <root> is None, the tree is empty.
Precondition: if <root> is None, then <subtrees> is empty.
"""
``````
``````def is_empty(self) -> bool:
"""Return True if this tree is empty."""
``````

BinarySearchTree

class BinarySearchTree:

The item stored at the root of the tree, or None if the tree is empty.

_root: Optional[object]

The left subtree, or None if the tree is empty

_left: Optional[‘BinarySearchTree’]

The right subtree, or None if the tree is empty

_right: Optional[‘BinarySearchTree’]

``````# === Representation Invariants ===
# - If _root is None, then so are _left and _right.
# This represents an empty BST.
# - If _root is not None, then _left and _right are BinarySearchTrees.
# - (BST Property) All items in _left are <= _root,
# and all items in _right are >= _root.
``````
``````def __init__(self, root: Optional[object]) -> None:
"""Initialize a new BST with the given root value and no children.
``````
``````If <root> is None, make an empty tree, with subtrees that are None.
If <root> is not None, make a tree with subtrees are empty trees.
"""
``````
``````def is_empty(self) -> bool:
"""Return True if this BST is empty."""
``````
``````Total Pages = 22. Total Marks = 80. Page 22/22
``````