Time Left - 09:00 mins
ISRO Quiz-16
Attempt now to get your rank among 228 students!
Question 1
Which of the following is true about merge sort?
Question 2
The time complexity of an algorithm T(n), where n is the input size, is given by—
T(n)= T(n-1) + 1/n, if n>1
= 1, otherwise.
The order of the algorithm is—
Question 3
Shift reduce parsing belongs to a class of
Question 4
Peephole optimization is a form of
Question 5
The following program
main()
{
inc(); inc(); inc();
}
inc()
{
static int x;
printf("%d", ++x);
}
main()
{
inc(); inc(); inc();
}
inc()
{
static int x;
printf("%d", ++x);
}
Question 6
Which of the following is the highest isolation in transaction management?
Question 7
The Hexadecimal equivalent of 01111100110111100011 is
Question 8
Which of the following is not a valid rule for XOR?
- 228 attempts
- 1 upvote
- 5 comments
Tags :
GATE & PSU CSGeneralJun 20GATE & PSU CS