Answer:
ok I've got the answer sheet on the picture I will attach
Explanation:
I had to crop to size on my computer and found them all
Answer:
Option(a) i.e "true" is the correct answer for the given question.
Explanation:
The select statement is used for fetching the record in the database. Select is the Data manipulation command. The given query gives all the records where id=5 from the table publisher in the table format.After executing of query the user can verify that the field is updated or not in the table.
So the given statement is "true".
Answer:
weight_pounds=float(input("Enter the weight in pounds:\n"))#taking input of weight.
height_inches=float(input("Enter the height in inches:\n"))#taking input of thye height.
bmi=(weight_pounds/(height_inches**2))*703#calculating the bmi.
print('The body mass index is '+str(bmi))#printing the result.
Ouput:-
Enter the weight in pounds:
207.8
Enter the height in inches
:
72
The body mass index is 28.163395061728398
Explanation:
The above written program is in python.First I have taken input from the user of the weight in pounds then taking input of the height in inches.Then calculating the bmi and storing it in the variable bmi.Then printing the bmi in the end.
Answer:
Give me brainliest thanks
Answer:
O(N!), O(2N), O(N2), O(N), O(logN)
Explanation:
N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.
2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.
Rest of them should be easier.
N² is slower than N and N is slower than logN as you can check in a graphing calculator.
NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.
