Time Left - 10:00 mins
Campus Recruitment Tech Quiz- 29
Attempt now to get your rank among 188 students!
Question 1
Given two sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be :
Question 2
Merge sort uses
Question 3
If x is one dimensional array, then pick up the correct answer
Question 4
An Abstract class is:
Question 5
The Output of following code is-
int main()
{
int a = 5;
int *ptr ;
ptr = &a;
*ptr = *ptr * 3;
printf("%d", a);
return 0;
}
- 188 attempts
- 1 upvote
- 6 comments
Tags :
GATE & PSU CSGeneralJun 22GATE & PSU CS