The code of five digits is of the form:
A B C D F
Where A (the first digit) may be any of 9 digits (because 0 is excluded)
B, C, and D, may be each any of 10 digits (0 - 9)
F (the last digit) may be 0, 2, 4, 6 or 8, i.e. 5 different digits.
So the number of different available codes is:
9 * 10 * 10 * 10 * 5 = 45,000.
Answer: 45,000
Yes you should install drives first
Answer:
open the header. hope this helps
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.
Ask them what's ur name and get to the know them i have nothing really.
