Time Left - 12:00 mins

GATE 2022 Toppers Quiz 11

Attempt now to get your rank among 63 students!

Question 1

Consider the following statements given below:
S1: If every attribute is prime attribute in a relation R, then relation R will always be in BCNF.
S2: If relation R is in 3NF and every candidate key is simple then R will be in BCNF.
Which of the above statement is correct?

Question 2

Which of the following statements are TRUE?

i. Quick Sort is adaptive, an in-place sorting algorithm.

ii. Merge Sort is non adaptive, out-place sorting algorithm.

Question 3

Consider the following statements:
I. RIP uses distributed version of Bellman Ford algorithm.
II. RIP uses distance vector algorithm.
III. FTP uses port number 21 for data transfer.
Which of the above statement(s) is/are correct?

Question 4

Consider the circuit shown below:


The output function is equal to

Question 5

Consider the following 4-stages instruction pipeline where different instructions are spending different amount of time at different stages.

Following loop is executed in the pipeline:

for (i = 1; i< 2; i ++)

{

I1;

I2;

I3;

I4;

}

How many cycles are overlapped between the iterations?

Question 6

Identify valid search sequence for searching 89 on BST

Question 7

We define a new measure, called GoldIndex(G, C). It takes two arguments as input, namely a graph G, and a set of colours, C respectively. The subroutine outputs an integer denoting the number of ways of assigning colours to vertices in G such that at least two vertices in G have the same colour. Let Kn denote the complete graph having n vertices respectively, and C = {Red, Green, Blue, Yellow}. Then the GoldIndex(K3, C) will be equal to ________.

Question 8

Consider the following statements:

S1: If x1, x2, x3, x4 is a linearly independent sequence of vectors, then the sequence x1, x2, x3 is linearly independent.

S2: If x1, x2, x3, x4 is a linearly independent sequence of vectors, then the sequence x1, x2, x3 is linearly dependent.

Which of the following is true?

  • 63 attempts
  • 0 upvotes
  • 0 comments
Jun 17GATE & PSU CS