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.
Answer:
First Time Unique Visitor
Explanation:
I majored in
Answer:C)Defeated the two most successful human Jeopardy! champions in a three-game match.
Explanation: Watson emerged from the IBM supercomputer made by Thomas Watson .It is made from the two main component analytical software and the artificial intelligence which made it a optimal for the question-answer feature.
Watson defeated Ken Jennings and Brad Rutter(earlier successful contestants) in the program named Jeopardy by answering questions correctly and quickly in 2011.Other options are incorrect because it did not worked as the software engineer,humane genome or won crossword puzzle.Thus the correct option is option (c).
Answer:
String word = "George slew the dragon";
int pos = word.indexOf("dr");
String drWord = word.substring(pos, pos+4);
System.out.println(drWord);
Explanation:
Assuming dr is always there, we don't have to check the validity of 'pos'. Normally, you would!
<em>answer</em><em>=</em><em> </em><em>safari</em><em>,</em><em> </em><em>ms</em><em>-</em><em>word</em><em>,</em><em> </em><em>moviemaker</em><em>,</em><em> </em><em>ms</em><em>-</em><em>pain</em><em>t</em><em>,</em><em> </em><em>firefox</em><em>,</em><em>etc</em><em>.</em><em>.</em><em>.</em>
