GATE 2022 Toppers Quiz 21
Attempt now to get your rank among 80 students!
Question 1
S1: If the load factor of a hash table is less than 1, then there is no collision.
S2 : In a breadth first search of an undirected graph there exist no cross edges but there may be back edge.
Which of the above statements is/are correct?
Question 2
Question 3
int gradeup(int n)
{
auto int r = 0;
if (n <=0) return 1;
if (n > 3)
{
r = n;
return gradeup(n – 2) + r;
}
return gradeup(n – 1) + r;
}
What is the value of gradeup(7)?
Question 4
When the tuple (7, 3) is deleted, the number of tuples that must be additionally deleted to preserve referential integrity are ________.
Question 5
S1 : It is used on the server side and causes a bound TCP socket to enter listening state.
S2 : It is used on the server side, and associates a socket with a socket address structure.
S3 : It is used on the client side, and assigns a free local port number to the socket.
S4 : It causes the system to release resources allocated to a socket.
Which of the following is correct?
Question 6
Question 7
S1 : The number of edges on the shortest path between ‘s’ and ‘a’ is atmost one more than the number of edges on the shortest path between ‘s’ and ‘b’.
S2 : The number of edges on the shortest path between ‘s’ and ‘a’ is atleast one less than the number of edges on the shortest path between ‘s’ and ‘b’.
S3 : There is a path between ‘a’ and ‘b’.
Which of the following is true?
Question 8
- 80 attempts
- 0 upvotes
- 0 comments
Tags :
GATE & PSU CSGeneral