What is the the worst case time complexity of randomised quick sort?
Assume that f(n) and g(n) are functions such that:-
f(n) = O(n2)
g(n) = O(n3)
Then f(n) + g(n) will be equal to___________
What is an array in C/C++?
In java, which of these keywords cannot be used for a class which has been declared final?
What will be the output of this java program?
abstract class A
{
int i;
abstract void display();
}
class B extends A
{
int j;
void display()
{
System.out.println(j);
}
}
class Abstract_demo
{
public static void main(String args[])
{
B obj = new B();
obj.j=2;
obj.display();
}
}
In java, a dynamic array is implemented using which of the standard collections class?
Which collection class allows you to grow or shrink its size and provides indexed access to its elements, but whose methods are not synchronized?
What is the output of this C code?
#include <stdio.h>
int main()
{
int i = 0;
int x = i++, y = ++i;
printf("%d % d\n", x, y);
return 0;
}
What is the output of this C code?
#include <stdio.h>
int main()
{
int a = 10, b = 10;
if (a = 5)
b--;
printf("a = %d, b = %d", a, b--);
}
Which of the following statements is incorrect about strings in java?
