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.
Probably the anti virus, so you don't get a virus from downloading the anti spyware program.
Just multiply all numbers to get the total number of bits:
25*50*12 = 15000 bits.
Answer:
Option (D) i.e., synchronous is the correct option to the following question.
Explanation:
The following statement are the synchronous type of training because it is the type of training which is given to students or the persons for the purpose of knowledge in present time and the trainer or that person who give them information they can receive feedback and message at that time and all persons has permission to ask questions with them.
Option C is incorrect because in this type of training the interaction between the trainer and the receiver could not be established.
Option A is incorrect because the classroom-based training only for that person or the students who are available at that time at that place and in this video conferencing is not available.
