what the answer to this question....
Answer:
Written in Python
G = 6.673 *pow(10,-11)
M = 5.98 *pow(10,24)
d = float(input("Distance: "))
g = (G * M)/(pow(d,2))
print("Acceleration of gravity: "+str(g))
Explanation:
This line initializes the gravititational constant
G = 6.673 *pow(10,-11)
This line initializes the mass of the earth
M = 5.98 *pow(10,24)
This line prompts user for object distance
d = float(input("Distance: "))
This line calculates the object's gravity
g = (G * M)/(pow(d,2))
This line prints the calculated gravity without approximating
print("Acceleration of gravity: "+str(g))
Answer:
Camera or Webcam
Explanation:
Based on the information provided within the question it can be said that in order for all the employees of the company to be able to use face recognition software they would either need a Camera or Webcam. This will scan their face and run the image through a facial recognition database and if it finds a match in their authorized logins it will allow that worker to log on to the computer securely without the need for a user name or password.
This isn’t helpful considering no one knows what type of news letter you want
Answer:
The summary including its given problem is outlined in the following section on the interpretation.
Explanation:
That's not entirely feasible, since at least n similarities have to be made to order n quantities. Find the finest representation where the numbers of 1 to 10 have already been arranged.
⇒ 1 2 3 4 5 6 7 8 9 10
Let's say that we identify one figure as the key then compared it towards the numbers across the left. Whether the correct number is greater, therefore, left number, are doing nothing to switch the location elsewhere.
Because although the numbers have already been categorized 2 has always been compared to 1 which would be perfect, 3 becomes especially in comparison to 2 and so much more. This should essentially take 9 moves, or nearly O(n) moves.
If we switch that little bit already
⇒ 1 3 2 4 5 6 7 8 9 10
3 Is contrasted with 1. 2 will indeed be matched against 3 as well as 2. Since 2 has indeed been exchanged, it must, therefore, be matched with 1 as there might be a case whereby each number z exchanged is greater than the number Y as well as the quantity X < Y.
Only one adjustment expanded the steps which culminated in n+1.