• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE-CS-2002

Question 1

The rank of the given matrix is -

[caption width="800"] [/caption]
  • 1
     

  • 0
     

  • 2
     

  • 4
     

Question 2

The trapezoidal rule for integration give exact result when the integrand is a polynomial of degree:
  • 0 but not 1
  • 1 but not 0
  • 0 or 1
  • 2

Question 3

The solution to the recurrence equation T(2k) = 3 T(2k-1) + 1, T (1) = 1, is:
  • 2k
  • (3k + 1 - 1)/2
  • 3log2k
  • 2log3k

Question 4

The minimum number of colours required to colour the vertices of a cycle with η nodes in such a way that no two adjacent nodes have the same colour is
  • 2
  • 3
  • 4
  • n - 2⌊n/2⌋ + 2

Question 5

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
  • log2 n
  • n/2
  • log2n - 1
  • n

Question 6

Which of the following is true?
  • The set of all rational negative numbers forms a group under multiplication.
  • The set of all non-singular matrices forms a group under multiplication.
  • The set of all matrices forms a group under multiplication.
  • Both (2) and (3) are true.

Question 7

The language accepted by a Pushdown Automation in which the stack is limited to 10 items is best described as
  • Context Free
  • Regular
  • Deterministic Context Free
  • Recursive

Question 8

"If X, then Y unless Z" is represented by which of the following formulae in propositional logic? ("¬" is negation "^" is conjunction, and "→" is implication)

  • (X ^ ¬ Z) → Y

  • (X ^ Y) → ¬ Z

  • (X → (Y ^ ¬ Z)

  • (X → Y(^ ¬ Z)

Question 9

A device employing INTR line for device interrupt puts the CALL instruction on the data bus while
		 
A)      gatecs2002Q8 is active
B)	HOLD is active
C)	READY is active
D)	None of these
  • A
  • B
  • C
  • D

Question 10

In 8085, which of the following modifies the program counter ?
  • Only PCHL instruction
  • Only ADD instructions
  • Only JMP and CALL instructions
  • All instructions

There are 50 questions to complete.

Last Updated :
Take a part in the ongoing discussion