What is the complexity of this algorithm? Algorithm Sum (a,n) { s := 0.0; for i := 1 to n do s := s + a [i]; return s;

What is the complexity of this algorithm? Algorithm Sum (a,n) { s :

1.	What is the complexity of this algorithm? Algorithm Sum (a,n) { s := 0.0; for i := 1 to n do s := s + a [i]; return s;
A.	log2n
B.	O(n)
C.	O(n log n)
D.	O(kn)
Answer» C. O(n log n)

Discussion

No Comment Found

Related MCQs

What is the complexity of this algorithm? Algorithm Sum (a,n) { s := 0.0; for i := 1 to n do s := s + a [i]; return s;
Assume that the Point class is existing with the following snippet in the header file Point.h: class Point { Point(); Pont(int, int); int GetX(); int GetY(); void SetX(int); void SetY(int); }; If the objects of Point are created as Point oPointOne, oPointTwo(2,3); Which of the following statements are correct? (i)The statement oPointOne.SetX(20); Will compile and run successfully. (ii) The statement oPointOne.SetX(20).SetY(30); Will compile successfully but will give a run time error.
What will be output of following program? #include int main() { int huge *a =(int huge *)0x59990005; int huge *b =(int huge *)0x59980015; if(a == b) printf("power of pointer"); else printf("power of c"); return 0; }
Predict the output of following C++ program. #include  using namespace std; class abc { static int x; public: abc() { x++;} static int getX() {return x;} }; int Test::x = 0; int main() { cout << abc::getX() << " "; abc t[5]; cout << abc::getX(); }
Which of the following statements is true after execution of the program? int a[10],I,*p; a[0] = 1; a[1] = 2; p = a; (*p)++;
Shantanu wants to make a program to print the sum of the first 7 multiples of 6. He writes the following program: integer i = 0 // statement 1 integer sum // statement 2 while ( i <= 42 ) // statement 3 { sum = sum + i // statement 4 i = i + 6; } print sum // statement 6 Does this program have an error? If yes, which one statement will you modify to correct the program?
What is the complexity of this algorithm? Algorithm Sum (a,n) { s := 0.0; for i := 1 to n do s := s + a [i]; return s;
Assume that the Point class is existing with the following snippet in the header file Point.h: class Point { Point(); Pont(int, int); int GetX(); int GetY(); void SetX(int); void SetY(int); }; If the objects of Point are created as Point oPointOne, oPointTwo(2,3); Which of the following statements are correct? (i)The statement oPointOne.SetX(20); Will compile and run successfully. (ii) The statement oPointOne.SetX(20).SetY(30); Will compile successfully but will give a run time error.
What will be output of following program? #include int main() { int huge *a =(int huge *)0x59990005; int huge *b =(int huge *)0x59980015; if(a == b) printf("power of pointer"); else printf("power of c"); return 0; }
Predict the output of following C++ program. #include  using namespace std; class abc { static int x; public: abc() { x++;} static int getX() {return x;} }; int Test::x = 0; int main() { cout << abc::getX() << " "; abc t[5]; cout << abc::getX(); }

What is the complexity of this algorithm? Algorithm Sum (a,n) { s := 0.0; for i := 1 to n do s := s + a [i]; return s;

Discussion

No Comment Found

Related MCQs

Reply to Comment