+1 123 456 7890 instantessays65@gmail.com

(answered) – 1) Show the following (make sure you show all the steps). a)n^3

$11.00

(answered) – 1) Show the following (make sure you show all the steps). a)n^3DescriptionSolution downloadThe Question1) Show the following (make sure you show all the steps).a)n^3 ? 2n + log2n ?belong Omega(n2)b)4n + 2n+log2n ?belong Theta(n log2 n)c)7log2n^2 belong O(log2 n)2)Sort the sequence of integers { 2 ,5 ,4 , 6 , 3, 7, 8, 1} (show steps, do not write code)Usinga)Heapsortb) MergeSort3)Sort the same sequence as question 2 using Quicksort.4)The following algorithm finds the maximum and minimum element of an array (a[ ]).void MaxMin (int a[ ], int n, int max, int min){int maxm, minm;maxm=minm=a[0];for (int j=1; j {if (a[j] > maxm)maxm = a[j];if (a[j] minm = a[j];}max = maxm; min=minm;}a)Find the Worst and Average cases in term of the basic operations (comparison of two elements).b)Find the order and the worst and average cases.5)Solve the following recurrence relation in terms of n assuming n=2kW(n) = 2 W(n/2) + n/2W(1)=06)Define the following Graph Theoric termsa)A Graph=(V,E)b)A Subgraph G?=(V?,E?) of a graph G=(V,E)c)A tree T=(V,E).1) Show the following (make sure you show all the steps).1) n3 ? 2n + log2 n (n2)2) 4n + 2n log2 n (n log2 n)3) 7log2 n2 O(log2 n)2) Sort the sequence of integers { 2 ,5 ,4 , 6 , 3, 7, 8, 1} (show steps, do not write code)Using4) Heapsort5) MergeSort3) Sort the same sequence as question 2 using Quicksort.4) The following algorithm finds the maximum and minimum element of an array (a[ ]).void MaxMin (int a[ ], int n, int max, int min){int maxm, minm;maxm=minm=a[0];for (int j=1; j < n; j++){if (a[j] > maxm)maxm = a[j];if (a[j] < minm)minm = a[j];}max = maxm; min=minm;}6) Find the Worst and Average cases in term of the basic operations (comparison of two elements).7) Find the order and the worst and average cases.5) Solve the following recurrence relation in terms of n assuming n=2kW(n) = 2 W(n/2) + n/2W(1)=06) Define the following Graph Theoric terms8) A Graph=(V,E)9) A Subgraph G?=(V?,E?) of a graph G=(V,E)10) A tree T=(V,E).

Reviews

There are no reviews yet.

Be the first to review “(answered) – 1) Show the following (make sure you show all the steps). a)n^3”

Your email address will not be published. Required fields are marked *