Easy Tutorial
For Competitive Exams

Cisco Technical Test

Given two sorted lists of size m and n respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be?

mn
max(m,n)
min(m,n)
m+n-1
Additional Questions

Which indicates pre-order traversal?

Answer

What is the output of following program?

include

int main()

{

int n;

for (n = 9; n!=0; n--)

printf("n = %d", n--);

return 0;

}

Answer

How many times LogicGuns will be printed?

include

int main()

{

int i = -5;

while (i <= 5)

{

if (i >= 0)

break;

else

{

i++;

continue;

}

printf("LogicGuns");

}

return 0;

}

Answer

What will be the output of the following program on GCC compiler?

include

int main() {

int x=4, y, z;

y = --x;

z = x--;

printf("%d, %d, %d\n", x, y, z);

return 0;

}

Answer

Which of the following operation is illegal in structures?

Answer

How many enumerators will exist if four threads are simultaneously working on an ArrayList object?

Answer

Which constructs an anonymous inner class instance?

Answer

Which method must be defined by a class implementing the java.lang.Runnable interface?

Answer

What will be the output of the following program on GCC?

include

int message();

int main() {

int x,y,z;

x=y=z=-1;

z=++x && ++y || ++z;

printf(" x=%d y=%d z=%d\n", x,y,z);

return 0;

}

Answer

If the sum of three consecutive even numbers is 44 more than the average of these numbers, then the largest of these numbers is?

Answer
Share with Friends
Privacy Copyright Contact Us