Question

DI Question 2 1.5 pts Which situations allow the client main() in the file my_program.py to access a method name, say func(), alone, as in x-func) without dereferencing it using prepended name like modname.func or x = some object. func () or x-SomeClass.func() O func) is defined in some module, say, "modname.py" and modname is imported into my_program.py using: from modname import func() is an instance method or a class method in a class, say SomeClass, defined in the same file my program.py, as client, main) O func() is defined in some module, say."modname.py" and modname is imported into my_program.py using: import modname func) is a global scope function defined in the same file my program.py, as client, mainO. D Question 3 1.5 pts In which type of instance methods is it typically necessary to filter bad arguments (either directly or indirectly with the help of validators or mutators) in order to protect private data of your class? A display) (or show()) method, which takes no parameters (other than the self parameter), intended to output the data of the class for the display. A constructor that takes parameters (above and beyond the self parameter). A mutator that takes no parameters (other than the self parameter) from the client, like a reset) or clear), intended to zero-out or assign default values to instance data based on a predetermined behavior. A to_string) or_str_() method, which takes no parameters (other than the self parameter), intended to return some data to the client in the form of a string. A set) method (non-constructor mutator) that takes parameters (above and beyond the self parameter) A get0 method (non-constructor accessor) which takes no parameters (other than the self parameter). DI Question 4 1.5 pts A binary search algorithm is written (as in the modules, for example) which searches a pre-sorted array for some user-defined value, client data. If client data is stored in the array, it returns its array position, and if not found, it returns-1 (again, just like in the modules). Assume the array to be searched has 100 data elements in it. (Check all that apply) NOTE: due to common off-by-one interpretations when counting such things, if your predicted answer is within one (+1 or -1) of a posted option below, you can assume your prediction and the choice you are looking at are equivalent and check that option.] Each recursive call throws away half of the elements it gets. The method gets 100 elements, but if client data is not found in position 49 (first comparison) the method throws 51 of those elements away and calls itself. This inner call now has 49 elements to search. It tests element 24 against client data (second comparison), and if it is not a match, throws away about half again, leaving 24. The next call/comparison, if needed throws away about 12. The next call, if needed, throws away 6. The next call throws away 3. The next call throws away 2. Finally we only have one element to test Each recursive call does one comparison. How many comparisons have we done, give or take one, (count above) in the worst case, assuming we have to go all the way down until we only have one element before we find the data we are searching for? It will always return with an answer in 7 or fewer comparisons of data. It will always return with an answer in 3 or fewer comparisons of data. It may require as many as 99 comparisons of data before it returns. It might return to the client with an answer after only one comparison of data. D Question 5 1.5 pts Consider the following code fragment (assumed to be in an otherwise correct program) class MyClass: shared max -200 def get _max(self): return self.shared_max def set_max(self, new_max): self.shared max new max Assume there are no omitted statements within this fragment you see everything. Check the true statements (may be more than one): The accessor, when invoked, might, in certain situations, cause its self.shared_max to refer to an instance attribute O Both methods, when invoked, will always cause their self.shared max to refer to the static attribute O The mutator, when invoked, will always cause its self.shared_max to refer to an instance attribute. O Both methods, when invoked, will always cause their self.shared_max to refer to an instance attribute. The accessor, when invoked, will always cause its self.shared_max to refer to the static attribute. DI Question 6 1.5 pts Check the true statements about error handling in Python: O type(x)MyType will be False if x is an instance of a proper subclass of MyType. You need a separate trylcatch block for each kind of error you are screening. One try block can be used to handle many different types of errors raised by Python, but will jump to the except block at the first infraction detected (skipping any potential problems in the remainder/below the infraction detected) Range testing ("is x between a and b?" kinds of questions) is best handled using try/except blocks. isinstance(x, MyType) will be False if x is an instance of a proper subclass of MyType.

Answer 1

2. B

func ( ) is an instance method or a class method in a class, say, some class defined in the same file my_program.py,as client,main ( ).

3.C

A mutator that takes no parameters other than the self parameter from the client like reset ( ), or clear ( ). that is intended to zero -out or that can assign the default values to the instant database on the predetermined behavior.

4.D

It might return the client with an answer after only one comparison of the data.

5. A

The accessor, When Invoked, Might, in certain situations, cause itself shared_max to refer to an attribute.

6.C

One try block can be used to handle many different types of errors raised in the python, but they will jump to the except block at the first infraction detected.

That means skipping of any potential problems in the reminder/ below the infraction that is detected.