here range start from 2 and increment by 3 and go upto 13, so 2,5,8,11 is correct
Python O None of the above Question 11 What is the result of evaluating list(range(2,13,3)? O...
what is question 10 and 11?
TT molecular orbitals O result from combining p orbitals that lie on the internuclear axis result from combining p orbitals that perpendicular to the internuclear axis are always antibonding two of the above are always bonding Question 11 (3 points) An aqueous solution of Kl is electrolyzed. The reaction at the anode is O21- (aq) → 12 (g) + 2e- O 2H2O(1) ► 02 (g) + 4H+ (aq) + 4e- 2H20 (1) + 2e-...
What is the answer to this question in python?
Question 17 1 pts The result of a division is an int if the quotient evaluates to a whole number (e.g. 8/2). O True O False
O None of the above. QUESTION 12 The amount of deadweight loss associated with the tax is equal to P3ACP1 ABD. @P2ADP3. PDCP 2. DBC None of the above QUESTION 13 The graph below represents a $10 per unit tax on a good. On the graph o represer
What is the result of evaluating the following Scala code? (1,2,3,4,5,6,7,8,9,10) .map List(4,8,12,16,20) List(2,4,6,8,10,12,14,16,18,20) List(1,2,3,4,5,6,7,8,9,10) List(2,4,6,8,10) List ((x:Int ) -> x*2 ).filter ((x:Int) => (x42) -0)
PYTHON: Im stuck here, big O notation and runtime. What
is it and Why are they those? Please look at the pic, need help as
Im confused. Thank You!
def method3(n): for i in range(n): for j in range(100): for k in range(n): print(i+j+k) What is the runtime (tightest/closest bound in terms of O) for the above python function (method 3)? Please briefly explain. Enter your answer here def method4(n): for i in range(n): for j in range(n, o, -2):...
PYTHON
--------------------------------------------------------
class LinkedList:
def __init__(self):
self.__head = None
self.__tail = None
self.__size = 0
# Return the head element in the list
def getFirst(self):
if self.__size ==
0:
return
None
else:
return
self.__head.element
# Return the last element in the list
def getLast(self):
if self.__size ==
0:
return
None
else:
return
self.__tail.element
# Add an element to the beginning of the
list
def addFirst(self, e):
newNode = Node(e) #
Create a new node
newNode.next =
self.__head # link...
def hash_or_dash(limit): result - for i in range(limit): if i * 2 = @: result # elif i % 3 -- : result - return result print(hash_or_dash(7) #-##-## ##-## none of the above MacBook Pro
Question Completion Status: TUTTI O Recommendation O Graduate Degree O all of the above O none of the above QUESTION 9 The salary discussion should ONLY be negotiable and discussed toward the middle of the interview process. O True O False QUESTION 10 A personal website may be developed by prospective job candidates that includes a resume, industry related volu work experience, educational background, and any special skills you may want to showcase O True O False
A car park management system uses a list to represent which spaces in a car park are currently occupied and which are currently unoccupied. An empty space is represented by a 0 and a full space by a 1. Then the state of the car park would be represented by the following list: [1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0] The designers of the car park management system require a program that will accept a list such as the one above (although of course the length will not always be 11) and calculate what percentage of the spaces are currently occupied, rounded to the nearest percent. In the example above 7 spaces are occupied and there are 11 altogether, so the percentage occupied is: (7 / 11) x 100 = 63.63… = 64% to the nearest whole number. i.What are the admissible inputs of the problem? ii.What is the output of this problem? iii.Write three tests for this problem. The inputs should be different from the example given in the scenario description above. At least one of your tests must be a borderline case. Present the tests in a table, with a column for each input and output, and an extra column with a brief explanation of why you selected each test iv.Decompose the problem into sub-problems. Use the > notation and state in brackets the type of the problem and of each sub-problem v. Choose the patterns for the subproblem types you identified, instantiate the patterns into an algorithm, and translate the algorithm into code.This part of the question involves writing Python code. Write your code in this file and then submit the completed code file as part of the answer to this part of the question. Note: Although Python has a built-in function to find the sum of a list, please do not use it to compute how many 1s there are in the list. We want you to write your own code , because the purpose of this question is to practice following the problem solving approach described there, which will equip you to solve problems in other cases for which there is no built-in Python function. A Python program which is not preceded by a corresponding decomposition will gain at most half marks. Again, the reason for this is that we want you to follow a systematic problem-solving approach and not dive straight into code. Please therefore make sure that you have supplied an answer to iv. If you find it difficult to get the decomposition quite right at first there is no reason why you cannot review it when you have written the code. The main thing is to have a clear idea of what the solution needs to do (the decomposition) that ties in correctly with how it does it (the program). Make sure you use appropriate variable names and comments and that you have tested your code with the inputs of your test table. (Keep each of your test inputs in your code, but precede all of the test inputs, except for one, with the # symbol. Recall that # signals a comment, which is ignored by the Python interpreter.)
Question 9 What is the range for this stemplot 78 6 7 8 9 10 11 12 13 36 0222445555677789999 000001123444455667778889 0111122222334455566667788999 0233334455568889 0012557 02 0 48 O 57 O 65 O 86 О 99