Big O notation is defined for – McqOptions

MCQOPTIONS

1.	Big O notation is defined for
A.	Time and Space Complexity
B.	Optimality
C.	Searching
D.	Sorting
Answer» B. Optimality

Discussion

No Comment Found

Related MCQs

int * ptr=(int *) realloc(NULL,100) is same as
output of following program #include<stdio.h> int f1( int ); void main() { int b=5; printf("%d,%d", f1(b),f1(b)); } int f1(int b) { static int n=5; n++; return n; }
The effectiveness of an algorithm is best stated in
Big O notation is defined for
Iterators are________________
What happens when the following piece of code in file1.c, is compiled and executed? namespace { Class Temp { public: int GetVal() { return 100; } }; } //end of namespace int main() { Temp oTempObj1; Cout<<otempobj1.getval()<<endl;  } </otempobj1.getval()<<endl;