19-10-2012, 10:49 AM
GATE CS - 2002
cs2002.pdf (Size: 350.06 KB / Downloads: 154)
SECTION A
1. This question consists of TWENTY-FIVE sub-questions (1.1 — 1.25) of ONE mark each. For
each of these sub-questions, four possible alternatives, A, B, C and D are provided. Choose
the most appropriate alternative and darken its bubble on the Objective Response Sheet
(ORS) against the corresponding sub-question number using a soft HB pencil. Do not darken
more than one bubble for any sub-question. Do not use the ORS for any rough work. You may
use the answer book (last few pages) for any rough work.
1.1 The rank of the matrix is
00
(a) 4
(b) 2
© 1
(d) 0
1.2 The trapezoidal rule for integration gives exact result when the integrand is a polynomial
of degree
(a) 0 but not 1
(b) 1 but not 0
© 0 or 1
(d) 2
1.3 The solution to the recurrence equation T(2k) = 3T(2k_l)+ 1,T(1) = 1 is
(3k+_ —
(a) 2k
(b)
© 3IOg
(d) 2I0
1.4 The minimum number of colours required to colour the vertices of a cycle with n nodes in
such a way that no two adjacent nodes have the same colour is
(a) 2
(b) 3
© 4
(d) n_2[+2
1.5 In the worst case, the number of comparisons needed to search a singly linked list of
length n for a given element is
(a) log n
(b)
© log—1
(d) n
1.6 Which of the following is true?
(a) The set of all rational negative numbers forms a group under multiplication.
(b) The set of all non-singular matrices forms a group under multiplication.
© The set of all matrices forms a group under multiplication.
(d) Both B and C are true.
1.7 The language accepted by a Pushdown Automaton in which the stack is limited to 10 items
is best described as
(a) Context free
(b) Regular
© Deterministic Context free
(d) Recursive
1.8 “If X then Y unless Z” is represented by which of the following formulas in prepositional
logic? (“ “, is negation, “A” is conjunction, and “-“ is implication)
(a) (XA-iZ)-Y
(b) (XAY)--1Z
© X-(YA-iZ)
(d) (X-Y)A-iZ
1.9 A device employing INTR line for device interrupt puts the CALL instruction on the data
bus while
(a) INTA is active
(b) HOLD is active
© READY is active
(d) None of the above
1.10 In 8085 which of the following modifies the program counter?
(a) Only PCHL instruction
(b) Only ADD instructions
© Only JMP and CALL instructions
(d) All instructions
1.11 In serial data transmission, every byte of data is padded with a ‘0’ in the
beginning and one or two ‘l’s at the end of byte because
(a) Receiver is to be synchronized for byte reception
(b) Receiver recovers lost ‘0’s and ‘l’s from these padded bits
© Padded bits are useful in parity computation
(d) None of the above
1.12 Which of the following is not a form of memory?
(a) instruction cache
(b) instruction register
© instruction opcode
(d) translation look-a-side buffer
1.13 The decimal value 0.25
(a) is equivalent to the binary value 0.1
(b) is equivalent to the binary value 0.01
© is equivalent to the binary value 0.00111...
(d) cannot be represented precisely in binary