Time Left - 12:00 mins

GATE 2022 Toppers Quiz 21

Attempt now to get your rank among 80 students!

Question 1

Consider the following statement:

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

Type checking is normally done during

Question 3

Consider the following C function:

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

Consider the following table with attribute A is primary key and b is foreign key referencing A with on delete cascade.

When the tuple (7, 3) is deleted, the number of tuples that must be additionally deleted to preserve referential integrity are ________.

Question 5

Consider the following socket API functionalities:

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

A 4-stage pipeline has the stage delay 100, 150, 170, 180 nanoseconds respectively. Registers that are used between the stages have a delay of 2 nanoseconds each. Assuming constant clock rate, the total time taken to process 520 data items on this pipeline will be ________ μs. (Upto 2 decimal places)

Question 7

Consider two vertices ‘a’ and ‘b’ that are simultaneously on the FIFO queue at same point during the execution of breadth first search from ‘s’ in an undirected graph. Consider the following statements:

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

If for an event A, the odds in favour of the event are 5 to 4 . The probability of success of A is:
  • 80 attempts
  • 0 upvotes
  • 0 comments
Dec 31GATE & PSU CS