• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE-CS-2014-(Set-2)

Question 61

Consider a main memory system that consists of 8 memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied for 100 nanoseconds (ns) by the data, address, and control signals. During the same 100 ns, and for 500 ns thereafter, the addressed memory module executes one cycle accepting and storing the data. The (internal) operation of different memory modules may overlap in time, but only one request can be on the bus at any time. The maximum number of stores (of one word each) that can be initiated in 1 millisecond is ____________

  • 1000

  • 10000

  • 100000

  • 100

Question 62

Consider two strings A = "qpqrr" and B = "pqprqrp". Let x be the length of the longest common subsequence (not necessarily contiguous) between A and B and let y be the number of such longest common subsequences between A and B. Then x + 10y = ___.

  • 33

  • 23

  • 43

  • 34

Question 63

The probability that a given positive integer lying between 1 and 100 (both inclusive) is NOT divisible by 2, 3 or 5 is ______ .
  • 0.259
  • 0.459
  • 0.325
  • 0.225

Question 64

Match the columns.
   Column 1          Column 2
1) eradicate       P) misrepresent
2) distort         Q) soak completely
3) saturate        R) use
4) utilize         S) destroy utterly 
  • 1:S, 2:P, 3:Q, 4:R
  • 1:P, 2:Q, 3:R, 4:S
  • 1:Q, 2:R, 3:S, 4:P
  • 1:S, 2:P, 3:R, 4:Q

There are 64 questions to complete.

Last Updated :
Take a part in the ongoing discussion