# GATE-CS-2000

Question 1

The minimum number of cards to be dealt from an arbitrarily shuffled deck of 52 cards to guarantee that three cards are from some same suit is
• 3
• 8
• 9
• 12

Question 2

An n x n array v is defined as follows:
v[i, j] = i-j for all i, j, 1 <= i <= n, 1 <= j <= n
The sum of the elements of the array v is
• 0
• n-1
• n2 - 3n + 2
• n2 (n+1)/2

Question 3

The determinant of the matrix is

• 4

• 20

• 0

• 5

Question 4

Let S and T be language over Σ = {a,b} represented by the regular expressions (a+b*)* and (a+b)*, respectively. Which of the following is true?
• S ⊂ T
• T ⊂ S
• S = T
• S ∩ T = φ

Question 5

Let L denotes the language generated by the grammar S -> 0S0/00. Which of the following is true?

• L = 0+

• L is regular but not 0+

• L is context free but not regular

• L is not context free

Question 6

The number 43 in 2\'s complement representation is
• 01010101
• 11010101
• 00101011
• 10101011

Question 7

To put the 8085 microprocessor in the wait state
• lower the-HOLD input
• raise the HOLD input

Question 8

Comparing the time T1 taken for a single instruction on a pipelined CPU with time T2 taken on a non­ pipelined but identical CPU, we can say that
• T1 <= T2
• T1 >= T2
• T1 < T2
• T1 is T2 plus the time taken for one instruction fetch cycle

Question 9

The 8085 microprocessor responds to the presence of an interrupt
• As soon as the TRAP pin becomes \'high\'
• By checking the TRAP pin for \'high\' status at the end of each instruction fetch
• By checking the TRAP pin for \'high\' status at the end of the execution of each instruction
• By Checking the TRAP pin for \'high\' status at regular intervals

Question 10

The most appropriate matching for the following pairs
X: Indirect addressing            1 : Loops

Y: Immediate addressing           2 : Pointers

Z: Auto decrement addressing      3: Constants
is
• X-3, Y-2, Z-1
• X-I, Y-3, Z-2
• X-2, Y-3, Z-1
• X-3, Y-l, Z-2

There are 49 questions to complete.

Last Updated :
Take a part in the ongoing discussion