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.
HTTP means Hyper Text Transfer Protocol underlying protocol used by the World Wide Web(www).
usa is the server name which is used address in the DNS record
.gov is the Domain names which are used to identify more then one IP addresses
Agencies/federal.shtml a directory is a collection of file resources also called the resource ID.
Answer:
c. are based on statistical data, measurement and metrics
Explanation:
Data driven process are process that are not based on intuition but rather are based on data. This data serves as evidence to back a decision that is to be taken. It therefore means that, whatever decision that will be taken, such a decision will be based on the data presented.
Answer:
You should install a personal firewall, a program that protects your computer from unauthorized access by blocking certain types of communications.
Explanation:
In computing, a firewall is a network security system that monitors and controls incoming and outgoing network traffic based on predetermined security rules. A firewall typically establishes a barrier between a trusted internal network and untrusted external network, such as the Internet.
The answer is C) tablet. You use the touch screen keyboard for that.
