The answer is A) Double.
The return type is specified before the method's signature, and the signature is composed of the the method's name and parameters.
In this case, the method is named mynewFunction, takes in an integer as a parameter, and returns a double.
Also, fun fact which is kind of unrelated: if two or more methods have the same name, they can have different functionality as long as their signature is different (different parameter types).
Find and replace is the answer
Answer:
import math
angle = float(input('Enter Angle: '))
shadowLength = float5(input('Enter Shadow Length: '))
tree_height = math.tan(angle)*shadowLength
print('Tree Height = {}'.format(tree_height))
Explanation:
From the equation given, the first step is to derive the equation for calculating the Tree Height.
In order to calculate the tangent of an angle, the math module has to be imported. math module allows the program to perform advanced math operations.
The program then prompts the user to input values for angle and shadow length.
The inputted values are converted to floats and used in the equation that was derived for Tree height.
Three height is evaluated and the result is printed to the screen
A string parameter and returns new string with all the letters of the alphabet that are not in the argument string. The letters in the returned string should be in alphabetical order. The implementation should uses a histogram from the histogram function
Explanation:
The below code is written in python :
alphabet = "abcdefghijklmnopqrstuvwxyz"
test_dups = ["zzz","dog","bookkeeper","subdermatoglyphic","subdermatoglyphics"]
test_miss = ["zzz","subdermatoglyphic","the quick brown fox jumps over the lazy dog"]
def histogram(s):
d = dict()
for c in s:
if c not in d:
d[c] = 1
else:
d[c] += 1
return d
def has_duplicates(s):
for v in histogram(s).values():
if v > 1:
return True
return False
def test_dups_loop():
for s in test_dups:
print(s + ':', has_duplicates(s))
def missing_letters(s):
r = list('abcdefghijklmnopqrstuvwxyz')
s = s.lower()
for c in s.lower():
if c in r:
r.remove(c) # the first matching instance
return ''.join(r)
def test_miss_loop():
for s in test_miss:
print(s + ':', missing_letters(s))
def main():
test_dups_loop()
test_miss_loop()
if __name__ == '__main__':
main()