Question

Q1: Write an algorithm to compute the sum of n Cube numbers. Also Compute the Complexity of the Algorithm. (2.5 Marks) Q2: List the Five application of Linear and Non Linear Data Structures. (2.5 Marks) Q3: Order the following functions by asymptotic growth rate. (1 Mark) $n^2+2n$, $2^{10}$, $2^n$, $n^3$ $3n+ 100\log n$, $n!$, $2^n$ $n^4+10n$, $n^3$, $n^2\log n$, $n^5$ Q4: Using Big-Oh Notation; Justify that the asymptotic growth rate of function f(n) =10n$^5$+4n$^3$+8n$^2$ +40n+10 is O(n$^5$) (1 Mark) Q5: Give a big-Oh characterization, in terms of n, of the running time of the following code. public static int example3(int[] arr) { int n = arr.length, total = 0; for (int j=0; j < m; j++) for (int k=0; k <= n; k++) total =j*k; return total; } (1 Mark)

          Q1: Write an algorithm to compute the sum of n Cube numbers. Also Compute the
Complexity of the Algorithm.
(2.5 Marks)
Q2: List the Five application of Linear and Non Linear Data Structures. (2.5 Marks)
Q3: Order the following functions by asymptotic growth rate.
(1 Mark)
$n^2+2n$, $2^{10}$, $2^n$, $n^3$
$3n+ 100\log n$, $n!$, $2^n$
$n^4+10n$, $n^3$, $n^2\log n$, $n^5$
Q4: Using Big-Oh Notation; Justify that the asymptotic growth rate of function
f(n) =10n$^5$+4n$^3$+8n$^2$ +40n+10 is O(n$^5$)
(1 Mark)
Q5: Give a big-Oh characterization, in terms of n, of the running time of the
following code.
public static int example3(int[] arr)
{
int n = arr.length, total = 0;
for (int j=0; j < m; j++)
for (int k=0; k <= n; k++)
total =j*k;
return total;
}
(1 Mark)

Q1: Write an algorithm to compute the sum of n Cube numbers. Also Compute the
Complexity of the Algorithm.
(2.5 Marks)
Q2: List the Five application of Linear and Non Linear Data Structures. (2.5 Marks)
Q3: Order the following functions by asymptotic growth rate.
(1 Mark)
n^2+2n, 2^10, 2^n, n^3
3n+ 100log n, n!, 2^n
n^4+10n, n^3, n^2log n, n^5
Q4: Using Big-Oh Notation; Justify that the asymptotic growth rate of function
f(n) =10n^5+4n^3+8n^2 +40n+10 is O(n^5)
(1 Mark)
Q5: Give a big-Oh characterization, in terms of n, of the running time of the
following code.
public static int example3(int[] arr)

int n = arr.length, total = 0;
for (int j=0; j < m; j++)
for (int k=0; k <= n; k++)
total =j*k;
return total;

(1 Mark)

Added by Samuel S.

Question

Please give Ace some feedback