GATE CS Question Paper 2002.
GATE CS Computer Science Question Paper 2002 Answers Solution Free Download PDF 2002
GATE i.e. Graduate Aptitude Test in Engineering Computer Science 2002 Exam Has been Conducted by IISc Bangalore IIT Bombay IIT Delhi IIT Guwahati IIT Kanpur IIT Kharagpur IIT Madras IIT Roorkee. This GATE CS 2002 examination is the procedure to get the admission in M.Tech
GATE Computer Science i.e. CS Question Paper, This GATE CS 2002 Question will help all the students for their exam preparation, here the question type is MCQ i.e multiple choice question answers, if this GATE CS 2002 question paper in pdf file for GATE CS you can download it in FRCS, if GATE Computer Science 2002 paper in text for GATE CS you can download GATE CS 2002 page also just Go to menu bar, Click on File->then Save.
GATE CS Question Paper 2002
GATE CS 2002 Question paper Free Download PDF is available in www.oldquestionpapers.net which has been provided by many students this GATE Computer Science 2002 paper is available for all the students in FRCS and also GATE CS 2002 question paper fully solved i.e with answer keys and solution.
You can get daily updates on GATE CS 2002 from www.oldquestionpapers.net here you can also check similar links for other related study materials on GATE Computer Science exam. Here GATE CS 2002 question is also available in English.
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 (c) 0 or 1 (d) 2
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.
(c) 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
(c) Deterministic Context free (d) Recursive
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
(C) 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
(C) Only iMP and CALL instructions (d) All instructons
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
(c) Padded bits are useful in parity computation
(d) None of the above
1.13 Which of the following is not a form of memory?
(a) instruction cache (b) instruction register
(c) instruction opcode (d) translation look-a-side buffer
1.14 The decimal value 0.25
(a) is equivalent to the binary value 0.1
(b) is equivalent to the binary value 0.01
(c) is equivalent to the binary value 0.00111…
(d) cannot be represented precisely in binary
1.15 The 2’s complement representation of the decimal value —15 is
(a) 1111 (b) 11111 (c) 111111 (d) 10001
1.16 Sign extension is a step in
(a) floating point multiplication
(b) signed 16 bit integer addition
(c) arithmetic left shift
(d) converting a signed integer from one size to another
1.17 In the C language
(a) At most one activation record exists between the current activation record and the activation record for the main
(b) The number of activation records between the current activation record and the activation record fro the main depends on the actual function calling sequence.
(c) The visibility of global variables depends on the actual function calling sequence.
(d) Recursion requires the activation record for the recursive function to be saved on a different stack before the recursive fraction can be called.
1.18 The results returned by function under value-result and reference parameter passing conventions
(a) Do not differ
(b) Differ in the presence of loops
(c) Differ in all cases
(d) May differ in the presence of exception
1.19 Relation R with an associated set of functional dependencies, F, is decomposea into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is
(b) More than zero but less than that of an equivalent 3NF decomposition
(c) Proportional to the size of F