Time Left - 10:00 mins
Campus Recruitment Tech Quiz-15
Attempt now to get your rank among 173 students!
Question 1
What is the output of the below program?
int main()
{
int x=8;
int *b=&x;
x=++*b;
printf(“%d”,x);
return 0;
}
int main()
{
int x=8;
int *b=&x;
x=++*b;
printf(“%d”,x);
return 0;
}
Question 2
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort?
Question 3
What is the output of the following C code? Assume that the address of x is 2000 (in decimal) and an integer requires four bytes of memory.
Question 4
Consider an array with "n" elements . All elements are integers and distinct in this array. In array , upto some place X , the elements are in increasing order and after that X , elements are in decreasing order.
Example array : Here X is 30
What is the time complexity to find X in the array :
Example array : Here X is 30
What is the time complexity to find X in the array :
Question 5
The STUDENT information in a university stored in the relation STUDENT (Name, SEX, Marks, DEPT_Name). Consider the following SQL Query
SELECTDEPT_Name
FROM STUDENT
WHERE SEX = ‘M’
GROUP BYDEPT_Name
HAVINGAVG (Marks)>SELECT AVG (Marks) FROM STUDENT.
It Returns the Name of the Department for which:
- 173 attempts
- 2 upvotes
- 2 comments
Tags :
GATE & PSU CSGeneralMay 25GATE & PSU CS
