Time Left - 10:00 mins
Campus Recruitment Tech Quiz- 21
Attempt now to get your rank among 257 students!
Question 1
What is the worst case complexity of bubble sort?
Question 2
The number of swapping needed to sort the numbers 8, 22, 7, 9, 31, 5, 13 in ascending order, using bubble sort is
Question 3
void main ( )
{
char P[7] = “123456”, *q;
q = P + 3;
*q = ‘0’;
printf(“%s", P);
}
What is the output of above program?
Question 4
for(i=2; i<10; i+=2)
if(i==6)
continue;
else
printf(“%d” ,i );
The above code results in
if(i==6)
continue;
else
printf(“%d” ,i );
The above code results in
Question 5
Which of the following is/are stable algorithms?
1) Bubble sort
2) merge sort
3) Heap sort
4) insertion sort
- 257 attempts
- 1 upvote
- 4 comments
Tags :
GATE & PSU CSGeneralJun 6GATE & PSU CS