Q.1) What it the Bog O of the following equation?<\/p>\n
\u00a0 \u00a0 \u00a0\u00a010n3\u00a0+ 24n2\u00a0+ 3n log n + 144<\/p>\n
O(n^3)<\/p>\n
O(10n^3)<\/p>\n
O(n^2)<\/p>\n
O(n)<\/p>\n
Q.2) What it the Bog O of the following equation?<\/p>\n
\u00a0 \u00a0 \u00a0\u00a0\u00a0 \u00a0 n2\u00a0+ n log n + 50<\/p>\n
\u00a0<\/p>\n
Group of answer choices<\/p>\n
O(n)<\/p>\n
O(n^2)<\/p>\n
O(log n^2)<\/p>\n
Q.3) What it the Bog O of the following equation?<\/p>\n
\u00a0 \u00a0 \u00a05 log2n + 15 log n<\/p>\n
O(n)<\/p>\n
O(log n)<\/p>\n
O(1)<\/p>\n
Q.4) Exponential identity:<\/p>\n
\u00a0\u00a0\u00a0 \u00a0 \u00a0 \u00a0(ab)n\u00a0= an\u00a0+ bn<\/p>\n
True<\/p>\n
False<\/p>\n
Q.5) Match the following Big O notation with their respective operation.<\/p>\n
\u00a0<\/p>\n
O(1)<\/p>\n
\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0<\/p>\n
O(log n)<\/p>\n
\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0<\/p>\n
O(n)<\/p>\n
\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0<\/p>\n
O(n^2)<\/p>\n
\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0<\/p>\n
Q.6) What is the Big-O of the code snippet below?<\/p>\n
\u00a0<\/p>\n
\u00a0 \u00a0 \u00a0#include
\u00a0 \u00a0 \u00a0int main()
\u00a0 \u00a0 \u00a0{
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0printf(“Hello World”);
\u00a0 \u00a0 \u00a0}<\/p>\n
\u00a0<\/p>\n
Group of answer choices<\/p>\n
O(Cn)<\/p>\n
O(n)<\/p>\n
O(1)<\/p>\n
O(n^2)<\/p>\n
Q.7) What is n in the pseudocode below? What is the Big-O?<\/p>\n
\u00a0<\/p>\n
Pseudocode:<\/p>\n
\u00a0 \u00a0 list_Sum(A,n) {\u00a0 \u00a0 \u00a0 \u00a0 \u00a0\u00a0<\/p>\n
\u00a0 \u00a0 total =0\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0<\/p>\n
\u00a0 \u00a0 n = 8000\u00a0\u00a0<\/p>\n
\u00a0 for i=0 to n-1\u00a0 \u00a0 \u00a0 \u00a0<\/p>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0sum = sum + A[i]\u00a0<\/p>\n
\u00a0 \u00a0 return sum\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\u00a0<\/p>\n
\u00a0 \u00a0 }\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/p>\n
Group of answer choices<\/p>\n
n; O(1)<\/p>\n
8000; O(A,i)<\/p>\n
8000; O(n)<\/p>\n
8000; O(n^2)<\/p>\n
Q.8 ) Exponential identity:<\/p>\n
\u00a0 \u00a0 \u00a0aman\u00a0= amn\u00a0<\/p>\n
\u00a0<\/p>\n
Group of answer choices<\/p>\n
True<\/p>\n
False<\/p>\n
Q.9) Logarithm identity:<\/p>\n
\u00a0\u00a0\u00a0 \u00a0 \u00a0 logb\u00a0M + logb\u00a0N = logb\u00a0(M\/N)<\/p>\n
\u00a0<\/p>\n
Group of answer choices<\/p>\n
True<\/p>\n
False<\/p>\n
Q.10) Say your and your coworkers write an algorithm that takes in an array of numbers and returns the highest one, select the the\u00a0three (3) best analysis\u00a0below that describes your algorithm.<\/p>\n
\u00a0<\/p>\n
Group of answer choices<\/p>\n
The absolute slowest it can run is Linear time \u2013 O(n)<\/p>\n
The absolute fastest it can run in Quadratic time \u2013 \u03a9(n^2)<\/p>\n
The absolute fastest it can run is Linear time \u2013 \u03a9(n)<\/p>\n
The absolute slowest it can run is constant time time \u2013 O(c)<\/p>\n
This algorithm be tightly asymptotically bound \u2013 so we can also say it\u2019s \u0398(n)<\/p>\n
Q.11) Match the analysis for Mileage problem:<\/p>\n
\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 How much gas does it take to go 200 miles?<\/p>\n
\u00a0<\/p>\n
Group of answer choices<\/p>\n
Straight, downhill, wind at your back<\/p>\n
\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0<\/p>\n
\u201cAverage\u201d terrain<\/p>\n
\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0<\/p>\n
Winding, uphill, gravel road, inclement weather<\/p>\n
\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0<\/p>\n
\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0\u00a0 \u00a0<\/p>\n
Q.12) Divide and Conquer\u00a0<\/p>\n
Divide \u00a0==> \u00a0solve the problem recursively.<\/p>\n
Conquer ==> \u00a0put the problem into a number of sub-problems.<\/p>\n
Combine ==> put the problem into one solution to give a solution to the original problem.<\/p>\n
\u00a0<\/p>\n
Group of answer choices<\/p>\n
True<\/p>\n
False<\/p>\n
Q.13) Heap Sort:<\/p>\n
Build the initial heap from the following array<\/p>\n
[10,\u00a0 16,\u00a0 54,\u00a0 17,\u00a0 19,\u00a0 65,\u00a0 31]<\/p>\n
\u00a0<\/p>\n
Note: minimum 300 words.<\/p>\n
Q.14) Heap Sort – max heap:<\/p>\n
Build the initial heap from the following array<\/p>\n
[10,\u00a0 16,\u00a0 54,\u00a0 17,\u00a0 19,\u00a0 65,\u00a0 31]<\/p>\n
a. Show (draw) the max heap with the INITIAL max value<\/p>\n
a. Show (draw) the max heap AFTER the FIRST max value is removed<\/p>\n
b. Show (draw) the max heap AFTER the SECOND max value has been removed<\/p>\n
Note: minimum 300 words<\/p>\n
Q.15) what is the\u00a0Worst case\u00a0time complexity of quicksort?<\/p>\n
Group of answer choices<\/p>\n
O(n log n)<\/p>\n
O(n^2)<\/p>\n
O(n)<\/p>\n
Q.16) In Quick sort, the pivot can be any value within the array being sorted, commonly the value of the middle array element.<\/p>\n
\u00a0<\/p>\n
\u00a0<\/p>\n
Group of answer choices<\/p>\n
True<\/p>\n
False<\/p>\n
Q,17) MERGE SORT:<\/p>\n
Draw a diagram showing the merge sort of the following array.<\/p>\n
\u00a0[5 2 4 7 1 3 2 6]<\/p>\n
Q.18) In heap sort – Max heap parents are larger\/higher in value that the children<\/p>\n
In heap sort – Min heap children are larger\/higher in value than the parent<\/p>\n
In quick sort – The parents are larger\/higher in value that the children<\/p>\n
\u00a0<\/p>\n
Group of answer choices<\/p>\n
True<\/p>\n
False<\/p>\n
Q.19) RESEARCH QUESTION:<\/p>\n
Solving the traveling salesman problem via brute-force search.<\/p>\n
1. Explain the traveling salesman problem<\/p>\n
2. Find an C++, or Python algorithm to solve the salesman problem (list information with an example)<\/p>\n
3. What is the Big O?<\/p>\n
\u00a0<\/p>\n
**Please pay attention to details.<\/p>\n
**Not the number of points<\/p>\n
Note: Minimum 500 words.<\/p>\n","protected":false},"excerpt":{"rendered":"
Q.1) What it the Bog O of the following equation? \u00a0 \u00a0 \u00a0\u00a010n3\u00a0+ 24n2\u00a0+ 3n log n + 144 O(n^3) O(10n^3) O(n^2) O(n) Q.2) What it the Bog O of the following equation? \u00a0 \u00a0 \u00a0\u00a0\u00a0 \u00a0 n2\u00a0+ n log n + 50 \u00a0 Group of answer choices O(n) O(n^2) O(log n^2) Q.3) What it […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[10],"class_list":["post-78373","post","type-post","status-publish","format-standard","hentry","category-research-paper-writing","tag-writing"],"_links":{"self":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts\/78373","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/comments?post=78373"}],"version-history":[{"count":0,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts\/78373\/revisions"}],"wp:attachment":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/media?parent=78373"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/categories?post=78373"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/tags?post=78373"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}