PREVIOUS YEAR SOLVED PAPERS - GATE 2020

36. Let A and B be two n × n matrices over real numbers. Let rank(M) and det(M) denote the rank and determinant of a matrix M, respectively. Consider the following statements.
I. rank(AB) = rank(A) rank(B)
II. det(AB) = det(A) det(B)
III. rank(A + B) rank(A) + rank(B)
IV. det(A + B) det(A) + det(B)
Which of the above statements are TRUE?

  • Option : D
  • Explanation :
    d(AB) = d(A) × d(B)
    d(A + B) ≥ d(A) + d(B)
    r(A + B) ≤ r(A) + r(B)
    r(AB) ≠ r(A) r(B)
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


37. In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a, b]? Assume that the number of reported elements is k.

  • Option : A
  • Explanation :

    To find a number between range [x, y] requires log n comparisons.
    As, K numbers are to be found, K + log n would be time complexity.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


38. Consider three registers R1, R2, and R3 that store numbers in IEEE−754 single precision floating point format. Assume that R1 and R2 contain the values (in hexadecimal notation) 0x42200000 and 0xC1200000, respectively.
If R3 = R1 / R2, what is the value stored in R3 ?

  • Option : B
  • Explanation :
    R1: 0x42200000
    R2: 0xC1200000

    1. Subtract the exponents i.e. divisor exponent from the dividend exponent.

    2. Divide the mantissa i.e

    3. Sign (opposite sign division result sign is –ve)

    Hence, option (B) is correct answer.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


39. Consider a schedule of transactions T1 and T2:

T1RA  RC WD WBCommit 
T2 RBWB RD WC  Commit

Here, RX stands for “Read(X)” and WX stands for “Write(X)”. Which one following schedules is conflict equivalent to the above schedule?

  • Option : D
  • Explanation :
    R2(B) is conflicting with W1(B) so, W1(B) should always come after R2(B)
    W2(B) is conflicting with W1(B) similarly, W1(B) should always come after W2(B)
    R2(D) is conflicting with W1(D), so, W1(D) should always come after R2(D)
    R1(C) is conflicting with W2(C) so, W2(C) should always come after R1(C)
    Therefore the transaction will be:
    T1T2
     R(B)
     W(B)
     R(D)
    R(A) 
    R(C) 
    W(D) 
    W(B) 
     W(C)
    Commit 
     Commit
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


40. Consider a relational table R that is in 3NF, but not in BCNF. Which one following statements is TRUE?

  • Option : B
  • Explanation :
    R has a nontrivial functional dependency X → A where X is not a sup and A is a prime attribute.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


Related Quiz.
GATE 2020