GATE CS IT Question Paper 1997.
GATE CS IT Question Paper 1997 with Answers Solution Computer Science Information Technology 1997
GATE i.e. Graduate Aptitude Test in Engineering Computer Science Information Technology 1997 Exam Has been Conducted by IISc Bangalore IIT Bombay IIT Delhi IIT Guwahati IIT Kanpur IIT Kharagpur IIT Madras IIT Roorkee. This GATE CS IT 1997 examination is the procedure to get the admission in M.Tech
GATE Computer Science Information Technology i.e. CS IT Question Paper, This GATE CS IT 1997 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 IT 1997 question paper in pdf file for GATE CS IT you can download it in FRCS IT, if GATE Computer Science Information Technology 1997 paper in text for GATE CS IT you can download GATE CS IT 1997 page also just Go to menu bar, Click on File->then Save.
GATE CS IT Question Paper 1997
GATE CS IT 1997 Question paper Free Download PDF is available in www.oldquestionpapers.net which has been provided by many students this GATE Computer Science Information Technology 1997 paper is available for all the students in FRCS IT and also GATE CS IT 1997 question paper fully solved i.e with answer keys and solution.
You can get daily updates on GATE CS IT 1997 from www.oldquestionpapers.net here you can also check similar links for other related study materials on GATE Computer Science Information Technology exam. Here GATE CS IT 1997 question is also available in English.
SECTION – A
1.1 The probability that it will rain today is 0.5. The probability that it will rain tomorrow is 0.6. The probability that it will rain either today or tomorrow is 0.7. What is the probability that it will rain today and tomorrow?
(a) 0.3 (b) 0.25 (c) 0.35 (d) 0.4
1.4 The concatenation of two lists is to be performed on 0(1) time. Which of the following implementations of a list should be used?
(a) Singly linked list (b) Doubly linked list
(c) Circular doubly linked list (d) Array implementation of list
1.5 The correct matching for the following pairs is
(A) All pairs shortest paths (1) Greedy
(B) Quick Sort (2) Depth-First search
(C) Minimum weight spanning tree (3) Dynamic Programming
(D) Connected Components (4) Divide and Conquer
(a) A – 2 B – 4 C – 1 D – 3 (b) A – 3 B – 4 C – 1 D – 2
(c) A – 3 B – 4 C – 2 D – 1 (d) A – 4 B – 1 C – 2 D – 3
1.7 Which of the following is essential for converting an infix expression to the postfix form efficiently
(a) An operator stack (b) An operand stack
(c) An operand stack and an operator stack
(d) A parse tree
1.8 A language L allows declaration of arrays whose sizes are not known during compilation. It is required to make efficient use of memory. Which one of the following is true
(a) A compiler using static memory allocation can be written for L
(b) A compiler cannot be written for L; an interpreter must be used.
(c) A compiler using dynamic memory allocation can be written for L
(d) None of the above
1.9 The conditional expansion facility of macro processor is provided to
(a) test a condition during the execution of the expanded program
(b) to expand certain model statements depending upon the value of a condition during the execution of the expanded program
(C) to implement recursion
(d) to expand certain model statements depending upon the value of a condition during the process of macro expansion.
1.10 Heap allocation is required for languages.
(a) that support recursion
(b) that support dynamic data structures
(c) that use dynamic scope rules
(d) None of the above