QUESTION 2 What is the running-time in Big-Oh notation of the following chunk of code? for (int i-l;i<=n;i++) { for (j-1;j<=i;j++) System.out.printin (i," ",j); O O(n log n) O O(n) O 0(1)

Generate test cases for the following code by using Basic Path Testing. void sort(int a[ ],int N) { int i,j,p,t; } for(i=0;ia[p]) p=j; if(p!=i) {t=a[p]; a[p]=a[i]; a[i]=t; } Draw CFG. How many basic paths for the c) List the basic paths. d) Generate test cases from it.

Write a parallel program for the following code   /* PROGRAM Sieve */ #include <stdlib.h> #include <math.h> #define n 100 boolean Prime[n+1]; int i,num,loc; main( ) { for (i = 1; i <= n; i++) Prime[i] = TRUE; for (num = 2; num <= Sqrt(n); num++) if (Prime[num]) { loc = num + num; while (loc <= n) { Prime[loc] = False; } } loc = loc + num; }

For each of the following function, indicate the class (n) the function belongs (use the simplest g (n) possible in your answer. a) (n² + 5)1⁰ c) 5n+3 + 7+1 b) 4nlog2(n+2)² + (n+2)³log2(n/2) d) 2n + 3n+ n²+ 4n